{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NWL3WODY67MROBO2LO4M54EMVZ","short_pith_number":"pith:NWL3WODY","schema_version":"1.0","canonical_sha256":"6d97bb3878f7d91705da5bb8cef08cae59031ee03280c5ae2ef19abe482b7fb5","source":{"kind":"arxiv","id":"1207.0732","version":1},"attestation_state":"computed","paper":{"title":"Quantum LDPC Codes Constructed from Point-Line Subsets of the Finite Projective Plane","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Farinholt","submitted_at":"2012-07-03T16:06:02Z","abstract_excerpt":"Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner product requirements of quantum stabilizer codes force four-cycles and eliminate the possibility of randomly generated quantum LDPC codes. Moreover, the classes of quantum LDPC codes discovered thus far generally have unknown or small minimum distance, or a fixed rate. This paper presents several new classes of quantum LDPC codes constructed from finite proje"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.0732","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"quant-ph","submitted_at":"2012-07-03T16:06:02Z","cross_cats_sorted":[],"title_canon_sha256":"b3d968773df79036252c4de5a94a839ca564dbdd487eefcfc17104ee86cbb115","abstract_canon_sha256":"cb2bb62a1660f3e354b4c76a3f862af5fa7338d3bdedc3a91107df92804fb967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:49.197858Z","signature_b64":"gNVMurN5JqMx+OoP5oPkyAOvPkPzXSIYPvJ7eIUez3e5s8V+We0OHKEwRdyhA41BUgJJm9vh6vcerBeZc0nqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d97bb3878f7d91705da5bb8cef08cae59031ee03280c5ae2ef19abe482b7fb5","last_reissued_at":"2026-05-18T03:51:49.197386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:49.197386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum LDPC Codes Constructed from Point-Line Subsets of the Finite Projective Plane","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Farinholt","submitted_at":"2012-07-03T16:06:02Z","abstract_excerpt":"Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner product requirements of quantum stabilizer codes force four-cycles and eliminate the possibility of randomly generated quantum LDPC codes. Moreover, the classes of quantum LDPC codes discovered thus far generally have unknown or small minimum distance, or a fixed rate. This paper presents several new classes of quantum LDPC codes constructed from finite proje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0732","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0732","created_at":"2026-05-18T03:51:49.197457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0732v1","created_at":"2026-05-18T03:51:49.197457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0732","created_at":"2026-05-18T03:51:49.197457+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWL3WODY67MR","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWL3WODY67MROBO2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWL3WODY","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.15314","citing_title":"VideoEraser: Concept Erasure in Text-to-Video Diffusion Models","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ","json":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ.json","graph_json":"https://pith.science/api/pith-number/NWL3WODY67MROBO2LO4M54EMVZ/graph.json","events_json":"https://pith.science/api/pith-number/NWL3WODY67MROBO2LO4M54EMVZ/events.json","paper":"https://pith.science/paper/NWL3WODY"},"agent_actions":{"view_html":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ","download_json":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ.json","view_paper":"https://pith.science/paper/NWL3WODY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0732&json=true","fetch_graph":"https://pith.science/api/pith-number/NWL3WODY67MROBO2LO4M54EMVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NWL3WODY67MROBO2LO4M54EMVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ/action/storage_attestation","attest_author":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ/action/author_attestation","sign_citation":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ/action/citation_signature","submit_replication":"https://pith.science/pith/NWL3WODY67MROBO2LO4M54EMVZ/action/replication_record"}},"created_at":"2026-05-18T03:51:49.197457+00:00","updated_at":"2026-05-18T03:51:49.197457+00:00"}