{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CD5ID6VHCCSFE36ESUJHX6LV2L","short_pith_number":"pith:CD5ID6VH","canonical_record":{"source":{"id":"1206.2656","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-12T20:11:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c03facd8dc6eb3065b782d652ca70137e1b1b7fc141791ef198f563210b4d43c","abstract_canon_sha256":"494c8437be1c2175ba0555e3a7e19412fbb84fc5d7c29f24e561eb824a134187"},"schema_version":"1.0"},"canonical_sha256":"10fa81faa710a4526fc495127bf975d2f25e1689675d050cac407bcf9c52c166","source":{"kind":"arxiv","id":"1206.2656","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2656","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2656v3","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2656","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CD5ID6VHCCSF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CD5ID6VHCCSFE36E","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CD5ID6VH","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CD5ID6VHCCSFE36ESUJHX6LV2L","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2656","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-12T20:11:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c03facd8dc6eb3065b782d652ca70137e1b1b7fc141791ef198f563210b4d43c","abstract_canon_sha256":"494c8437be1c2175ba0555e3a7e19412fbb84fc5d7c29f24e561eb824a134187"},"schema_version":"1.0"},"canonical_sha256":"10fa81faa710a4526fc495127bf975d2f25e1689675d050cac407bcf9c52c166","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:24.335122Z","signature_b64":"5s+4mYIt8Wt6hx3ysgoe9QWqYCZGurVkO+doKeQhor11DMS9IvfMsqmAXrZ3f+LMwTcl4Vjc6hYykwzPp60xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10fa81faa710a4526fc495127bf975d2f25e1689675d050cac407bcf9c52c166","last_reissued_at":"2026-05-18T03:04:24.334512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:24.334512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2656","source_version":3,"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:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6IBEvkF77h/I3nBUFXDABc+yC0TtjlSSqqDLqpf2bKAspvsIGPM/ZLC82iO12jGj+uejCAG6nuwB02/e/JHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:13.608222Z"},"content_sha256":"9874b761bc7b31306750ada98a9e7173711f215bfeed2dcb4e7ec9a31dd7da1d","schema_version":"1.0","event_id":"sha256:9874b761bc7b31306750ada98a9e7173711f215bfeed2dcb4e7ec9a31dd7da1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CD5ID6VHCCSFE36ESUJHX6LV2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Construction of Quantum LDPC Codes from Cayley Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alain Couvreur, Gilles Z\\'emor, Nicolas Delfosse","submitted_at":"2012-06-12T20:11:53Z","abstract_excerpt":"We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the Quantum code in $\\mathcal{O}(dn^2)$ where d is the minimum distance of the classical code. When the classical code is the $[n, 1, n]$ repetition code, we are able to compute the exact parameters of the associated Quantum code which are $[[2^n, 2^{\\frac{n+1}{2}}, 2^{\\frac{n-1}{2}}]]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2656","kind":"arxiv","version":3},"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:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/JbAc5G3jLLMWe7Rzg2UOjnCW2aiE52uAaY+n1R1M+dnZfGfbxgXFtuGJgjE/aiyBFni0qLBwd1mYy5xjzbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:13.608573Z"},"content_sha256":"7253bf47ef55b1d2ddb6b240850805a5ab508ce4cc91543d64b3645bff0ad83d","schema_version":"1.0","event_id":"sha256:7253bf47ef55b1d2ddb6b240850805a5ab508ce4cc91543d64b3645bff0ad83d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/bundle.json","state_url":"https://pith.science/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/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-02T17:26:13Z","links":{"resolver":"https://pith.science/pith/CD5ID6VHCCSFE36ESUJHX6LV2L","bundle":"https://pith.science/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/bundle.json","state":"https://pith.science/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CD5ID6VHCCSFE36ESUJHX6LV2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CD5ID6VHCCSFE36ESUJHX6LV2L","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":"494c8437be1c2175ba0555e3a7e19412fbb84fc5d7c29f24e561eb824a134187","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-12T20:11:53Z","title_canon_sha256":"c03facd8dc6eb3065b782d652ca70137e1b1b7fc141791ef198f563210b4d43c"},"schema_version":"1.0","source":{"id":"1206.2656","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2656","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2656v3","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2656","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CD5ID6VHCCSF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CD5ID6VHCCSFE36E","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CD5ID6VH","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:7253bf47ef55b1d2ddb6b240850805a5ab508ce4cc91543d64b3645bff0ad83d","target":"graph","created_at":"2026-05-18T03:04:24Z","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":"We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the Quantum code in $\\mathcal{O}(dn^2)$ where d is the minimum distance of the classical code. When the classical code is the $[n, 1, n]$ repetition code, we are able to compute the exact parameters of the associated Quantum code which are $[[2^n, 2^{\\frac{n+1}{2}}, 2^{\\frac{n-1}{2}}]]$.","authors_text":"Alain Couvreur, Gilles Z\\'emor, Nicolas Delfosse","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-12T20:11:53Z","title":"A Construction of Quantum LDPC Codes from Cayley Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2656","kind":"arxiv","version":3},"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:9874b761bc7b31306750ada98a9e7173711f215bfeed2dcb4e7ec9a31dd7da1d","target":"record","created_at":"2026-05-18T03:04:24Z","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":"494c8437be1c2175ba0555e3a7e19412fbb84fc5d7c29f24e561eb824a134187","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-12T20:11:53Z","title_canon_sha256":"c03facd8dc6eb3065b782d652ca70137e1b1b7fc141791ef198f563210b4d43c"},"schema_version":"1.0","source":{"id":"1206.2656","kind":"arxiv","version":3}},"canonical_sha256":"10fa81faa710a4526fc495127bf975d2f25e1689675d050cac407bcf9c52c166","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10fa81faa710a4526fc495127bf975d2f25e1689675d050cac407bcf9c52c166","first_computed_at":"2026-05-18T03:04:24.334512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:24.334512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5s+4mYIt8Wt6hx3ysgoe9QWqYCZGurVkO+doKeQhor11DMS9IvfMsqmAXrZ3f+LMwTcl4Vjc6hYykwzPp60xCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:24.335122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2656","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9874b761bc7b31306750ada98a9e7173711f215bfeed2dcb4e7ec9a31dd7da1d","sha256:7253bf47ef55b1d2ddb6b240850805a5ab508ce4cc91543d64b3645bff0ad83d"],"state_sha256":"f965365a6ea81b4862c2bba8733bec9df77382b2be57d8fe6633da0978fc0c63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIFiZKaaYq8FpuZj2cMwXhrwLbIkCUuvNY3hyJMNdkVtXO28T/31zK4ngkYKX3IF/1cXpo6+y9imFXsOCkZ9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:26:13.610469Z","bundle_sha256":"96884d4b6de563575f63869793deba0cf85338347f84d61f22896d148270eaf7"}}