{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B56QTQGQU56QBJKRNHQCDVFCJE","short_pith_number":"pith:B56QTQGQ","canonical_record":{"source":{"id":"1805.12542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T16:22:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5c4016f3ab18c98c65807b36563ca3e007faad5b212f43daa0571dfbdfe4553a","abstract_canon_sha256":"550a3ae8639cb4ba2d4c52540ff36f3122ac3504830b648f8a0bf0d17c8357ce"},"schema_version":"1.0"},"canonical_sha256":"0f7d09c0d0a77d00a55169e021d4a24921b604319d278cc8fa2e5671db06c5df","source":{"kind":"arxiv","id":"1805.12542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12542","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12542v1","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12542","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"B56QTQGQU56Q","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B56QTQGQU56QBJKR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B56QTQGQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B56QTQGQU56QBJKRNHQCDVFCJE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T16:22:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5c4016f3ab18c98c65807b36563ca3e007faad5b212f43daa0571dfbdfe4553a","abstract_canon_sha256":"550a3ae8639cb4ba2d4c52540ff36f3122ac3504830b648f8a0bf0d17c8357ce"},"schema_version":"1.0"},"canonical_sha256":"0f7d09c0d0a77d00a55169e021d4a24921b604319d278cc8fa2e5671db06c5df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:29.937742Z","signature_b64":"l3GjHKoRVVsjOnn2Pp0z2iGmMLHjEQ/WqTftU4Tv+LFzk2RhuXV/ir5yl2C37h6SlosN9eUV8tMWhUGKJNO4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7d09c0d0a77d00a55169e021d4a24921b604319d278cc8fa2e5671db06c5df","last_reissued_at":"2026-05-18T00:14:29.937226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:29.937226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12542","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-18T00:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4g2htub0A5e1yBHgZYMFHwsnYfD6d+UnPCL3l+zxpPaglSkHDIHoFE8DpdL+IKGRRpQSQVHlXsJ/Sw7sPhwUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:45:21.273176Z"},"content_sha256":"8d4c539c8c65fc1dbcf39711661c94c20bff8805ad21730d03233ff68f7d097b","schema_version":"1.0","event_id":"sha256:8d4c539c8c65fc1dbcf39711661c94c20bff8805ad21730d03233ff68f7d097b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B56QTQGQU56QBJKRNHQCDVFCJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Pradeep Kiran Sarvepalli, Vinuta V. Gayatri","submitted_at":"2018-05-31T16:22:44Z","abstract_excerpt":"Topological subsystem codes can combine the advantages of both topological codes and subsystem codes. Suchara et al. proposed a framework based on hypergraphs for construction of such codes. They also studied the performance of some subsystem codes. Later Bravyi et al. proposed a subsystem surface code. Building upon these works, we propose efficient decoding algorithms for large classes of subsystem codes on hypergraphs and surfaces. We also propose a construction of the subsystem surface codes that includes the code proposed by Bravyi et al. Our simulations for the subsystem code on the squa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12542","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-18T00:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFg+reLJSewyAJESCYgui0j0e78edHaNJ8FLrwEjSRMO/LOay2BMVyGCRurGPnG3AmO8aEfsad5qdmpe6vw8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:45:21.273868Z"},"content_sha256":"71ccc2e2c2e20ff035a36bc3c74c7ff551b70bccbee4c0b1c9f7348d01ea2495","schema_version":"1.0","event_id":"sha256:71ccc2e2c2e20ff035a36bc3c74c7ff551b70bccbee4c0b1c9f7348d01ea2495"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B56QTQGQU56QBJKRNHQCDVFCJE/bundle.json","state_url":"https://pith.science/pith/B56QTQGQU56QBJKRNHQCDVFCJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B56QTQGQU56QBJKRNHQCDVFCJE/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-05-30T14:45:21Z","links":{"resolver":"https://pith.science/pith/B56QTQGQU56QBJKRNHQCDVFCJE","bundle":"https://pith.science/pith/B56QTQGQU56QBJKRNHQCDVFCJE/bundle.json","state":"https://pith.science/pith/B56QTQGQU56QBJKRNHQCDVFCJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B56QTQGQU56QBJKRNHQCDVFCJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B56QTQGQU56QBJKRNHQCDVFCJE","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":"550a3ae8639cb4ba2d4c52540ff36f3122ac3504830b648f8a0bf0d17c8357ce","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T16:22:44Z","title_canon_sha256":"5c4016f3ab18c98c65807b36563ca3e007faad5b212f43daa0571dfbdfe4553a"},"schema_version":"1.0","source":{"id":"1805.12542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12542","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12542v1","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12542","created_at":"2026-05-18T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"B56QTQGQU56Q","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B56QTQGQU56QBJKR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B56QTQGQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:71ccc2e2c2e20ff035a36bc3c74c7ff551b70bccbee4c0b1c9f7348d01ea2495","target":"graph","created_at":"2026-05-18T00:14:29Z","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 can combine the advantages of both topological codes and subsystem codes. Suchara et al. proposed a framework based on hypergraphs for construction of such codes. They also studied the performance of some subsystem codes. Later Bravyi et al. proposed a subsystem surface code. Building upon these works, we propose efficient decoding algorithms for large classes of subsystem codes on hypergraphs and surfaces. We also propose a construction of the subsystem surface codes that includes the code proposed by Bravyi et al. Our simulations for the subsystem code on the squa","authors_text":"Pradeep Kiran Sarvepalli, Vinuta V. Gayatri","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T16:22:44Z","title":"Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12542","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:8d4c539c8c65fc1dbcf39711661c94c20bff8805ad21730d03233ff68f7d097b","target":"record","created_at":"2026-05-18T00:14:29Z","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":"550a3ae8639cb4ba2d4c52540ff36f3122ac3504830b648f8a0bf0d17c8357ce","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T16:22:44Z","title_canon_sha256":"5c4016f3ab18c98c65807b36563ca3e007faad5b212f43daa0571dfbdfe4553a"},"schema_version":"1.0","source":{"id":"1805.12542","kind":"arxiv","version":1}},"canonical_sha256":"0f7d09c0d0a77d00a55169e021d4a24921b604319d278cc8fa2e5671db06c5df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f7d09c0d0a77d00a55169e021d4a24921b604319d278cc8fa2e5671db06c5df","first_computed_at":"2026-05-18T00:14:29.937226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:29.937226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l3GjHKoRVVsjOnn2Pp0z2iGmMLHjEQ/WqTftU4Tv+LFzk2RhuXV/ir5yl2C37h6SlosN9eUV8tMWhUGKJNO4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:29.937742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d4c539c8c65fc1dbcf39711661c94c20bff8805ad21730d03233ff68f7d097b","sha256:71ccc2e2c2e20ff035a36bc3c74c7ff551b70bccbee4c0b1c9f7348d01ea2495"],"state_sha256":"7e42b078cdcbb396dec68bccf2c9a36bec597a357dc2167c21a642df6953efc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMEFH2jNZ+023cwC4CrrUr2tckdJYRElVXDkcGd3ByofhXcwVtiMxg6ZdVtl1JzFCj30AspddPX67yNqOr3WCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:45:21.279662Z","bundle_sha256":"9a00fbfb0202b041580cc95a8bc020d0a57dec0e037ca0834bf942c53cce1cbd"}}