{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VXB3ORHR5FEPFNVAXGBJ4QFEJT","short_pith_number":"pith:VXB3ORHR","canonical_record":{"source":{"id":"2411.09803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-14T20:39:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a163673c5f47b01aaeec1deeb2ffdd978ab392d38fb428526ebd91a07f646d96","abstract_canon_sha256":"0eb41663579f126ad2a3113832d2fb1f825e29223ac6503cc751ea7bec845a82"},"schema_version":"1.0"},"canonical_sha256":"adc3b744f1e948f2b6a0b9829e40a44cdadbcb3d1f9a39f3d03dabed1d168548","source":{"kind":"arxiv","id":"2411.09803","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.09803","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.09803v2","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09803","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"VXB3ORHR5FEP","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"VXB3ORHR5FEPFNVA","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"VXB3ORHR","created_at":"2026-07-05T09:52:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VXB3ORHR5FEPFNVAXGBJ4QFEJT","target":"record","payload":{"canonical_record":{"source":{"id":"2411.09803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-14T20:39:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a163673c5f47b01aaeec1deeb2ffdd978ab392d38fb428526ebd91a07f646d96","abstract_canon_sha256":"0eb41663579f126ad2a3113832d2fb1f825e29223ac6503cc751ea7bec845a82"},"schema_version":"1.0"},"canonical_sha256":"adc3b744f1e948f2b6a0b9829e40a44cdadbcb3d1f9a39f3d03dabed1d168548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:18.105703Z","signature_b64":"6dc5Dh3txU8EWUD//FbVjPJn32os3GsOMuoMIj+EZ7XOAsomwHvMoFFoboyjwifuc/L/8+8Vc1hxUSRkl/QYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc3b744f1e948f2b6a0b9829e40a44cdadbcb3d1f9a39f3d03dabed1d168548","last_reissued_at":"2026-07-05T09:52:18.105253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:18.105253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.09803","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-07-05T09:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwBO061UHyBdvjiVro2WNsTwqT8fzh0LTIKC1nLYmVirmFieF7F7Ku9D6cobiFhIplCoNqw9ZY6fzkAeq+QVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:16:24.685512Z"},"content_sha256":"cc425c70f2962946f28935e6ab291f189bbdb8cbb90394a41d398c7bdec186a7","schema_version":"1.0","event_id":"sha256:cc425c70f2962946f28935e6ab291f189bbdb8cbb90394a41d398c7bdec186a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VXB3ORHR5FEPFNVAXGBJ4QFEJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph Griffin, Ken R. Duffy, Muriel Medard, Peihong Yuan","submitted_at":"2024-11-14T20:39:35Z","abstract_excerpt":"Guessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear codebook structure to reduce the number of queries made by Guessing Random Additive Noise Decoding (GRAND), for binary linear codes that include a full-message single parity-check (SPC) bit, we show that it is possible to reduce the number of queries made by GCD by a factor of up to 2 with the greatest guesswork reduction realized at lower SNRs, without impacting decoding precision. Codes without a full-m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09803","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.09803/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWkmbwcz4Ei6Km9fJzepx7Q4Opu8/7q6ig1Xj8K9hbx+HBGFpXURx6ZTHcZ6G+9e4L0GhgdMnt4H6YYSCYGzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:16:24.686030Z"},"content_sha256":"433c8f3a46a0fd534b8f5e2ad2e3037716dc44dcd0cfb246d6783c90600d810d","schema_version":"1.0","event_id":"sha256:433c8f3a46a0fd534b8f5e2ad2e3037716dc44dcd0cfb246d6783c90600d810d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/bundle.json","state_url":"https://pith.science/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/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-08-05T23:16:24Z","links":{"resolver":"https://pith.science/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT","bundle":"https://pith.science/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/bundle.json","state":"https://pith.science/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXB3ORHR5FEPFNVAXGBJ4QFEJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VXB3ORHR5FEPFNVAXGBJ4QFEJT","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":"0eb41663579f126ad2a3113832d2fb1f825e29223ac6503cc751ea7bec845a82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-14T20:39:35Z","title_canon_sha256":"a163673c5f47b01aaeec1deeb2ffdd978ab392d38fb428526ebd91a07f646d96"},"schema_version":"1.0","source":{"id":"2411.09803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.09803","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.09803v2","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09803","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"VXB3ORHR5FEP","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"VXB3ORHR5FEPFNVA","created_at":"2026-07-05T09:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"VXB3ORHR","created_at":"2026-07-05T09:52:18Z"}],"graph_snapshots":[{"event_id":"sha256:433c8f3a46a0fd534b8f5e2ad2e3037716dc44dcd0cfb246d6783c90600d810d","target":"graph","created_at":"2026-07-05T09:52:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.09803/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Guessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear codebook structure to reduce the number of queries made by Guessing Random Additive Noise Decoding (GRAND), for binary linear codes that include a full-message single parity-check (SPC) bit, we show that it is possible to reduce the number of queries made by GCD by a factor of up to 2 with the greatest guesswork reduction realized at lower SNRs, without impacting decoding precision. Codes without a full-m","authors_text":"Joseph Griffin, Ken R. Duffy, Muriel Medard, Peihong Yuan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-14T20:39:35Z","title":"Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09803","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:cc425c70f2962946f28935e6ab291f189bbdb8cbb90394a41d398c7bdec186a7","target":"record","created_at":"2026-07-05T09:52:18Z","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":"0eb41663579f126ad2a3113832d2fb1f825e29223ac6503cc751ea7bec845a82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-14T20:39:35Z","title_canon_sha256":"a163673c5f47b01aaeec1deeb2ffdd978ab392d38fb428526ebd91a07f646d96"},"schema_version":"1.0","source":{"id":"2411.09803","kind":"arxiv","version":2}},"canonical_sha256":"adc3b744f1e948f2b6a0b9829e40a44cdadbcb3d1f9a39f3d03dabed1d168548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adc3b744f1e948f2b6a0b9829e40a44cdadbcb3d1f9a39f3d03dabed1d168548","first_computed_at":"2026-07-05T09:52:18.105253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:52:18.105253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dc5Dh3txU8EWUD//FbVjPJn32os3GsOMuoMIj+EZ7XOAsomwHvMoFFoboyjwifuc/L/8+8Vc1hxUSRkl/QYCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:52:18.105703Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.09803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc425c70f2962946f28935e6ab291f189bbdb8cbb90394a41d398c7bdec186a7","sha256:433c8f3a46a0fd534b8f5e2ad2e3037716dc44dcd0cfb246d6783c90600d810d"],"state_sha256":"e8c7f699c59be58f2732f36b5d48cac97a9211cb07c65790c71e1c4922914895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XW4sgipJwvs7lZg9nyFaMECli+Bsh7BZiD3l1ooQWW4Cy2l3MEBvuVM4qtnMyloBtkrfSFJCxItkFWEIa/UKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:16:24.691512Z","bundle_sha256":"280e7fa41256c960ace73e77ddfa46a91a41966710e433e1c56f142989c7d52e"}}