{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OMLC7PJG7DEFKGU4HEVTUQJSBV","short_pith_number":"pith:OMLC7PJG","schema_version":"1.0","canonical_sha256":"73162fbd26f8c8551a9c392b3a41320d628f0c213b4256ef30521f82dbc1bedc","source":{"kind":"arxiv","id":"1804.01950","version":2},"attestation_state":"computed","paper":{"title":"Numerical and analytical bounds on threshold error rates for hypergraph-product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko, Sanjay Prabhakar","submitted_at":"2018-04-05T16:51:44Z","abstract_excerpt":"We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower and upper bounds for the decodable region are constructed analytically by analyzing the properties of the homological difference, equal minus the logarithm of the maximum-likelihood decoding probability for a given syndrome. Numerical results include an upper bound for the decodable region from specific heat calculations in associated Ising models, and a minim"},"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":"1804.01950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-05T16:51:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f230a16836d63c7564ec208c7917d7606f32e9347b67ae60a9002e0a2f313f32","abstract_canon_sha256":"6515fc478e78270f14aba7b26eaf88ddc16d37914625f17d14a80faefa64664e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:21.407495Z","signature_b64":"Mg+4m2KtaS3ZYK6ZK6nlFjnAqX+PoZ8UVdYgz1+Rnk4WOf9H0+yP5P6aFrzudDHbCB7tz3xp0UnyEMPwXJ3uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73162fbd26f8c8551a9c392b3a41320d628f0c213b4256ef30521f82dbc1bedc","last_reissued_at":"2026-05-18T00:13:21.406927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:21.406927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical and analytical bounds on threshold error rates for hypergraph-product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko, Sanjay Prabhakar","submitted_at":"2018-04-05T16:51:44Z","abstract_excerpt":"We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower and upper bounds for the decodable region are constructed analytically by analyzing the properties of the homological difference, equal minus the logarithm of the maximum-likelihood decoding probability for a given syndrome. Numerical results include an upper bound for the decodable region from specific heat calculations in associated Ising models, and a minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01950","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":"1804.01950","created_at":"2026-05-18T00:13:21.407005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01950v2","created_at":"2026-05-18T00:13:21.407005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01950","created_at":"2026-05-18T00:13:21.407005+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMLC7PJG7DEF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMLC7PJG7DEFKGU4","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMLC7PJG","created_at":"2026-05-18T12:32:43.782077+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/OMLC7PJG7DEFKGU4HEVTUQJSBV","json":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV.json","graph_json":"https://pith.science/api/pith-number/OMLC7PJG7DEFKGU4HEVTUQJSBV/graph.json","events_json":"https://pith.science/api/pith-number/OMLC7PJG7DEFKGU4HEVTUQJSBV/events.json","paper":"https://pith.science/paper/OMLC7PJG"},"agent_actions":{"view_html":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV","download_json":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV.json","view_paper":"https://pith.science/paper/OMLC7PJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01950&json=true","fetch_graph":"https://pith.science/api/pith-number/OMLC7PJG7DEFKGU4HEVTUQJSBV/graph.json","fetch_events":"https://pith.science/api/pith-number/OMLC7PJG7DEFKGU4HEVTUQJSBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV/action/storage_attestation","attest_author":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV/action/author_attestation","sign_citation":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV/action/citation_signature","submit_replication":"https://pith.science/pith/OMLC7PJG7DEFKGU4HEVTUQJSBV/action/replication_record"}},"created_at":"2026-05-18T00:13:21.407005+00:00","updated_at":"2026-05-18T00:13:21.407005+00:00"}