{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K7F4CBTWLU4CV2BQZOWYJGTUEJ","short_pith_number":"pith:K7F4CBTW","schema_version":"1.0","canonical_sha256":"57cbc106765d382ae830cbad849a7422727721785a8486ff9d68daebbfb9069e","source":{"kind":"arxiv","id":"2505.13679","version":2},"attestation_state":"computed","paper":{"title":"Demystifying the Balanced Product Code: A Review","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Heather Leitch","submitted_at":"2025-05-19T19:26:53Z","abstract_excerpt":"The discovery of the family of balanced product codes was pivotal in the subsequent development of 'good' low density quantum error correcting codes that have optimal scaling of the key parameters of distance and storage density. We review this family, giving a completely different presentation to the original, minimising the abstraction and technicalities wherever possible. The target audience is anyone familiar with the stabilizer formalism for error correction wanting to understand how parity-check matrices can be constructed for high storage density quantum codes."},"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":"2505.13679","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-19T19:26:53Z","cross_cats_sorted":[],"title_canon_sha256":"65f1ca544e01c7f49b26102601f833358d4e46230edcabc4bc4047e46031f037","abstract_canon_sha256":"88ebe5eefedf4546a1ca5b7c315234985eb631fd96b98f06d15c311c61e385a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:27.050882Z","signature_b64":"4ZTN2sKJavIK/ei60VThGEV7KQH7XP6bezcsOkuJw1VVLTDG+LbuzNpMEZzwa1JAYRDQPxKtqF4NjvH1alh/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cbc106765d382ae830cbad849a7422727721785a8486ff9d68daebbfb9069e","last_reissued_at":"2026-07-05T11:19:27.050353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:27.050353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demystifying the Balanced Product Code: A Review","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Heather Leitch","submitted_at":"2025-05-19T19:26:53Z","abstract_excerpt":"The discovery of the family of balanced product codes was pivotal in the subsequent development of 'good' low density quantum error correcting codes that have optimal scaling of the key parameters of distance and storage density. We review this family, giving a completely different presentation to the original, minimising the abstraction and technicalities wherever possible. The target audience is anyone familiar with the stabilizer formalism for error correction wanting to understand how parity-check matrices can be constructed for high storage density quantum codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13679","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.13679/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.13679","created_at":"2026-07-05T11:19:27.050415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13679v2","created_at":"2026-07-05T11:19:27.050415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13679","created_at":"2026-07-05T11:19:27.050415+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7F4CBTWLU4C","created_at":"2026-07-05T11:19:27.050415+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7F4CBTWLU4CV2BQ","created_at":"2026-07-05T11:19:27.050415+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7F4CBTW","created_at":"2026-07-05T11:19:27.050415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15905","citing_title":"Transversal Gates for Highly Asymmetric qLDPC Codes","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ","json":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ.json","graph_json":"https://pith.science/api/pith-number/K7F4CBTWLU4CV2BQZOWYJGTUEJ/graph.json","events_json":"https://pith.science/api/pith-number/K7F4CBTWLU4CV2BQZOWYJGTUEJ/events.json","paper":"https://pith.science/paper/K7F4CBTW"},"agent_actions":{"view_html":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ","download_json":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ.json","view_paper":"https://pith.science/paper/K7F4CBTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13679&json=true","fetch_graph":"https://pith.science/api/pith-number/K7F4CBTWLU4CV2BQZOWYJGTUEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/K7F4CBTWLU4CV2BQZOWYJGTUEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ/action/storage_attestation","attest_author":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ/action/author_attestation","sign_citation":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ/action/citation_signature","submit_replication":"https://pith.science/pith/K7F4CBTWLU4CV2BQZOWYJGTUEJ/action/replication_record"}},"created_at":"2026-07-05T11:19:27.050415+00:00","updated_at":"2026-07-05T11:19:27.050415+00:00"}