{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IH5U6JB7CGINZIWB6ZLAQ7JQHR","short_pith_number":"pith:IH5U6JB7","schema_version":"1.0","canonical_sha256":"41fb4f243f1190dca2c1f656087d303c664db0c465994f2f1361893a627e9239","source":{"kind":"arxiv","id":"2510.07602","version":2},"attestation_state":"computed","paper":{"title":"Noisy-Syndrome Decoding of Hypergraph Product Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elena Grigorescu, S. Venkitesh, Vatsal Jha, Venkata Gandikota","submitted_at":"2025-10-08T22:48:39Z","abstract_excerpt":"Hypergraph product codes are a prototypical family of quantum codes with state-of-the-art decodability properties. In this work we consider the \"noisy\" syndrome decoding problem and exact recovery problem for hypergraph product codes and show a reduction to the decoding and exact recovery of classical codes in the noisy syndrome setting. Our results hold for a broad class of codes admitting efficient syndrome decoding, including Sipser-Spielman codes and Reed-Solomon 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":"2510.07602","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-08T22:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"b6afe60b7be404116d645557b60d5f7bd347cd54c972690826216e41993ba16a","abstract_canon_sha256":"a58c165dccaae790792a9baddcbb9eba6835cd97b57f9ca532ec82475890ead6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.099358Z","signature_b64":"U2fIY0/y79DyFQrsD+xbhkCV8R50eJXuN35DPhL4ynTpF6962jBZaJUwjOyu4aBs0sGXfP2Icgcw7Grs3aF3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fb4f243f1190dca2c1f656087d303c664db0c465994f2f1361893a627e9239","last_reissued_at":"2026-05-18T02:44:33.098783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.098783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy-Syndrome Decoding of Hypergraph Product Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elena Grigorescu, S. Venkitesh, Vatsal Jha, Venkata Gandikota","submitted_at":"2025-10-08T22:48:39Z","abstract_excerpt":"Hypergraph product codes are a prototypical family of quantum codes with state-of-the-art decodability properties. In this work we consider the \"noisy\" syndrome decoding problem and exact recovery problem for hypergraph product codes and show a reduction to the decoding and exact recovery of classical codes in the noisy syndrome setting. Our results hold for a broad class of codes admitting efficient syndrome decoding, including Sipser-Spielman codes and Reed-Solomon codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.07602","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":"2510.07602","created_at":"2026-05-18T02:44:33.098869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.07602v2","created_at":"2026-05-18T02:44:33.098869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07602","created_at":"2026-05-18T02:44:33.098869+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH5U6JB7CGIN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH5U6JB7CGINZIWB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH5U6JB7","created_at":"2026-05-18T12:33:37.589309+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/IH5U6JB7CGINZIWB6ZLAQ7JQHR","json":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR.json","graph_json":"https://pith.science/api/pith-number/IH5U6JB7CGINZIWB6ZLAQ7JQHR/graph.json","events_json":"https://pith.science/api/pith-number/IH5U6JB7CGINZIWB6ZLAQ7JQHR/events.json","paper":"https://pith.science/paper/IH5U6JB7"},"agent_actions":{"view_html":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR","download_json":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR.json","view_paper":"https://pith.science/paper/IH5U6JB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.07602&json=true","fetch_graph":"https://pith.science/api/pith-number/IH5U6JB7CGINZIWB6ZLAQ7JQHR/graph.json","fetch_events":"https://pith.science/api/pith-number/IH5U6JB7CGINZIWB6ZLAQ7JQHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR/action/storage_attestation","attest_author":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR/action/author_attestation","sign_citation":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR/action/citation_signature","submit_replication":"https://pith.science/pith/IH5U6JB7CGINZIWB6ZLAQ7JQHR/action/replication_record"}},"created_at":"2026-05-18T02:44:33.098869+00:00","updated_at":"2026-05-18T02:44:33.098869+00:00"}