{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DEQSZLX2F6HKZXCOOUAVHU7GZV","short_pith_number":"pith:DEQSZLX2","schema_version":"1.0","canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","source":{"kind":"arxiv","id":"1504.05225","version":2},"attestation_state":"computed","paper":{"title":"The maximum-likelihood decoding threshold for graphic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Nelson, Stefan H.M. van Zwam","submitted_at":"2015-04-20T20:47:17Z","abstract_excerpt":"For a class $\\mathcal{C}$ of binary linear codes, we write $\\theta_{\\mathcal{C}}\\colon (0,1) \\to [0,\\frac{1}{2}]$ for the maximum-likelihood decoding threshold function of $\\mathcal{C}$, the function whose value at $R \\in (0,1)$ is the largest bit-error rate $p$ that codes in $\\mathcal{C}$ can tolerate with a negligible probability of maximum-likelihood decoding error across a binary symmetric channel. We show that, if $\\mathcal{C}$ is the class of cycle codes of graphs, then $\\theta_{\\mathcal{C}}(R) \\le \\frac{(1-\\sqrt{R})^2}{2(1+R)}$ for each $R$, and show that equality holds only when $R$ is"},"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":"1504.05225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:47:17Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"8a4ff63eca3ff531f8f8393177de6d6942694909e76615299cae3460f31fde81","abstract_canon_sha256":"ac84e2a86490fe71ec4ebe89ddb8fc7489d93a402930e502b3a26c93f8ab65d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:05.452521Z","signature_b64":"L7TqUNnw1Pc8G0ziNQU7RG96F0yOq3gRHD7dcfmKYEChqPiolJy42NAk/VprnvBXEpbqKddP2ithbVN/B2g3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","last_reissued_at":"2026-05-18T01:17:05.451902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:05.451902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum-likelihood decoding threshold for graphic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Nelson, Stefan H.M. van Zwam","submitted_at":"2015-04-20T20:47:17Z","abstract_excerpt":"For a class $\\mathcal{C}$ of binary linear codes, we write $\\theta_{\\mathcal{C}}\\colon (0,1) \\to [0,\\frac{1}{2}]$ for the maximum-likelihood decoding threshold function of $\\mathcal{C}$, the function whose value at $R \\in (0,1)$ is the largest bit-error rate $p$ that codes in $\\mathcal{C}$ can tolerate with a negligible probability of maximum-likelihood decoding error across a binary symmetric channel. We show that, if $\\mathcal{C}$ is the class of cycle codes of graphs, then $\\theta_{\\mathcal{C}}(R) \\le \\frac{(1-\\sqrt{R})^2}{2(1+R)}$ for each $R$, and show that equality holds only when $R$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05225","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":"1504.05225","created_at":"2026-05-18T01:17:05.451998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05225v2","created_at":"2026-05-18T01:17:05.451998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05225","created_at":"2026-05-18T01:17:05.451998+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEQSZLX2F6HK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEQSZLX2F6HKZXCO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEQSZLX2","created_at":"2026-05-18T12:29:17.054201+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/DEQSZLX2F6HKZXCOOUAVHU7GZV","json":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV.json","graph_json":"https://pith.science/api/pith-number/DEQSZLX2F6HKZXCOOUAVHU7GZV/graph.json","events_json":"https://pith.science/api/pith-number/DEQSZLX2F6HKZXCOOUAVHU7GZV/events.json","paper":"https://pith.science/paper/DEQSZLX2"},"agent_actions":{"view_html":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV","download_json":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV.json","view_paper":"https://pith.science/paper/DEQSZLX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05225&json=true","fetch_graph":"https://pith.science/api/pith-number/DEQSZLX2F6HKZXCOOUAVHU7GZV/graph.json","fetch_events":"https://pith.science/api/pith-number/DEQSZLX2F6HKZXCOOUAVHU7GZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/action/storage_attestation","attest_author":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/action/author_attestation","sign_citation":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/action/citation_signature","submit_replication":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/action/replication_record"}},"created_at":"2026-05-18T01:17:05.451998+00:00","updated_at":"2026-05-18T01:17:05.451998+00:00"}