bolognese 0.6.6 → 0.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (52) hide show
  1. checksums.yaml +4 -4
  2. data/Gemfile.lock +1 -1
  3. data/README.md +33 -1
  4. data/lib/bolognese.rb +1 -0
  5. data/lib/bolognese/codemeta.rb +145 -0
  6. data/lib/bolognese/crossref.rb +1 -0
  7. data/lib/bolognese/datacite.rb +1 -0
  8. data/lib/bolognese/metadata.rb +18 -0
  9. data/lib/bolognese/schema_org.rb +5 -2
  10. data/lib/bolognese/version.rb +1 -1
  11. data/spec/codemeta_spec.rb +81 -0
  12. data/spec/datacite_spec.rb +16 -0
  13. data/spec/fixtures/codemeta.json +87 -0
  14. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/BlogPosting.yml +7 -329
  15. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Dataset.yml +7 -1759
  16. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Date.yml +7 -331
  17. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Funding_schema_version_3.yml +7 -7
  18. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Funding_schema_version_4.yml +7 -7
  19. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Schema_org_JSON.yml +7 -7
  20. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/is_identical_to.yml +7 -7
  21. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/multiple_licenses.yml +7 -7
  22. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_bibtex/BlogPosting.yml +7 -7
  23. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_bibtex/Dataset.yml +7 -7
  24. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_codemeta/SoftwareSourceCode.yml +133 -0
  25. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_datacite_xml_4_0/Dataset.yml +7 -7
  26. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_datacite_xml_4_0/Funding.yml +7 -7
  27. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata_as_string/Dataset.yml +7 -7
  28. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_alternate_identifiers/insert.yml +7 -7
  29. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_contributors/none.yml +7 -7
  30. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_creators/insert.yml +7 -7
  31. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_dates/insert.yml +7 -7
  32. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_descriptions/insert.yml +7 -7
  33. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_identifier/doi.yml +7 -7
  34. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_person/creator_only_name.yml +7 -7
  35. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_publication_year/insert.yml +7 -7
  36. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_publisher/insert.yml +7 -7
  37. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_related_identifiers/insert.yml +7 -7
  38. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_related_identifiers/rel_identifiers.yml +7 -7
  39. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_resource_type/insert.yml +7 -7
  40. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_rights_list/insert.yml +7 -7
  41. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_subjects/insert.yml +7 -7
  42. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_titles/insert.yml +7 -7
  43. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_version/insert.yml +7 -7
  44. data/spec/schema_org_spec.rb +2 -2
  45. metadata +6 -9
  46. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_contributors/insert.yml +0 -173
  47. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_person/creator.yml +0 -173
  48. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_person/creator_given_and_family_name.yml +0 -173
  49. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_related_identifiers/get_related_identifier_type.yml +0 -173
  50. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_related_identifiers/get_related_identifier_type_DOI.yml +0 -173
  51. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_related_identifiers/get_related_identifier_type_URL.yml +0 -173
  52. data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/insert_titles/doi.yml +0 -173
data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Date.yml CHANGED
@@ -23,20 +23,20 @@ http_interactions:
23
23
  Location:
24
24
  - http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
25
25
  Expires:
26
- - Sat, 18 Feb 2017 08:28:49 GMT
26
+ - Fri, 24 Feb 2017 00:31:22 GMT
27
27
  Content-Type:
28
28
  - text/html;charset=utf-8
29
29
  Content-Length:
30
30
  - '191'
31
31
  Date:
32
- - Sat, 18 Feb 2017 08:05:59 GMT
32
+ - Thu, 23 Feb 2017 23:42:08 GMT
33
33
  body:
34
34
  encoding: UTF-8
35
35
  string: |-
36
36
  <html><head><title>Handle Redirect</title></head>
37
37
  <body><a href="http://data.datacite.org/10.4230%2Flipics.tqc.2013.93">http://data.datacite.org/10.4230%2Flipics.tqc.2013.93</a></body></html>
38
38
  http_version:
39
- recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
39
+ recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
40
40
  - request:
41
41
  method: get
42
42
  uri: http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
@@ -56,7 +56,7 @@ http_interactions:
56
56
  Server:
57
57
  - openresty/1.11.2.2
58
58
  Date:
59
- - Sat, 18 Feb 2017 08:06:00 GMT
59
+ - Thu, 23 Feb 2017 23:42:09 GMT
60
60
  Content-Type:
61
61
  - text/html
62
62
  Content-Length:
@@ -70,7 +70,7 @@ http_interactions:
70
70
  string: "<html>\r\n<head><title>301 Moved Permanently</title></head>\r\n<body
71
71
  bgcolor=\"white\">\r\n<center><h1>301 Moved Permanently</h1></center>\r\n<hr><center>openresty/1.11.2.2</center>\r\n</body>\r\n</html>\r\n"
72
72
  http_version:
73
- recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
73
+ recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
74
74
  - request:
75
75
  method: get
76
76
  uri: https://data.datacite.org/10.4230%2Flipics.tqc.2013.93
@@ -90,7 +90,7 @@ http_interactions:
90
90
  Server:
91
91
  - openresty/1.11.2.2
92
92
  Date:
93
- - Sat, 18 Feb 2017 08:06:00 GMT
93
+ - Thu, 23 Feb 2017 23:42:09 GMT
94
94
  Content-Type:
95
95
  - application/vnd.datacite.datacite+xml
96
96
  Content-Length:
@@ -130,329 +130,5 @@ http_interactions:
130
130
  remaining open cases, and we use graph theory techniques to produce a computer-assisted
131
131
  proof that our constructions are indeed the smallest possible.\n\t</description>\n</descriptions>\n</resource>\n"
132
132
  http_version:
133
- recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
134
- - request:
135
- method: get
136
- uri: https://doi.org/10.4230/lipics.tqc.2013.93
137
- body:
138
- encoding: US-ASCII
139
- string: ''
140
- headers:
141
- User-Agent:
142
- - Maremma - https://github.com/datacite/maremma
143
- Accept:
144
- - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
145
- response:
146
- status:
147
- code: 303
148
- message: ''
149
- headers:
150
- Server:
151
- - Apache-Coyote/1.1
152
- Vary:
153
- - Accept
154
- Location:
155
- - http://drops.dagstuhl.de/opus/volltexte/2013/4317/
156
- Expires:
157
- - Sat, 18 Feb 2017 08:28:49 GMT
158
- Content-Type:
159
- - text/html;charset=utf-8
160
- Content-Length:
161
- - '185'
162
- Date:
163
- - Sat, 18 Feb 2017 08:05:59 GMT
164
- body:
165
- encoding: UTF-8
166
- string: |-
167
- <html><head><title>Handle Redirect</title></head>
168
- <body><a href="http://drops.dagstuhl.de/opus/volltexte/2013/4317/">http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></body></html>
169
- http_version:
170
- recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
171
- - request:
172
- method: get
173
- uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/
174
- body:
175
- encoding: US-ASCII
176
- string: ''
177
- headers:
178
- User-Agent:
179
- - Maremma - https://github.com/datacite/maremma
180
- Accept:
181
- - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
182
- response:
183
- status:
184
- code: 200
185
- message: ''
186
- headers:
187
- Date:
188
- - Sat, 18 Feb 2017 08:06:00 GMT
189
- Server:
190
- - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4
191
- mod_perl/2.0.2 Perl/v5.8.8
192
- Last-Modified:
193
- - Fri, 06 Nov 2015 12:44:15 GMT
194
- Etag:
195
- - '"15601a-1ddd-99e225c0"'
196
- Accept-Ranges:
197
- - bytes
198
- Content-Length:
199
- - '7645'
200
- Content-Type:
201
- - text/html
202
- body:
203
- encoding: UTF-8
204
- string: "<HTML>\n<HEAD>\n<meta http-equiv=\"Content-Type\" content=\"text/html;
205
- charset=iso-8859-1\">\n<META NAME=\"DC.Publisher\" CONTENT=\"Schloss Dagstuhl
206
- - Leibniz-Zentrum fuer Informatik\">\n<META NAME=\"citation_conference_title\"
207
- CONTENT=\"8th Conference on the Theory of Quantum Computation, Communication
208
- and Cryptography (TQC 2013)\">\n<META NAME=\"citation_journal_title\" CONTENT=\"LIPIcs
209
- - Leibniz International Proceedings in Informatics\">\n<META NAME=\"citation_issn\"
210
- CONTENT=\"1868-8969\">\n<META NAME=\"citation_isbn\" CONTENT=\"978-3-939897-55-2\">\n<META
211
- NAME=\"citation_volume\" CONTENT=\"22\">\n<META NAME=\"citation_doi\" CONTENT=\"10.4230/LIPIcs.TQC.2013.93\">\n<META
212
- NAME=\"citation_startpage\" CONTENT=\"93\">\n<META NAME=\"citation_lastpage\"
213
- CONTENT=\"105\">\n<META NAME=\"DC.Title\" LANG=\"eng\" CONTENT=\"The Minimum
214
- Size of Qubit Unextendible Product Bases\">\n<META NAME=\"citation_title\"
215
- CONTENT=\"The Minimum Size of Qubit Unextendible Product Bases\">\n<META NAME=\"DC.Creator.PersonalName\"
216
- CONTENT=\"Johnston, Nathaniel\">\n<META NAME=\"citation_author\" CONTENT=\"Johnston,
217
- Nathaniel\">\n<META NAME=\"DC.Subject\" SCHEME=\"SWD\" CONTENT=\"unextendible
218
- product basis; quantum entanglement; graph factorization\">\n<META NAME=\"DC.Subject\"
219
- SCHEME=\"DDC-Sachgruppe\" CONTENT=\"004\">\n<META NAME=\"DC.Date.Creation_of_intellectual_content\"
220
- CONTENT=\"2013\">\n<META NAME=\"citation_date\" CONTENT=\"2013\">\n<META NAME=\"DC.Date.Creation_of_present_form\"
221
- SCHEME=\"ISO8601\" CONTENT=\"2013-11-05\">\n<META NAME=\"DC.Type\" CONTENT=\"InProceedings\">\n<META
222
- NAME=\"DC.Format\" SCHEME=\"IMT\" CONTENT=\"application/pdf\">\n<META NAME=\"DC.Identifier\"
223
- SCHEME=\"urn:nbn:de\" CONTENT=\"urn:nbn:de:0030-drops-43173\">\n<META NAME=\"DC.Identifier\"
224
- SCHEME=\"URL\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/index.html\">\n<META
225
- NAME=\"citation_pdf_url\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<META
226
- NAME=\"DC.Source\" CONTENT=\"DROPS-IDN/4317\">\n<META NAME=\"DC.Language\"
227
- SCHEME=\"ISO639-2\" CONTENT=\"eng\">\n<META NAME=\"DC.Description\" LANG=\"eng\"
228
- CONTENT=\"We investigate the problem of constructing unextendible product
229
- bases in the qubit case - that is, when each local dimension equals 2. The
230
- cardinality of the smallest unextendible product basis is known in all qubit
231
- cases except when the number of parties is a multiple of 4 greater than 4
232
- itself. We construct small unextendible product bases in all of the remaining
233
- open cases, and we use graph theory techniques to produce a computer-assisted
234
- proof that our constructions are indeed the smallest possible.\">\n<TITLE>DROPS
235
- - The Minimum Size of Qubit Unextendible Product Bases</TITLE></HEAD>\n<BODY
236
- BGCOLOR=\"#FFFFFF\" TEXT=\"#000000\" LINK=\"#606060\" VLINK=\"#303030\" itemscope
237
- itemtype=\"http://schema.org/WebPage\">\n<IMG SRC=\"/opus/Icons/drops-logo.png\"
238
- ALIGN=TOP BORDER=0 VSPACE=0 HSPACE=0>\n </H2>\n </TD>\n </TR>\n</TABLE>\n<FONT
239
- FACE=arial, arial, helvetica>\n<HR>\n<div itemscope itemtype=\"http://schema.org/ScholarlyArticle\"
240
- itemid=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<span style=\"display:none\"
241
- itemprop=\"provider\">Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH</span>\n<span
242
- style=\"display:none\" itemprop=\"publisher\">Schloss Dagstuhl - Leibniz-Zentrum
243
- fuer Informatik GmbH</span>\n<span style=\"display:none\" itemprop=\"learningResourceType\">scholarly
244
- article </span>\n<span style=\"display:none\" itemprop=\"inLanguage\">en</span>\n<span
245
- style=\"display:none\" itemprop=\"copyrightHolder\">Johnston, Nathaniel</span>\n<span
246
- style=\"display:none\" itemprop=\"publishingPrinciples\">http://www.dagstuhl.de/lipics</span>\n<FONT
247
- SIZE=-1><A HREF=/doku/urheberrecht1.html>License</A><BR>\nwhen quoting this
248
- document, please refer to the following<BR>\nDOI: <a itemprop=\"url\" href=\"http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93\"><B>10.4230/LIPIcs.TQC.2013.93</B></a><BR>\nURN:
249
- <a href=\"http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-43173\"><B>urn:nbn:de:0030-drops-43173</B></a><BR>\nURL:
250
- <a itemprop=\"url\" href=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\"><B>http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></B>
251
- \n</FONT>\n<HR>\n<font face=arial, arial, helvetica>\n<B><A itemprop=\"author\"
252
- HREF=\"/opus/ergebnis.php?wer=opus&suchart=teil&Lines_Displayed=10&sort=o.date_year+DESC%2C+o.title&suchfeld1=freitext&suchwert1=&opt1=AND&opt2=AND&suchfeld3=date_year&suchwert3=&startindex=0&page=0&dir=2&suche=&suchfeld2=oa.person&suchwert2=Johnston%2C%20Nathaniel\">Johnston,
253
- Nathaniel</A></B>\n\n</B><P>\n<H3 itemprop=\"name\">The Minimum Size of Qubit
254
- Unextendible Product Bases</H3>\n<TABLE> \n<TR><TD><font face=arial, arial,
255
- helvetica>\npdf-format: </TD>\n\n<TD><TABLE BORDER=3 CELLPADDING=4 CELLSPACING=4>\n<TR>\n\n<TD><font
256
- face=arial, arial, helvetica>\n<A itemprop=\"url\" HREF=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/pdf/20.pdf\">20.pdf
257
- (0.5 MB) </A>\n</TD>\n</TR>\n</TABLE>\n</TD>\n</TR>\n</TABLE>\n<P>\n<HR>\n\n<div
258
- itemprop=\"about\">\n<H3>Abstract</H3>\nWe investigate the problem of constructing
259
- unextendible product bases in the qubit case - that is, when each local dimension
260
- equals 2. The cardinality of the smallest unextendible product basis is known
261
- in all qubit cases except when the number of parties is a multiple of 4 greater
262
- than 4 itself. We construct small unextendible product bases in all of the
263
- remaining open cases, and we use graph theory techniques to produce a computer-assisted
264
- proof that our constructions are indeed the smallest possible. \n</div>\n<HR><P>
265
- \n<H3>BibTeX - Entry</H3>\n<PRE><tt>@InProceedings{johnston:LIPIcs:2013:4317,\n
266
- \ author =\t{Nathaniel Johnston},\n title =\t{{The Minimum Size of Qubit
267
- Unextendible Product Bases}},\n booktitle =\t{8th Conference on the Theory
268
- of Quantum Computation, Communication and Cryptography (TQC 2013)},\n pages
269
- =\t{93--105},\n series =\t{Leibniz International Proceedings in Informatics
270
- (LIPIcs)},\n ISBN =\t{978-3-939897-55-2},\n ISSN =\t{1868-8969},\n year
271
- =\t{2013},\n volume =\t{22},\n editor =\t{Simone Severini and Fernando Brandao},\n
272
- \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n address
273
- =\t{Dagstuhl, Germany},\n URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
274
- \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
275
- \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
276
- factorization}\n}\n</tt></PRE> \n<HR><P> \n<TABLE BORDER=0> \n<TR> \n<TD VALIGN=TOP><font
277
- face=arial, arial, helvetica>\n<B>Keywords:</B></TD> \n<TD></TD><TD><font
278
- face=arial, arial, helvetica>\nunextendible product basis; quantum entanglement;
279
- graph factorization </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
280
- arial, helvetica>\n<B>Seminar:</B></TD>\n<TD></TD><TD><font face=arial, arial,
281
- helvetica>\n8th Conference on the Theory of Quantum Computation, Communication
282
- and Cryptography (TQC 2013) \n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
283
- arial, helvetica>\n<B>Related Scholarly Article:</B></TD> \n<TD></TD><TD><font
284
- face=arial, arial, helvetica>\n<a href=\"\"></a> </TD>\n</TR> \n<TR> \n<TD
285
- VALIGN=TOP><font face=arial, arial, helvetica>\n<B>Issue date:</B></TD> \n<TD></TD><TD><font
286
- face=arial, arial, helvetica>\n2013 </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font
287
- face=arial, arial, helvetica>\n<B>Date of publication:</B></TD> \n<TD></TD><TD><font
288
- face=arial, arial, helvetica>\n<span itemprop=\"copyrightYear\">2013</span>
289
- </TD>\n<span style=\"display:none\" itemprop=\"datePublished\">2013</span>
290
- </TD>\n</TR> \n</TABLE> \n</div> \n<P>\n<HR>\n<CENTER>\n<A HREF=\"/opus\">DROPS-Home</A>
291
- |\n<A HREF=\"/opus/suche/index.php\">Fulltext Search</A> |\n<A HREF=\"/opus/doku/imprint.php\">Imprint</A>\n<IMG
292
- alt=\"Published by LZI\" SRC=\"/opus/Icons/logo_t.png\" ALIGN=\"right\" BORDER=0
293
- VSPACE=0 HSPACE=10>\n</CENTER>\n<BR><BR>\n<BR><BR>\n</tr>\n</table>\n</BODY>\n</HTML>"
294
- http_version:
295
- recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
296
- - request:
297
- method: get
298
- uri: https://doi.org/10.4230/lipics.tqc.2013.93
299
- body:
300
- encoding: US-ASCII
301
- string: ''
302
- headers:
303
- User-Agent:
304
- - Maremma - https://github.com/datacite/maremma
305
- Accept:
306
- - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
307
- response:
308
- status:
309
- code: 303
310
- message: ''
311
- headers:
312
- Server:
313
- - Apache-Coyote/1.1
314
- Vary:
315
- - Accept
316
- Location:
317
- - http://drops.dagstuhl.de/opus/volltexte/2013/4317/
318
- Expires:
319
- - Sat, 18 Feb 2017 08:28:49 GMT
320
- Content-Type:
321
- - text/html;charset=utf-8
322
- Content-Length:
323
- - '185'
324
- Date:
325
- - Sat, 18 Feb 2017 08:06:00 GMT
326
- body:
327
- encoding: UTF-8
328
- string: |-
329
- <html><head><title>Handle Redirect</title></head>
330
- <body><a href="http://drops.dagstuhl.de/opus/volltexte/2013/4317/">http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></body></html>
331
- http_version:
332
- recorded_at: Sat, 18 Feb 2017 08:06:01 GMT
333
- - request:
334
- method: get
335
- uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/
336
- body:
337
- encoding: US-ASCII
338
- string: ''
339
- headers:
340
- User-Agent:
341
- - Maremma - https://github.com/datacite/maremma
342
- Accept:
343
- - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
344
- response:
345
- status:
346
- code: 200
347
- message: ''
348
- headers:
349
- Date:
350
- - Sat, 18 Feb 2017 08:06:01 GMT
351
- Server:
352
- - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4
353
- mod_perl/2.0.2 Perl/v5.8.8
354
- Last-Modified:
355
- - Fri, 06 Nov 2015 12:44:15 GMT
356
- Etag:
357
- - '"15601a-1ddd-99e225c0"'
358
- Accept-Ranges:
359
- - bytes
360
- Content-Length:
361
- - '7645'
362
- Content-Type:
363
- - text/html
364
- body:
365
- encoding: UTF-8
366
- string: "<HTML>\n<HEAD>\n<meta http-equiv=\"Content-Type\" content=\"text/html;
367
- charset=iso-8859-1\">\n<META NAME=\"DC.Publisher\" CONTENT=\"Schloss Dagstuhl
368
- - Leibniz-Zentrum fuer Informatik\">\n<META NAME=\"citation_conference_title\"
369
- CONTENT=\"8th Conference on the Theory of Quantum Computation, Communication
370
- and Cryptography (TQC 2013)\">\n<META NAME=\"citation_journal_title\" CONTENT=\"LIPIcs
371
- - Leibniz International Proceedings in Informatics\">\n<META NAME=\"citation_issn\"
372
- CONTENT=\"1868-8969\">\n<META NAME=\"citation_isbn\" CONTENT=\"978-3-939897-55-2\">\n<META
373
- NAME=\"citation_volume\" CONTENT=\"22\">\n<META NAME=\"citation_doi\" CONTENT=\"10.4230/LIPIcs.TQC.2013.93\">\n<META
374
- NAME=\"citation_startpage\" CONTENT=\"93\">\n<META NAME=\"citation_lastpage\"
375
- CONTENT=\"105\">\n<META NAME=\"DC.Title\" LANG=\"eng\" CONTENT=\"The Minimum
376
- Size of Qubit Unextendible Product Bases\">\n<META NAME=\"citation_title\"
377
- CONTENT=\"The Minimum Size of Qubit Unextendible Product Bases\">\n<META NAME=\"DC.Creator.PersonalName\"
378
- CONTENT=\"Johnston, Nathaniel\">\n<META NAME=\"citation_author\" CONTENT=\"Johnston,
379
- Nathaniel\">\n<META NAME=\"DC.Subject\" SCHEME=\"SWD\" CONTENT=\"unextendible
380
- product basis; quantum entanglement; graph factorization\">\n<META NAME=\"DC.Subject\"
381
- SCHEME=\"DDC-Sachgruppe\" CONTENT=\"004\">\n<META NAME=\"DC.Date.Creation_of_intellectual_content\"
382
- CONTENT=\"2013\">\n<META NAME=\"citation_date\" CONTENT=\"2013\">\n<META NAME=\"DC.Date.Creation_of_present_form\"
383
- SCHEME=\"ISO8601\" CONTENT=\"2013-11-05\">\n<META NAME=\"DC.Type\" CONTENT=\"InProceedings\">\n<META
384
- NAME=\"DC.Format\" SCHEME=\"IMT\" CONTENT=\"application/pdf\">\n<META NAME=\"DC.Identifier\"
385
- SCHEME=\"urn:nbn:de\" CONTENT=\"urn:nbn:de:0030-drops-43173\">\n<META NAME=\"DC.Identifier\"
386
- SCHEME=\"URL\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/index.html\">\n<META
387
- NAME=\"citation_pdf_url\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<META
388
- NAME=\"DC.Source\" CONTENT=\"DROPS-IDN/4317\">\n<META NAME=\"DC.Language\"
389
- SCHEME=\"ISO639-2\" CONTENT=\"eng\">\n<META NAME=\"DC.Description\" LANG=\"eng\"
390
- CONTENT=\"We investigate the problem of constructing unextendible product
391
- bases in the qubit case - that is, when each local dimension equals 2. The
392
- cardinality of the smallest unextendible product basis is known in all qubit
393
- cases except when the number of parties is a multiple of 4 greater than 4
394
- itself. We construct small unextendible product bases in all of the remaining
395
- open cases, and we use graph theory techniques to produce a computer-assisted
396
- proof that our constructions are indeed the smallest possible.\">\n<TITLE>DROPS
397
- - The Minimum Size of Qubit Unextendible Product Bases</TITLE></HEAD>\n<BODY
398
- BGCOLOR=\"#FFFFFF\" TEXT=\"#000000\" LINK=\"#606060\" VLINK=\"#303030\" itemscope
399
- itemtype=\"http://schema.org/WebPage\">\n<IMG SRC=\"/opus/Icons/drops-logo.png\"
400
- ALIGN=TOP BORDER=0 VSPACE=0 HSPACE=0>\n </H2>\n </TD>\n </TR>\n</TABLE>\n<FONT
401
- FACE=arial, arial, helvetica>\n<HR>\n<div itemscope itemtype=\"http://schema.org/ScholarlyArticle\"
402
- itemid=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<span style=\"display:none\"
403
- itemprop=\"provider\">Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH</span>\n<span
404
- style=\"display:none\" itemprop=\"publisher\">Schloss Dagstuhl - Leibniz-Zentrum
405
- fuer Informatik GmbH</span>\n<span style=\"display:none\" itemprop=\"learningResourceType\">scholarly
406
- article </span>\n<span style=\"display:none\" itemprop=\"inLanguage\">en</span>\n<span
407
- style=\"display:none\" itemprop=\"copyrightHolder\">Johnston, Nathaniel</span>\n<span
408
- style=\"display:none\" itemprop=\"publishingPrinciples\">http://www.dagstuhl.de/lipics</span>\n<FONT
409
- SIZE=-1><A HREF=/doku/urheberrecht1.html>License</A><BR>\nwhen quoting this
410
- document, please refer to the following<BR>\nDOI: <a itemprop=\"url\" href=\"http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93\"><B>10.4230/LIPIcs.TQC.2013.93</B></a><BR>\nURN:
411
- <a href=\"http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-43173\"><B>urn:nbn:de:0030-drops-43173</B></a><BR>\nURL:
412
- <a itemprop=\"url\" href=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\"><B>http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></B>
413
- \n</FONT>\n<HR>\n<font face=arial, arial, helvetica>\n<B><A itemprop=\"author\"
414
- HREF=\"/opus/ergebnis.php?wer=opus&suchart=teil&Lines_Displayed=10&sort=o.date_year+DESC%2C+o.title&suchfeld1=freitext&suchwert1=&opt1=AND&opt2=AND&suchfeld3=date_year&suchwert3=&startindex=0&page=0&dir=2&suche=&suchfeld2=oa.person&suchwert2=Johnston%2C%20Nathaniel\">Johnston,
415
- Nathaniel</A></B>\n\n</B><P>\n<H3 itemprop=\"name\">The Minimum Size of Qubit
416
- Unextendible Product Bases</H3>\n<TABLE> \n<TR><TD><font face=arial, arial,
417
- helvetica>\npdf-format: </TD>\n\n<TD><TABLE BORDER=3 CELLPADDING=4 CELLSPACING=4>\n<TR>\n\n<TD><font
418
- face=arial, arial, helvetica>\n<A itemprop=\"url\" HREF=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/pdf/20.pdf\">20.pdf
419
- (0.5 MB) </A>\n</TD>\n</TR>\n</TABLE>\n</TD>\n</TR>\n</TABLE>\n<P>\n<HR>\n\n<div
420
- itemprop=\"about\">\n<H3>Abstract</H3>\nWe investigate the problem of constructing
421
- unextendible product bases in the qubit case - that is, when each local dimension
422
- equals 2. The cardinality of the smallest unextendible product basis is known
423
- in all qubit cases except when the number of parties is a multiple of 4 greater
424
- than 4 itself. We construct small unextendible product bases in all of the
425
- remaining open cases, and we use graph theory techniques to produce a computer-assisted
426
- proof that our constructions are indeed the smallest possible. \n</div>\n<HR><P>
427
- \n<H3>BibTeX - Entry</H3>\n<PRE><tt>@InProceedings{johnston:LIPIcs:2013:4317,\n
428
- \ author =\t{Nathaniel Johnston},\n title =\t{{The Minimum Size of Qubit
429
- Unextendible Product Bases}},\n booktitle =\t{8th Conference on the Theory
430
- of Quantum Computation, Communication and Cryptography (TQC 2013)},\n pages
431
- =\t{93--105},\n series =\t{Leibniz International Proceedings in Informatics
432
- (LIPIcs)},\n ISBN =\t{978-3-939897-55-2},\n ISSN =\t{1868-8969},\n year
433
- =\t{2013},\n volume =\t{22},\n editor =\t{Simone Severini and Fernando Brandao},\n
434
- \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n address
435
- =\t{Dagstuhl, Germany},\n URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
436
- \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
437
- \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
438
- factorization}\n}\n</tt></PRE> \n<HR><P> \n<TABLE BORDER=0> \n<TR> \n<TD VALIGN=TOP><font
439
- face=arial, arial, helvetica>\n<B>Keywords:</B></TD> \n<TD></TD><TD><font
440
- face=arial, arial, helvetica>\nunextendible product basis; quantum entanglement;
441
- graph factorization </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
442
- arial, helvetica>\n<B>Seminar:</B></TD>\n<TD></TD><TD><font face=arial, arial,
443
- helvetica>\n8th Conference on the Theory of Quantum Computation, Communication
444
- and Cryptography (TQC 2013) \n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
445
- arial, helvetica>\n<B>Related Scholarly Article:</B></TD> \n<TD></TD><TD><font
446
- face=arial, arial, helvetica>\n<a href=\"\"></a> </TD>\n</TR> \n<TR> \n<TD
447
- VALIGN=TOP><font face=arial, arial, helvetica>\n<B>Issue date:</B></TD> \n<TD></TD><TD><font
448
- face=arial, arial, helvetica>\n2013 </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font
449
- face=arial, arial, helvetica>\n<B>Date of publication:</B></TD> \n<TD></TD><TD><font
450
- face=arial, arial, helvetica>\n<span itemprop=\"copyrightYear\">2013</span>
451
- </TD>\n<span style=\"display:none\" itemprop=\"datePublished\">2013</span>
452
- </TD>\n</TR> \n</TABLE> \n</div> \n<P>\n<HR>\n<CENTER>\n<A HREF=\"/opus\">DROPS-Home</A>
453
- |\n<A HREF=\"/opus/suche/index.php\">Fulltext Search</A> |\n<A HREF=\"/opus/doku/imprint.php\">Imprint</A>\n<IMG
454
- alt=\"Published by LZI\" SRC=\"/opus/Icons/logo_t.png\" ALIGN=\"right\" BORDER=0
455
- VSPACE=0 HSPACE=10>\n</CENTER>\n<BR><BR>\n<BR><BR>\n</tr>\n</table>\n</BODY>\n</HTML>"
456
- http_version:
457
- recorded_at: Sat, 18 Feb 2017 08:06:01 GMT
133
+ recorded_at: Thu, 23 Feb 2017 23:42:09 GMT
458
134
  recorded_with: VCR 3.0.3
data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Funding_schema_version_3.yml CHANGED
@@ -23,20 +23,20 @@ http_interactions:
23
23
  Location:
24
24
  - http://data.datacite.org/10.5281%2Fzenodo.1239
25
25
  Expires:
26
- - Tue, 21 Feb 2017 09:30:08 GMT
26
+ - Fri, 24 Feb 2017 00:31:22 GMT
27
27
  Content-Type:
28
28
  - text/html;charset=utf-8
29
29
  Content-Length:
30
30
  - '177'
31
31
  Date:
32
- - Tue, 21 Feb 2017 08:47:00 GMT
32
+ - Thu, 23 Feb 2017 23:43:01 GMT
33
33
  body:
34
34
  encoding: UTF-8
35
35
  string: |-
36
36
  <html><head><title>Handle Redirect</title></head>
37
37
  <body><a href="http://data.datacite.org/10.5281%2Fzenodo.1239">http://data.datacite.org/10.5281%2Fzenodo.1239</a></body></html>
38
38
  http_version:
39
- recorded_at: Tue, 21 Feb 2017 08:47:00 GMT
39
+ recorded_at: Thu, 23 Feb 2017 23:43:02 GMT
40
40
  - request:
41
41
  method: get
42
42
  uri: http://data.datacite.org/10.5281%2Fzenodo.1239
@@ -56,7 +56,7 @@ http_interactions:
56
56
  Server:
57
57
  - openresty/1.11.2.2
58
58
  Date:
59
- - Tue, 21 Feb 2017 08:47:00 GMT
59
+ - Thu, 23 Feb 2017 23:43:02 GMT
60
60
  Content-Type:
61
61
  - text/html
62
62
  Content-Length:
@@ -70,7 +70,7 @@ http_interactions:
70
70
  string: "<html>\r\n<head><title>301 Moved Permanently</title></head>\r\n<body
71
71
  bgcolor=\"white\">\r\n<center><h1>301 Moved Permanently</h1></center>\r\n<hr><center>openresty/1.11.2.2</center>\r\n</body>\r\n</html>\r\n"
72
72
  http_version:
73
- recorded_at: Tue, 21 Feb 2017 08:47:00 GMT
73
+ recorded_at: Thu, 23 Feb 2017 23:43:02 GMT
74
74
  - request:
75
75
  method: get
76
76
  uri: https://data.datacite.org/10.5281%2Fzenodo.1239
@@ -90,7 +90,7 @@ http_interactions:
90
90
  Server:
91
91
  - openresty/1.11.2.2
92
92
  Date:
93
- - Tue, 21 Feb 2017 08:47:01 GMT
93
+ - Thu, 23 Feb 2017 23:43:02 GMT
94
94
  Content-Type:
95
95
  - application/vnd.datacite.datacite+xml
96
96
  Content-Length:
@@ -136,5 +136,5 @@ http_interactions:
136
136
  projects. A second file shows the frequency of FP7 grants. The sample was
137
137
  created in July 2012.</description>\n </descriptions>\n</resource>\n\r\n\r\n"
138
138
  http_version:
139
- recorded_at: Tue, 21 Feb 2017 08:47:01 GMT
139
+ recorded_at: Thu, 23 Feb 2017 23:43:02 GMT
140
140
  recorded_with: VCR 3.0.3
data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Funding_schema_version_4.yml CHANGED
@@ -23,20 +23,20 @@ http_interactions:
23
23
  Location:
24
24
  - http://data.datacite.org/10.5438%2F6423
25
25
  Expires:
26
- - Tue, 21 Feb 2017 09:30:08 GMT
26
+ - Fri, 24 Feb 2017 00:31:22 GMT
27
27
  Content-Type:
28
28
  - text/html;charset=utf-8
29
29
  Content-Length:
30
30
  - '163'
31
31
  Date:
32
- - Tue, 21 Feb 2017 09:07:19 GMT
32
+ - Thu, 23 Feb 2017 23:42:27 GMT
33
33
  body:
34
34
  encoding: UTF-8
35
35
  string: |-
36
36
  <html><head><title>Handle Redirect</title></head>
37
37
  <body><a href="http://data.datacite.org/10.5438%2F6423">http://data.datacite.org/10.5438%2F6423</a></body></html>
38
38
  http_version:
39
- recorded_at: Tue, 21 Feb 2017 09:07:19 GMT
39
+ recorded_at: Thu, 23 Feb 2017 23:42:27 GMT
40
40
  - request:
41
41
  method: get
42
42
  uri: http://data.datacite.org/10.5438%2F6423
@@ -56,7 +56,7 @@ http_interactions:
56
56
  Server:
57
57
  - openresty/1.11.2.2
58
58
  Date:
59
- - Tue, 21 Feb 2017 09:07:20 GMT
59
+ - Thu, 23 Feb 2017 23:42:27 GMT
60
60
  Content-Type:
61
61
  - text/html
62
62
  Content-Length:
@@ -70,7 +70,7 @@ http_interactions:
70
70
  string: "<html>\r\n<head><title>301 Moved Permanently</title></head>\r\n<body
71
71
  bgcolor=\"white\">\r\n<center><h1>301 Moved Permanently</h1></center>\r\n<hr><center>openresty/1.11.2.2</center>\r\n</body>\r\n</html>\r\n"
72
72
  http_version:
73
- recorded_at: Tue, 21 Feb 2017 09:07:20 GMT
73
+ recorded_at: Thu, 23 Feb 2017 23:42:27 GMT
74
74
  - request:
75
75
  method: get
76
76
  uri: https://data.datacite.org/10.5438%2F6423
@@ -90,7 +90,7 @@ http_interactions:
90
90
  Server:
91
91
  - openresty/1.11.2.2
92
92
  Date:
93
- - Tue, 21 Feb 2017 09:07:20 GMT
93
+ - Thu, 23 Feb 2017 23:42:28 GMT
94
94
  Content-Type:
95
95
  - application/vnd.datacite.datacite+xml
96
96
  Content-Length:
@@ -470,5 +470,5 @@ http_interactions:
470
470
  YXJjaDwvYXdhcmRUaXRsZT4KICAgIDwvZnVuZGluZ1JlZmVyZW5jZT4KICA8
471
471
  L2Z1bmRpbmdSZWZlcmVuY2VzPgo8L3Jlc291cmNlPgo=
472
472
  http_version:
473
- recorded_at: Tue, 21 Feb 2017 09:07:20 GMT
473
+ recorded_at: Thu, 23 Feb 2017 23:42:28 GMT
474
474
  recorded_with: VCR 3.0.3