RubyGems - bolognese - Versions diffs - 0.3 → 0.4.1 - Mend

bolognese 0.3 → 0.4.1

Files changed (76) hide show

data/spec/fixtures/vcr_cassettes/Bolognese_Datacite/get_metadata/Date.yml ADDED

@@ -0,0 +1,458 @@
+---
+http_interactions:
+- request:
+    method: get
+    uri: https://doi.org/10.4230/lipics.tqc.2013.93
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - application/vnd.datacite.datacite+xml
+  response:
+    status:
+      code: 303
+      message: ''
+    headers:
+      Server:
+      - Apache-Coyote/1.1
+      Vary:
+      - Accept
+      Location:
+      - http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
+      Expires:
+      - Sat, 18 Feb 2017 08:28:49 GMT
+      Content-Type:
+      - text/html;charset=utf-8
+      Content-Length:
+      - '191'
+      Date:
+      - Sat, 18 Feb 2017 08:05:59 GMT
+    body:
+      encoding: UTF-8
+      string: |-
+        <html><head><title>Handle Redirect</title></head>
+        <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>
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
+- request:
+    method: get
+    uri: http://data.datacite.org/10.4230%2Flipics.tqc.2013.93
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - application/vnd.datacite.datacite+xml
+  response:
+    status:
+      code: 301
+      message: ''
+    headers:
+      Server:
+      - openresty/1.11.2.2
+      Date:
+      - Sat, 18 Feb 2017 08:06:00 GMT
+      Content-Type:
+      - text/html
+      Content-Length:
+      - '191'
+      Connection:
+      - keep-alive
+      Location:
+      - https://data.datacite.org/10.4230%2Flipics.tqc.2013.93
+    body:
+      encoding: UTF-8
+      string: "<html>\r\n<head><title>301 Moved Permanently</title></head>\r\n<body
+        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"
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
+- request:
+    method: get
+    uri: https://data.datacite.org/10.4230%2Flipics.tqc.2013.93
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - application/vnd.datacite.datacite+xml
+  response:
+    status:
+      code: 200
+      message: ''
+    headers:
+      Server:
+      - openresty/1.11.2.2
+      Date:
+      - Sat, 18 Feb 2017 08:06:00 GMT
+      Content-Type:
+      - application/vnd.datacite.datacite+xml
+      Content-Length:
+      - '1919'
+      Connection:
+      - keep-alive
+      Cache-Control:
+      - no-transform, max-age=3600
+      Last-Modified:
+      - Wed, 13 Nov 2013 13:42:17 GMT
+      Vary:
+      - Accept
+      Access-Control-Allow-Origin:
+      - "*"
+      Access-Control-Allow-Methods:
+      - GET, POST, OPTIONS
+    body:
+      encoding: UTF-8
+      string: "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<resource xmlns=\"http://datacite.org/schema/kernel-2.1\"
+        xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://datacite.org/schema/kernel-2.1
+        http://schema.datacite.org/meta/kernel-2.1/metadata.xsd\">\n<identifier identifierType=\"DOI\">10.4230/LIPIcs.TQC.2013.93</identifier>\n<creators>\n<creator>\n<creatorName>Johnston,
+        Nathaniel</creatorName>\n</creator>\n</creators>\n<titles>\n\t<title>The Minimum
+        Size of Qubit Unextendible Product Bases</title>\n</titles>\n<publisher>Schloss
+        Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany</publisher>\n<publicationYear>2013</publicationYear>\n<subjects>\n\t<subject>Computer
+        Science</subject>\n\t<subject subjectScheme=\"DDC\">000 Computer science,
+        knowledge, general works</subject>\n</subjects>\n<contributors>\n\t<contributor
+        contributorType=\"Editor\">\n\t\t<contributorName>Herbstritt, Marc</contributorName>\n\t</contributor>\n</contributors>\n<dates>\n\t<date
+        dateType=\"Available\">2013-11-05</date>\n</dates>\n<language>eng</language>\n<resourceType
+        resourceTypeGeneral=\"Text\">ConferencePaper</resourceType>\n<sizes>\n\t<size>13
+        pages</size>\n</sizes>\n<formats>\n\t<format>application/pdf</format>\n</formats>\n<version>1.0</version>\n<rights>Creative
+        Commons Attribution 3.0 Unported license (CC-BY 3.0)</rights>\n<descriptions>\n\t<description
+        descriptionType=\"Other\">\n\tWe investigate the problem of constructing unextendible
+        product bases in the qubit case - that is, when each local dimension equals
+        2. The cardinality of the smallest unextendible product basis is known in
+        all qubit cases except when the number of parties is a multiple of 4 greater
+        than 4 itself. We construct small unextendible product bases in all of the
+        remaining open cases, and we use graph theory techniques to produce a computer-assisted
+        proof that our constructions are indeed the smallest possible.\n\t</description>\n</descriptions>\n</resource>\n"
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
+- request:
+    method: get
+    uri: https://doi.org/10.4230/lipics.tqc.2013.93
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
+  response:
+    status:
+      code: 303
+      message: ''
+    headers:
+      Server:
+      - Apache-Coyote/1.1
+      Vary:
+      - Accept
+      Location:
+      - http://drops.dagstuhl.de/opus/volltexte/2013/4317/
+      Expires:
+      - Sat, 18 Feb 2017 08:28:49 GMT
+      Content-Type:
+      - text/html;charset=utf-8
+      Content-Length:
+      - '185'
+      Date:
+      - Sat, 18 Feb 2017 08:05:59 GMT
+    body:
+      encoding: UTF-8
+      string: |-
+        <html><head><title>Handle Redirect</title></head>
+        <body><a href="http://drops.dagstuhl.de/opus/volltexte/2013/4317/">http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></body></html>
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
+- request:
+    method: get
+    uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
+  response:
+    status:
+      code: 200
+      message: ''
+    headers:
+      Date:
+      - Sat, 18 Feb 2017 08:06:00 GMT
+      Server:
+      - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4
+        mod_perl/2.0.2 Perl/v5.8.8
+      Last-Modified:
+      - Fri, 06 Nov 2015 12:44:15 GMT
+      Etag:
+      - '"15601a-1ddd-99e225c0"'
+      Accept-Ranges:
+      - bytes
+      Content-Length:
+      - '7645'
+      Content-Type:
+      - text/html
+    body:
+      encoding: UTF-8
+      string: "<HTML>\n<HEAD>\n<meta http-equiv=\"Content-Type\" content=\"text/html;
+        charset=iso-8859-1\">\n<META NAME=\"DC.Publisher\" CONTENT=\"Schloss Dagstuhl
+        - Leibniz-Zentrum fuer Informatik\">\n<META NAME=\"citation_conference_title\"
+        CONTENT=\"8th Conference on the Theory of Quantum Computation, Communication
+        and Cryptography (TQC 2013)\">\n<META NAME=\"citation_journal_title\" CONTENT=\"LIPIcs
+        - Leibniz International Proceedings in Informatics\">\n<META NAME=\"citation_issn\"
+        CONTENT=\"1868-8969\">\n<META NAME=\"citation_isbn\" CONTENT=\"978-3-939897-55-2\">\n<META
+        NAME=\"citation_volume\" CONTENT=\"22\">\n<META NAME=\"citation_doi\" CONTENT=\"10.4230/LIPIcs.TQC.2013.93\">\n<META
+        NAME=\"citation_startpage\" CONTENT=\"93\">\n<META NAME=\"citation_lastpage\"
+        CONTENT=\"105\">\n<META NAME=\"DC.Title\" LANG=\"eng\" CONTENT=\"The Minimum
+        Size of Qubit Unextendible Product Bases\">\n<META NAME=\"citation_title\"
+        CONTENT=\"The Minimum Size of Qubit Unextendible Product Bases\">\n<META NAME=\"DC.Creator.PersonalName\"
+        CONTENT=\"Johnston, Nathaniel\">\n<META NAME=\"citation_author\" CONTENT=\"Johnston,
+        Nathaniel\">\n<META NAME=\"DC.Subject\" SCHEME=\"SWD\" CONTENT=\"unextendible
+        product basis; quantum entanglement; graph factorization\">\n<META NAME=\"DC.Subject\"
+        SCHEME=\"DDC-Sachgruppe\" CONTENT=\"004\">\n<META NAME=\"DC.Date.Creation_of_intellectual_content\"
+        CONTENT=\"2013\">\n<META NAME=\"citation_date\" CONTENT=\"2013\">\n<META NAME=\"DC.Date.Creation_of_present_form\"
+        SCHEME=\"ISO8601\" CONTENT=\"2013-11-05\">\n<META NAME=\"DC.Type\" CONTENT=\"InProceedings\">\n<META
+        NAME=\"DC.Format\" SCHEME=\"IMT\" CONTENT=\"application/pdf\">\n<META NAME=\"DC.Identifier\"
+        SCHEME=\"urn:nbn:de\" CONTENT=\"urn:nbn:de:0030-drops-43173\">\n<META NAME=\"DC.Identifier\"
+        SCHEME=\"URL\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/index.html\">\n<META
+        NAME=\"citation_pdf_url\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<META
+        NAME=\"DC.Source\" CONTENT=\"DROPS-IDN/4317\">\n<META NAME=\"DC.Language\"
+        SCHEME=\"ISO639-2\" CONTENT=\"eng\">\n<META NAME=\"DC.Description\" LANG=\"eng\"
+        CONTENT=\"We investigate the problem of constructing unextendible product
+        bases in the qubit case - that is, when each local dimension equals 2. The
+        cardinality of the smallest unextendible product basis is known in all qubit
+        cases except when the number of parties is a multiple of 4 greater than 4
+        itself. We construct small unextendible product bases in all of the remaining
+        open cases, and we use graph theory techniques to produce a computer-assisted
+        proof that our constructions are indeed the smallest possible.\">\n<TITLE>DROPS
+        - The Minimum Size of Qubit Unextendible Product Bases</TITLE></HEAD>\n<BODY
+        BGCOLOR=\"#FFFFFF\" TEXT=\"#000000\" LINK=\"#606060\" VLINK=\"#303030\" itemscope
+        itemtype=\"http://schema.org/WebPage\">\n<IMG SRC=\"/opus/Icons/drops-logo.png\"
+        ALIGN=TOP BORDER=0 VSPACE=0 HSPACE=0>\n      </H2>\n    </TD>\n  </TR>\n</TABLE>\n<FONT
+        FACE=arial, arial, helvetica>\n<HR>\n<div itemscope itemtype=\"http://schema.org/ScholarlyArticle\"
+        itemid=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<span style=\"display:none\"
+        itemprop=\"provider\">Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH</span>\n<span
+        style=\"display:none\" itemprop=\"publisher\">Schloss Dagstuhl - Leibniz-Zentrum
+        fuer Informatik GmbH</span>\n<span style=\"display:none\" itemprop=\"learningResourceType\">scholarly
+        article </span>\n<span style=\"display:none\" itemprop=\"inLanguage\">en</span>\n<span
+        style=\"display:none\" itemprop=\"copyrightHolder\">Johnston, Nathaniel</span>\n<span
+        style=\"display:none\" itemprop=\"publishingPrinciples\">http://www.dagstuhl.de/lipics</span>\n<FONT
+        SIZE=-1><A HREF=/doku/urheberrecht1.html>License</A><BR>\nwhen quoting this
+        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:
+        <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:
+        <a itemprop=\"url\" href=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\"><B>http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></B>
+        \n</FONT>\n<HR>\n<font face=arial, arial, helvetica>\n<B><A itemprop=\"author\"
+        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,
+        Nathaniel</A></B>\n\n</B><P>\n<H3 itemprop=\"name\">The Minimum Size of Qubit
+        Unextendible Product Bases</H3>\n<TABLE> \n<TR><TD><font face=arial, arial,
+        helvetica>\npdf-format: </TD>\n\n<TD><TABLE BORDER=3 CELLPADDING=4 CELLSPACING=4>\n<TR>\n\n<TD><font
+        face=arial, arial, helvetica>\n<A itemprop=\"url\" HREF=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/pdf/20.pdf\">20.pdf
+        (0.5 MB)   </A>\n</TD>\n</TR>\n</TABLE>\n</TD>\n</TR>\n</TABLE>\n<P>\n<HR>\n\n<div
+        itemprop=\"about\">\n<H3>Abstract</H3>\nWe investigate the problem of constructing
+        unextendible product bases in the qubit case - that is, when each local dimension
+        equals 2. The cardinality of the smallest unextendible product basis is known
+        in all qubit cases except when the number of parties is a multiple of 4 greater
+        than 4 itself. We construct small unextendible product bases in all of the
+        remaining open cases, and we use graph theory techniques to produce a computer-assisted
+        proof that our constructions are indeed the smallest possible. \n</div>\n<HR><P>
+        \n<H3>BibTeX - Entry</H3>\n<PRE><tt>@InProceedings{johnston:LIPIcs:2013:4317,\n
+        \ author =\t{Nathaniel Johnston},\n  title =\t{{The Minimum Size of Qubit
+        Unextendible Product Bases}},\n  booktitle =\t{8th Conference on the Theory
+        of Quantum Computation, Communication and Cryptography (TQC 2013)},\n  pages
+        =\t{93--105},\n  series =\t{Leibniz International Proceedings in Informatics
+        (LIPIcs)},\n  ISBN =\t{978-3-939897-55-2},\n  ISSN =\t{1868-8969},\n  year
+        =\t{2013},\n  volume =\t{22},\n  editor =\t{Simone Severini and Fernando Brandao},\n
+        \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n  address
+        =\t{Dagstuhl, Germany},\n  URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
+        \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n  doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
+        \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
+        factorization}\n}\n</tt></PRE> \n<HR><P> \n<TABLE BORDER=0> \n<TR> \n<TD VALIGN=TOP><font
+        face=arial, arial, helvetica>\n<B>Keywords:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\nunextendible product basis; quantum entanglement;
+        graph factorization </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
+        arial, helvetica>\n<B>Seminar:</B></TD>\n<TD></TD><TD><font face=arial, arial,
+        helvetica>\n8th Conference on the Theory of Quantum Computation, Communication
+        and Cryptography (TQC 2013) \n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
+        arial, helvetica>\n<B>Related Scholarly Article:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n<a href=\"\"></a> </TD>\n</TR> \n<TR> \n<TD
+        VALIGN=TOP><font face=arial, arial, helvetica>\n<B>Issue date:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n2013 </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font
+        face=arial, arial, helvetica>\n<B>Date of publication:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n<span itemprop=\"copyrightYear\">2013</span>
+        </TD>\n<span style=\"display:none\" itemprop=\"datePublished\">2013</span>
+        </TD>\n</TR> \n</TABLE> \n</div> \n<P>\n<HR>\n<CENTER>\n<A HREF=\"/opus\">DROPS-Home</A>
+        |\n<A HREF=\"/opus/suche/index.php\">Fulltext Search</A> |\n<A HREF=\"/opus/doku/imprint.php\">Imprint</A>\n<IMG
+        alt=\"Published by LZI\" SRC=\"/opus/Icons/logo_t.png\" ALIGN=\"right\" BORDER=0
+        VSPACE=0 HSPACE=10>\n</CENTER>\n<BR><BR>\n<BR><BR>\n</tr>\n</table>\n</BODY>\n</HTML>"
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:00 GMT
+- request:
+    method: get
+    uri: https://doi.org/10.4230/lipics.tqc.2013.93
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
+  response:
+    status:
+      code: 303
+      message: ''
+    headers:
+      Server:
+      - Apache-Coyote/1.1
+      Vary:
+      - Accept
+      Location:
+      - http://drops.dagstuhl.de/opus/volltexte/2013/4317/
+      Expires:
+      - Sat, 18 Feb 2017 08:28:49 GMT
+      Content-Type:
+      - text/html;charset=utf-8
+      Content-Length:
+      - '185'
+      Date:
+      - Sat, 18 Feb 2017 08:06:00 GMT
+    body:
+      encoding: UTF-8
+      string: |-
+        <html><head><title>Handle Redirect</title></head>
+        <body><a href="http://drops.dagstuhl.de/opus/volltexte/2013/4317/">http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></body></html>
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:01 GMT
+- request:
+    method: get
+    uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/
+    body:
+      encoding: US-ASCII
+      string: ''
+    headers:
+      User-Agent:
+      - Maremma - https://github.com/datacite/maremma
+      Accept:
+      - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5
+  response:
+    status:
+      code: 200
+      message: ''
+    headers:
+      Date:
+      - Sat, 18 Feb 2017 08:06:01 GMT
+      Server:
+      - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4
+        mod_perl/2.0.2 Perl/v5.8.8
+      Last-Modified:
+      - Fri, 06 Nov 2015 12:44:15 GMT
+      Etag:
+      - '"15601a-1ddd-99e225c0"'
+      Accept-Ranges:
+      - bytes
+      Content-Length:
+      - '7645'
+      Content-Type:
+      - text/html
+    body:
+      encoding: UTF-8
+      string: "<HTML>\n<HEAD>\n<meta http-equiv=\"Content-Type\" content=\"text/html;
+        charset=iso-8859-1\">\n<META NAME=\"DC.Publisher\" CONTENT=\"Schloss Dagstuhl
+        - Leibniz-Zentrum fuer Informatik\">\n<META NAME=\"citation_conference_title\"
+        CONTENT=\"8th Conference on the Theory of Quantum Computation, Communication
+        and Cryptography (TQC 2013)\">\n<META NAME=\"citation_journal_title\" CONTENT=\"LIPIcs
+        - Leibniz International Proceedings in Informatics\">\n<META NAME=\"citation_issn\"
+        CONTENT=\"1868-8969\">\n<META NAME=\"citation_isbn\" CONTENT=\"978-3-939897-55-2\">\n<META
+        NAME=\"citation_volume\" CONTENT=\"22\">\n<META NAME=\"citation_doi\" CONTENT=\"10.4230/LIPIcs.TQC.2013.93\">\n<META
+        NAME=\"citation_startpage\" CONTENT=\"93\">\n<META NAME=\"citation_lastpage\"
+        CONTENT=\"105\">\n<META NAME=\"DC.Title\" LANG=\"eng\" CONTENT=\"The Minimum
+        Size of Qubit Unextendible Product Bases\">\n<META NAME=\"citation_title\"
+        CONTENT=\"The Minimum Size of Qubit Unextendible Product Bases\">\n<META NAME=\"DC.Creator.PersonalName\"
+        CONTENT=\"Johnston, Nathaniel\">\n<META NAME=\"citation_author\" CONTENT=\"Johnston,
+        Nathaniel\">\n<META NAME=\"DC.Subject\" SCHEME=\"SWD\" CONTENT=\"unextendible
+        product basis; quantum entanglement; graph factorization\">\n<META NAME=\"DC.Subject\"
+        SCHEME=\"DDC-Sachgruppe\" CONTENT=\"004\">\n<META NAME=\"DC.Date.Creation_of_intellectual_content\"
+        CONTENT=\"2013\">\n<META NAME=\"citation_date\" CONTENT=\"2013\">\n<META NAME=\"DC.Date.Creation_of_present_form\"
+        SCHEME=\"ISO8601\" CONTENT=\"2013-11-05\">\n<META NAME=\"DC.Type\" CONTENT=\"InProceedings\">\n<META
+        NAME=\"DC.Format\" SCHEME=\"IMT\" CONTENT=\"application/pdf\">\n<META NAME=\"DC.Identifier\"
+        SCHEME=\"urn:nbn:de\" CONTENT=\"urn:nbn:de:0030-drops-43173\">\n<META NAME=\"DC.Identifier\"
+        SCHEME=\"URL\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/index.html\">\n<META
+        NAME=\"citation_pdf_url\" CONTENT=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<META
+        NAME=\"DC.Source\" CONTENT=\"DROPS-IDN/4317\">\n<META NAME=\"DC.Language\"
+        SCHEME=\"ISO639-2\" CONTENT=\"eng\">\n<META NAME=\"DC.Description\" LANG=\"eng\"
+        CONTENT=\"We investigate the problem of constructing unextendible product
+        bases in the qubit case - that is, when each local dimension equals 2. The
+        cardinality of the smallest unextendible product basis is known in all qubit
+        cases except when the number of parties is a multiple of 4 greater than 4
+        itself. We construct small unextendible product bases in all of the remaining
+        open cases, and we use graph theory techniques to produce a computer-assisted
+        proof that our constructions are indeed the smallest possible.\">\n<TITLE>DROPS
+        - The Minimum Size of Qubit Unextendible Product Bases</TITLE></HEAD>\n<BODY
+        BGCOLOR=\"#FFFFFF\" TEXT=\"#000000\" LINK=\"#606060\" VLINK=\"#303030\" itemscope
+        itemtype=\"http://schema.org/WebPage\">\n<IMG SRC=\"/opus/Icons/drops-logo.png\"
+        ALIGN=TOP BORDER=0 VSPACE=0 HSPACE=0>\n      </H2>\n    </TD>\n  </TR>\n</TABLE>\n<FONT
+        FACE=arial, arial, helvetica>\n<HR>\n<div itemscope itemtype=\"http://schema.org/ScholarlyArticle\"
+        itemid=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\">\n<span style=\"display:none\"
+        itemprop=\"provider\">Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH</span>\n<span
+        style=\"display:none\" itemprop=\"publisher\">Schloss Dagstuhl - Leibniz-Zentrum
+        fuer Informatik GmbH</span>\n<span style=\"display:none\" itemprop=\"learningResourceType\">scholarly
+        article </span>\n<span style=\"display:none\" itemprop=\"inLanguage\">en</span>\n<span
+        style=\"display:none\" itemprop=\"copyrightHolder\">Johnston, Nathaniel</span>\n<span
+        style=\"display:none\" itemprop=\"publishingPrinciples\">http://www.dagstuhl.de/lipics</span>\n<FONT
+        SIZE=-1><A HREF=/doku/urheberrecht1.html>License</A><BR>\nwhen quoting this
+        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:
+        <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:
+        <a itemprop=\"url\" href=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/\"><B>http://drops.dagstuhl.de/opus/volltexte/2013/4317/</a></B>
+        \n</FONT>\n<HR>\n<font face=arial, arial, helvetica>\n<B><A itemprop=\"author\"
+        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,
+        Nathaniel</A></B>\n\n</B><P>\n<H3 itemprop=\"name\">The Minimum Size of Qubit
+        Unextendible Product Bases</H3>\n<TABLE> \n<TR><TD><font face=arial, arial,
+        helvetica>\npdf-format: </TD>\n\n<TD><TABLE BORDER=3 CELLPADDING=4 CELLSPACING=4>\n<TR>\n\n<TD><font
+        face=arial, arial, helvetica>\n<A itemprop=\"url\" HREF=\"http://drops.dagstuhl.de/opus/volltexte/2013/4317/pdf/20.pdf\">20.pdf
+        (0.5 MB)   </A>\n</TD>\n</TR>\n</TABLE>\n</TD>\n</TR>\n</TABLE>\n<P>\n<HR>\n\n<div
+        itemprop=\"about\">\n<H3>Abstract</H3>\nWe investigate the problem of constructing
+        unextendible product bases in the qubit case - that is, when each local dimension
+        equals 2. The cardinality of the smallest unextendible product basis is known
+        in all qubit cases except when the number of parties is a multiple of 4 greater
+        than 4 itself. We construct small unextendible product bases in all of the
+        remaining open cases, and we use graph theory techniques to produce a computer-assisted
+        proof that our constructions are indeed the smallest possible. \n</div>\n<HR><P>
+        \n<H3>BibTeX - Entry</H3>\n<PRE><tt>@InProceedings{johnston:LIPIcs:2013:4317,\n
+        \ author =\t{Nathaniel Johnston},\n  title =\t{{The Minimum Size of Qubit
+        Unextendible Product Bases}},\n  booktitle =\t{8th Conference on the Theory
+        of Quantum Computation, Communication and Cryptography (TQC 2013)},\n  pages
+        =\t{93--105},\n  series =\t{Leibniz International Proceedings in Informatics
+        (LIPIcs)},\n  ISBN =\t{978-3-939897-55-2},\n  ISSN =\t{1868-8969},\n  year
+        =\t{2013},\n  volume =\t{22},\n  editor =\t{Simone Severini and Fernando Brandao},\n
+        \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n  address
+        =\t{Dagstuhl, Germany},\n  URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
+        \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n  doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
+        \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
+        factorization}\n}\n</tt></PRE> \n<HR><P> \n<TABLE BORDER=0> \n<TR> \n<TD VALIGN=TOP><font
+        face=arial, arial, helvetica>\n<B>Keywords:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\nunextendible product basis; quantum entanglement;
+        graph factorization </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
+        arial, helvetica>\n<B>Seminar:</B></TD>\n<TD></TD><TD><font face=arial, arial,
+        helvetica>\n8th Conference on the Theory of Quantum Computation, Communication
+        and Cryptography (TQC 2013) \n</TR> \n<TR> \n<TD VALIGN=TOP><font face=arial,
+        arial, helvetica>\n<B>Related Scholarly Article:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n<a href=\"\"></a> </TD>\n</TR> \n<TR> \n<TD
+        VALIGN=TOP><font face=arial, arial, helvetica>\n<B>Issue date:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n2013 </TD>\n</TR> \n<TR> \n<TD VALIGN=TOP><font
+        face=arial, arial, helvetica>\n<B>Date of publication:</B></TD> \n<TD></TD><TD><font
+        face=arial, arial, helvetica>\n<span itemprop=\"copyrightYear\">2013</span>
+        </TD>\n<span style=\"display:none\" itemprop=\"datePublished\">2013</span>
+        </TD>\n</TR> \n</TABLE> \n</div> \n<P>\n<HR>\n<CENTER>\n<A HREF=\"/opus\">DROPS-Home</A>
+        |\n<A HREF=\"/opus/suche/index.php\">Fulltext Search</A> |\n<A HREF=\"/opus/doku/imprint.php\">Imprint</A>\n<IMG
+        alt=\"Published by LZI\" SRC=\"/opus/Icons/logo_t.png\" ALIGN=\"right\" BORDER=0
+        VSPACE=0 HSPACE=10>\n</CENTER>\n<BR><BR>\n<BR><BR>\n</tr>\n</table>\n</BODY>\n</HTML>"
+    http_version:
+  recorded_at: Sat, 18 Feb 2017 08:06:01 GMT
+recorded_with: VCR 3.0.3