{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5L7S73FQ345BG2ZT5BXUC2XKEP","short_pith_number":"pith:5L7S73FQ","canonical_record":{"source":{"id":"1207.1779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-07T09:02:45Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"18546f2a4d1b9d26db81f0ecdabd18b905e47ed5e635ec247891053eaf935f0d","abstract_canon_sha256":"90e8dfbf3a106f873a17f2a4cfabfd171e1de490f927fba05589042b3107df8a"},"schema_version":"1.0"},"canonical_sha256":"eaff2fecb0df3a136b33e86f416aea23d63346d756e978e4a23296a42d057c7f","source":{"kind":"arxiv","id":"1207.1779","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1779","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1779v1","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1779","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"5L7S73FQ345B","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5L7S73FQ345BG2ZT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5L7S73FQ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5L7S73FQ345BG2ZT5BXUC2XKEP","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-07T09:02:45Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"18546f2a4d1b9d26db81f0ecdabd18b905e47ed5e635ec247891053eaf935f0d","abstract_canon_sha256":"90e8dfbf3a106f873a17f2a4cfabfd171e1de490f927fba05589042b3107df8a"},"schema_version":"1.0"},"canonical_sha256":"eaff2fecb0df3a136b33e86f416aea23d63346d756e978e4a23296a42d057c7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:15.135934Z","signature_b64":"DdtAqFyKsOF122JwYRiPYbCUjUGldk7Ulp9JcnyuwT3sxnn+tJxddVciRJYfPQ4KWkQRjC20WQ8a2R5k/x17Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaff2fecb0df3a136b33e86f416aea23d63346d756e978e4a23296a42d057c7f","last_reissued_at":"2026-05-18T02:57:15.135386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:15.135386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1779","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jjUG2eVWfDwj3sa6DbZn93mc9vHfU7gj615ZWXy0+sHkoCSLvOM8M+whM8XbPDNxOfsW+IOFA12cud6/wMOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:22:03.020020Z"},"content_sha256":"3d724ca2aee5bdaa1704d516954d6caca48161a3b2e17f70be86fc5a29b7dffc","schema_version":"1.0","event_id":"sha256:3d724ca2aee5bdaa1704d516954d6caca48161a3b2e17f70be86fc5a29b7dffc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5L7S73FQ345BG2ZT5BXUC2XKEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Violating the Shannon capacity of metric graphs with entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"quant-ph","authors_text":"Dion Gijswijt, Harry Buhrman, Jop Briet","submitted_at":"2012-07-07T09:02:45Z","abstract_excerpt":"The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with zero probability of error through a noisy channel with confusability graph G. This extensively studied graph parameter disregards the fact that on atomic scales, Nature behaves in line with quantum mechanics. Entanglement, arguably the most counterintuitive feature of the theory, turns out to be a useful resource for communication across noisy channels. Recently, Leung, Mancinska, Matthews, Ozols and Roy [Comm. Math. Phys. 311, 2012] presented two examples of graphs whose Shannon capacity is str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1779","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlZ989n2IpRTak4UBNHORhc5wt0kWvjVHcr3U6Q5AWEBGzXRd3cOdmdJELo8vQBAuhrdCAR3S7pAfT+3+x2RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:22:03.020389Z"},"content_sha256":"d28efdfb2a4665fa4ca7e5394e855d2f780d8be13b9c2276490bf6cc17117ad6","schema_version":"1.0","event_id":"sha256:d28efdfb2a4665fa4ca7e5394e855d2f780d8be13b9c2276490bf6cc17117ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/bundle.json","state_url":"https://pith.science/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T14:22:03Z","links":{"resolver":"https://pith.science/pith/5L7S73FQ345BG2ZT5BXUC2XKEP","bundle":"https://pith.science/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/bundle.json","state":"https://pith.science/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5L7S73FQ345BG2ZT5BXUC2XKEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5L7S73FQ345BG2ZT5BXUC2XKEP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"90e8dfbf3a106f873a17f2a4cfabfd171e1de490f927fba05589042b3107df8a","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-07T09:02:45Z","title_canon_sha256":"18546f2a4d1b9d26db81f0ecdabd18b905e47ed5e635ec247891053eaf935f0d"},"schema_version":"1.0","source":{"id":"1207.1779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1779","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1779v1","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1779","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"5L7S73FQ345B","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5L7S73FQ345BG2ZT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5L7S73FQ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:d28efdfb2a4665fa4ca7e5394e855d2f780d8be13b9c2276490bf6cc17117ad6","target":"graph","created_at":"2026-05-18T02:57:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with zero probability of error through a noisy channel with confusability graph G. This extensively studied graph parameter disregards the fact that on atomic scales, Nature behaves in line with quantum mechanics. Entanglement, arguably the most counterintuitive feature of the theory, turns out to be a useful resource for communication across noisy channels. Recently, Leung, Mancinska, Matthews, Ozols and Roy [Comm. Math. Phys. 311, 2012] presented two examples of graphs whose Shannon capacity is str","authors_text":"Dion Gijswijt, Harry Buhrman, Jop Briet","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-07T09:02:45Z","title":"Violating the Shannon capacity of metric graphs with entanglement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1779","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d724ca2aee5bdaa1704d516954d6caca48161a3b2e17f70be86fc5a29b7dffc","target":"record","created_at":"2026-05-18T02:57:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"90e8dfbf3a106f873a17f2a4cfabfd171e1de490f927fba05589042b3107df8a","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-07T09:02:45Z","title_canon_sha256":"18546f2a4d1b9d26db81f0ecdabd18b905e47ed5e635ec247891053eaf935f0d"},"schema_version":"1.0","source":{"id":"1207.1779","kind":"arxiv","version":1}},"canonical_sha256":"eaff2fecb0df3a136b33e86f416aea23d63346d756e978e4a23296a42d057c7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaff2fecb0df3a136b33e86f416aea23d63346d756e978e4a23296a42d057c7f","first_computed_at":"2026-05-18T02:57:15.135386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:15.135386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdtAqFyKsOF122JwYRiPYbCUjUGldk7Ulp9JcnyuwT3sxnn+tJxddVciRJYfPQ4KWkQRjC20WQ8a2R5k/x17Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:15.135934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1779","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d724ca2aee5bdaa1704d516954d6caca48161a3b2e17f70be86fc5a29b7dffc","sha256:d28efdfb2a4665fa4ca7e5394e855d2f780d8be13b9c2276490bf6cc17117ad6"],"state_sha256":"4d10647b2891ad9f121ae4626e899b92d45d958ab5ab43620f09d96c07a3367b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LZYeM/OZJlzrmuEjBauNXF6u5S/qTR6HVgNcMW8iTzFvClvqCZKLvhY4BaS2utkCtyHcdhcCsyiH6PGGZHEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:22:03.022375Z","bundle_sha256":"b6e20d32670ef53de3083f09c738d3e931ffc5bc563b0c502e2c0f95e8a419b3"}}