{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5LIG5U7YCUGT7V33JUVCILWMCH","short_pith_number":"pith:5LIG5U7Y","schema_version":"1.0","canonical_sha256":"ead06ed3f8150d3fd77b4d2a242ecc11f89de77a1173eb1b677c54b7510e97e6","source":{"kind":"arxiv","id":"2305.05777","version":1},"attestation_state":"computed","paper":{"title":"Upgrade error detection to prediction with GRAND","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken R. Duffy, Kevin Galligan, Muriel M\\'edard, Peihong Yuan","submitted_at":"2023-05-09T21:43:21Z","abstract_excerpt":"Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through which any soft-input GRAND algorithm can provide soft output in the form of an accurate a posteriori estimate of the likelihood that a decoding is correct or, in the case of list decoding, the likelihood that the correct decoding is an element of the list. Implementing the method adds negligible additional computation and memory to the existing decoding proces"},"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":"2305.05777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T21:43:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fa75f99e3fe3c3820916c5d0d8c8f1b47416017c54ba9c42eca6b84f934b95a","abstract_canon_sha256":"a3ddd97eff6bdfa4d964132640bac4797e0b1adf7c4a6f49b5d1c60eeba1c158"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:53.547573Z","signature_b64":"csUng9zev7DHRhwblyQEPx3ylrI9oDWUcuqLqr8fMAiFkf2hLfE0id5miu5AgvSHpEwXNMgSMOIkpQ8U3G/8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ead06ed3f8150d3fd77b4d2a242ecc11f89de77a1173eb1b677c54b7510e97e6","last_reissued_at":"2026-07-05T06:39:53.547092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:53.547092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upgrade error detection to prediction with GRAND","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken R. Duffy, Kevin Galligan, Muriel M\\'edard, Peihong Yuan","submitted_at":"2023-05-09T21:43:21Z","abstract_excerpt":"Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through which any soft-input GRAND algorithm can provide soft output in the form of an accurate a posteriori estimate of the likelihood that a decoding is correct or, in the case of list decoding, the likelihood that the correct decoding is an element of the list. Implementing the method adds negligible additional computation and memory to the existing decoding proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05777","kind":"arxiv","version":1},"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/2305.05777/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.05777","created_at":"2026-07-05T06:39:53.547154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.05777v1","created_at":"2026-07-05T06:39:53.547154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05777","created_at":"2026-07-05T06:39:53.547154+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LIG5U7YCUGT","created_at":"2026-07-05T06:39:53.547154+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LIG5U7YCUGT7V33","created_at":"2026-07-05T06:39:53.547154+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LIG5U7Y","created_at":"2026-07-05T06:39:53.547154+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/5LIG5U7YCUGT7V33JUVCILWMCH","json":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH.json","graph_json":"https://pith.science/api/pith-number/5LIG5U7YCUGT7V33JUVCILWMCH/graph.json","events_json":"https://pith.science/api/pith-number/5LIG5U7YCUGT7V33JUVCILWMCH/events.json","paper":"https://pith.science/paper/5LIG5U7Y"},"agent_actions":{"view_html":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH","download_json":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH.json","view_paper":"https://pith.science/paper/5LIG5U7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.05777&json=true","fetch_graph":"https://pith.science/api/pith-number/5LIG5U7YCUGT7V33JUVCILWMCH/graph.json","fetch_events":"https://pith.science/api/pith-number/5LIG5U7YCUGT7V33JUVCILWMCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH/action/storage_attestation","attest_author":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH/action/author_attestation","sign_citation":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH/action/citation_signature","submit_replication":"https://pith.science/pith/5LIG5U7YCUGT7V33JUVCILWMCH/action/replication_record"}},"created_at":"2026-07-05T06:39:53.547154+00:00","updated_at":"2026-07-05T06:39:53.547154+00:00"}