{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DEQSZLX2F6HKZXCOOUAVHU7GZV","short_pith_number":"pith:DEQSZLX2","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"},"canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","source":{"kind":"arxiv","id":"1504.05225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05225","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05225v2","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05225","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"DEQSZLX2F6HK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEQSZLX2F6HKZXCO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEQSZLX2","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DEQSZLX2F6HKZXCOOUAVHU7GZV","target":"record","payload":{"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"},"canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","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"},"source_kind":"arxiv","source_id":"1504.05225","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cPnFTtFl80H3fIR8m10n6GqmYcNP+7c3g3Oon3WwF5XRrmqCkBmbRfvBLibNXu+xmaQyuIjUXz0ccA8/5HCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:35:23.890844Z"},"content_sha256":"446690dcf0387708d7d6f106770979821cadb6f260f7121dfa4128e32789b7d8","schema_version":"1.0","event_id":"sha256:446690dcf0387708d7d6f106770979821cadb6f260f7121dfa4128e32789b7d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DEQSZLX2F6HKZXCOOUAVHU7GZV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkMsmEgU4XpH/mfy4fwrVQIU4nP4XIfXD8pMZgB9mYN0qaJDarmiAW+jegF70wdkMs/lls6RxpA2ZgyjU5UqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:35:23.891195Z"},"content_sha256":"2d579156225e3af9932e4270c35f8303da51e93b22fcdfaa5b1b8a41288672f1","schema_version":"1.0","event_id":"sha256:2d579156225e3af9932e4270c35f8303da51e93b22fcdfaa5b1b8a41288672f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/bundle.json","state_url":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T11:35:23Z","links":{"resolver":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV","bundle":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/bundle.json","state":"https://pith.science/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEQSZLX2F6HKZXCOOUAVHU7GZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DEQSZLX2F6HKZXCOOUAVHU7GZV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ac84e2a86490fe71ec4ebe89ddb8fc7489d93a402930e502b3a26c93f8ab65d5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:47:17Z","title_canon_sha256":"8a4ff63eca3ff531f8f8393177de6d6942694909e76615299cae3460f31fde81"},"schema_version":"1.0","source":{"id":"1504.05225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05225","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05225v2","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05225","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"DEQSZLX2F6HK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEQSZLX2F6HKZXCO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEQSZLX2","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2d579156225e3af9932e4270c35f8303da51e93b22fcdfaa5b1b8a41288672f1","target":"graph","created_at":"2026-05-18T01:17:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Peter Nelson, Stefan H.M. van Zwam","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:47:17Z","title":"The maximum-likelihood decoding threshold for graphic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05225","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:446690dcf0387708d7d6f106770979821cadb6f260f7121dfa4128e32789b7d8","target":"record","created_at":"2026-05-18T01:17:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ac84e2a86490fe71ec4ebe89ddb8fc7489d93a402930e502b3a26c93f8ab65d5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:47:17Z","title_canon_sha256":"8a4ff63eca3ff531f8f8393177de6d6942694909e76615299cae3460f31fde81"},"schema_version":"1.0","source":{"id":"1504.05225","kind":"arxiv","version":2}},"canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19212caefa2f8eacdc4e750153d3e6cd65efc81c351283034e455558b61a1035","first_computed_at":"2026-05-18T01:17:05.451902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:05.451902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L7TqUNnw1Pc8G0ziNQU7RG96F0yOq3gRHD7dcfmKYEChqPiolJy42NAk/VprnvBXEpbqKddP2ithbVN/B2g3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:05.452521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:446690dcf0387708d7d6f106770979821cadb6f260f7121dfa4128e32789b7d8","sha256:2d579156225e3af9932e4270c35f8303da51e93b22fcdfaa5b1b8a41288672f1"],"state_sha256":"0d3a86ff59c8a4202e643c489d96aff67dac699bfe7ede1216d8168a0662a3e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuHw3uhis15tvTLclcgGEDi2Kjh82UP4EISCHBfLWqGhP00YF0C1PBP/6ARjoUK07Gg6WNwuRHlLilbdufdmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:35:23.893204Z","bundle_sha256":"b6d23013b531e46a10ae08d69f3c378f72cbaecec79f9f826f08450a774c747a"}}