{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QIFM7E752LL65CDSAXI4TJ6QOI","short_pith_number":"pith:QIFM7E75","canonical_record":{"source":{"id":"1207.0479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T19:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"41862311250e58ed6af9fe512fc3ca46f9459e3adcecc3550779eb6b55b8e3c8","abstract_canon_sha256":"3dea531eadc118f0df4e58d3829b4d2a90e98990096f880f1a619e8d44433a5a"},"schema_version":"1.0"},"canonical_sha256":"820acf93fdd2d7ee887205d1c9a7d072052f19b2ae691c025d728a199d5c4fb8","source":{"kind":"arxiv","id":"1207.0479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0479","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0479v1","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0479","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"QIFM7E752LL6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIFM7E752LL65CDS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIFM7E75","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QIFM7E752LL65CDSAXI4TJ6QOI","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T19:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"41862311250e58ed6af9fe512fc3ca46f9459e3adcecc3550779eb6b55b8e3c8","abstract_canon_sha256":"3dea531eadc118f0df4e58d3829b4d2a90e98990096f880f1a619e8d44433a5a"},"schema_version":"1.0"},"canonical_sha256":"820acf93fdd2d7ee887205d1c9a7d072052f19b2ae691c025d728a199d5c4fb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.905907Z","signature_b64":"3xkmIg6RfMp1jX5SGKbI7urnzlapP7q86Siew6maSv9wKTxFYfhIfpMC7u95SKpy4kL/eoqDw6vhJhiJPQNoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820acf93fdd2d7ee887205d1c9a7d072052f19b2ae691c025d728a199d5c4fb8","last_reissued_at":"2026-05-18T03:05:18.905410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.905410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0479","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-18T03:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvOgBy+IHWclx0ajdXkZ2FP1bxQpY6wH1UvciZ1N6dBjK4GbGW9mO4ywqcfLqZb4VoGCFLhRs7XSxt6h9juSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:31:08.320006Z"},"content_sha256":"fbd84a4ec8c75213442847c2b43697bcb68258a12360709c868ee9c46e94ef43","schema_version":"1.0","event_id":"sha256:fbd84a4ec8c75213442847c2b43697bcb68258a12360709c868ee9c46e94ef43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QIFM7E752LL65CDSAXI4TJ6QOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological Subsystem Codes From Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kenneth R. Brown, Pradeep Sarvepalli","submitted_at":"2012-07-02T19:28:04Z","abstract_excerpt":"Topological subsystem codes were proposed by Bombin based on 3-face-colorable cubic graphs. Suchara, Bravyi and Terhal generalized this construction and proposed a method to construct topological subsystem codes using 3-valent hypergraphs that satisfy certain constraints. Finding such hypergraphs and computing their parameters however is a nontrivial task. We propose families of topological subsystem codes that were previously not known. In particular, our constructions give codes which cannot be derived from Bombin's construction. We also study the error recovery schemes for the proposed subs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0479","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-18T03:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/fcJLWy4E0uG7yc27sMjs6ClAVfsb4BLlTg59Bdv4XKNgJLlE8+IclxesfGBvywoUgRic3MaDWIqIOzShCvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:31:08.320384Z"},"content_sha256":"651e98bd82cd71daf9fa95b368fe4b316e65ea3ec902d3c3f1e2ec5427386f82","schema_version":"1.0","event_id":"sha256:651e98bd82cd71daf9fa95b368fe4b316e65ea3ec902d3c3f1e2ec5427386f82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIFM7E752LL65CDSAXI4TJ6QOI/bundle.json","state_url":"https://pith.science/pith/QIFM7E752LL65CDSAXI4TJ6QOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIFM7E752LL65CDSAXI4TJ6QOI/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-02T19:31:08Z","links":{"resolver":"https://pith.science/pith/QIFM7E752LL65CDSAXI4TJ6QOI","bundle":"https://pith.science/pith/QIFM7E752LL65CDSAXI4TJ6QOI/bundle.json","state":"https://pith.science/pith/QIFM7E752LL65CDSAXI4TJ6QOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIFM7E752LL65CDSAXI4TJ6QOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QIFM7E752LL65CDSAXI4TJ6QOI","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":"3dea531eadc118f0df4e58d3829b4d2a90e98990096f880f1a619e8d44433a5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T19:28:04Z","title_canon_sha256":"41862311250e58ed6af9fe512fc3ca46f9459e3adcecc3550779eb6b55b8e3c8"},"schema_version":"1.0","source":{"id":"1207.0479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0479","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0479v1","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0479","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"QIFM7E752LL6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIFM7E752LL65CDS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIFM7E75","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:651e98bd82cd71daf9fa95b368fe4b316e65ea3ec902d3c3f1e2ec5427386f82","target":"graph","created_at":"2026-05-18T03:05:18Z","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":"Topological subsystem codes were proposed by Bombin based on 3-face-colorable cubic graphs. Suchara, Bravyi and Terhal generalized this construction and proposed a method to construct topological subsystem codes using 3-valent hypergraphs that satisfy certain constraints. Finding such hypergraphs and computing their parameters however is a nontrivial task. We propose families of topological subsystem codes that were previously not known. In particular, our constructions give codes which cannot be derived from Bombin's construction. We also study the error recovery schemes for the proposed subs","authors_text":"Kenneth R. Brown, Pradeep Sarvepalli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T19:28:04Z","title":"Topological Subsystem Codes From Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0479","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:fbd84a4ec8c75213442847c2b43697bcb68258a12360709c868ee9c46e94ef43","target":"record","created_at":"2026-05-18T03:05:18Z","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":"3dea531eadc118f0df4e58d3829b4d2a90e98990096f880f1a619e8d44433a5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T19:28:04Z","title_canon_sha256":"41862311250e58ed6af9fe512fc3ca46f9459e3adcecc3550779eb6b55b8e3c8"},"schema_version":"1.0","source":{"id":"1207.0479","kind":"arxiv","version":1}},"canonical_sha256":"820acf93fdd2d7ee887205d1c9a7d072052f19b2ae691c025d728a199d5c4fb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820acf93fdd2d7ee887205d1c9a7d072052f19b2ae691c025d728a199d5c4fb8","first_computed_at":"2026-05-18T03:05:18.905410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:18.905410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3xkmIg6RfMp1jX5SGKbI7urnzlapP7q86Siew6maSv9wKTxFYfhIfpMC7u95SKpy4kL/eoqDw6vhJhiJPQNoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:18.905907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbd84a4ec8c75213442847c2b43697bcb68258a12360709c868ee9c46e94ef43","sha256:651e98bd82cd71daf9fa95b368fe4b316e65ea3ec902d3c3f1e2ec5427386f82"],"state_sha256":"c1d9ef4e84cbd87d961eb938ff806d96855035ff04e6f748a3570d85a5d779c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOe0llI8LNuFm8nWxSVbqXdcptLfZZjyFG1EmCavtTf1r8pnNlqZTqwkrNdLJTGj+6nNyiaozkyDobITWcw/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:31:08.322332Z","bundle_sha256":"993c1dd7c1f51bf8ad0a14e4168552b9ed3f0ced9f3cad6cb6b1c3fe9a1a8f9b"}}