{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6PLN4UEXOO2H55YUQRXCGYELLZ","short_pith_number":"pith:6PLN4UEX","schema_version":"1.0","canonical_sha256":"f3d6de509773b47ef714846e23608b5e434c183ff7dd5a79b1f19f02e7b15d31","source":{"kind":"arxiv","id":"1810.01519","version":2},"attestation_state":"computed","paper":{"title":"Higher-dimensional quantum hypergraph-product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko, Weilei Zeng","submitted_at":"2018-10-02T21:17:53Z","abstract_excerpt":"We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product (QHP) codes by Tillich and Z\\'emor, and all families of toric codes on $m$-dimensional hypercubic lattices. Similar to the latter, our codes form $m$-complexes ${\\cal K}_m$, with $m\\ge2$. These are defined recursively, with ${\\cal K}_m$ obtained as a tensor product of a complex ${\\cal K}_{m-1}$ with a $1$-complex parameterized by a binary matrix. Parameters of the constructed codes are given explicitly in terms of those of binary codes associated with the matrices used in the constructio"},"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":"1810.01519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-02T21:17:53Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"3f4b6cf55dfad1cd4e1969c5280756fe5eac33a16c2d8700b2d4e470a162a119","abstract_canon_sha256":"f6a0842deb661db017e7ac9939d3a693fd6d0a14d19cfe957ef6de2de73f15a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:04.558676Z","signature_b64":"Dv35aKSNVgceOJI0u/mEo9Odq4tER8L0E0iXjrRySOE/KYv6U8eLXhTUGVd9LlJMNVJPp/mOaH2cttPHCC7WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3d6de509773b47ef714846e23608b5e434c183ff7dd5a79b1f19f02e7b15d31","last_reissued_at":"2026-05-17T23:43:04.558243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:04.558243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-dimensional quantum hypergraph-product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko, Weilei Zeng","submitted_at":"2018-10-02T21:17:53Z","abstract_excerpt":"We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product (QHP) codes by Tillich and Z\\'emor, and all families of toric codes on $m$-dimensional hypercubic lattices. Similar to the latter, our codes form $m$-complexes ${\\cal K}_m$, with $m\\ge2$. These are defined recursively, with ${\\cal K}_m$ obtained as a tensor product of a complex ${\\cal K}_{m-1}$ with a $1$-complex parameterized by a binary matrix. Parameters of the constructed codes are given explicitly in terms of those of binary codes associated with the matrices used in the constructio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01519","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":""},"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":"1810.01519","created_at":"2026-05-17T23:43:04.558307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01519v2","created_at":"2026-05-17T23:43:04.558307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01519","created_at":"2026-05-17T23:43:04.558307+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PLN4UEXOO2H","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PLN4UEXOO2H55YU","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PLN4UEX","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ","json":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ.json","graph_json":"https://pith.science/api/pith-number/6PLN4UEXOO2H55YUQRXCGYELLZ/graph.json","events_json":"https://pith.science/api/pith-number/6PLN4UEXOO2H55YUQRXCGYELLZ/events.json","paper":"https://pith.science/paper/6PLN4UEX"},"agent_actions":{"view_html":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ","download_json":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ.json","view_paper":"https://pith.science/paper/6PLN4UEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01519&json=true","fetch_graph":"https://pith.science/api/pith-number/6PLN4UEXOO2H55YUQRXCGYELLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6PLN4UEXOO2H55YUQRXCGYELLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ/action/storage_attestation","attest_author":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ/action/author_attestation","sign_citation":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ/action/citation_signature","submit_replication":"https://pith.science/pith/6PLN4UEXOO2H55YUQRXCGYELLZ/action/replication_record"}},"created_at":"2026-05-17T23:43:04.558307+00:00","updated_at":"2026-05-17T23:43:04.558307+00:00"}