{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:44UCD237NVD2FMF2GISHCJXEY2","short_pith_number":"pith:44UCD237","schema_version":"1.0","canonical_sha256":"e72821eb7f6d47a2b0ba32247126e4c69fd9d1ad1a31f37dafbff094c4580994","source":{"kind":"arxiv","id":"2607.04045","version":1},"attestation_state":"computed","paper":{"title":"SOGRAND decoding of LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiewei Feng, Ken R. Duffy, Lukas Rapp, Muriel M\\'edard","submitted_at":"2026-07-04T22:09:47Z","abstract_excerpt":"Long forward error correction codes are typically constructed by concatenating shorter component codes that are then decoded through iterative Soft-Input Soft-Output (SISO) of their components. The recently introduced Soft Output Guessing Random Additive Noise Decoding (SOGRAND) has been shown to enable accurate SISO component decoding for a broad range of component codes. Here we establish that by specializing its SISO computation to Single Parity Check codes, SOGRAND offers an alternative existing Check Node (CN) update for decoding Low Density Parity Check codes. Simulation results demonstr"},"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":"2607.04045","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-04T22:09:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c23b75cdcdd15840bcfc94c5d46c78514a1ae444ea9c2e75c42c713138ca3e90","abstract_canon_sha256":"c192386ca176964eaf7c4a3d250d1685a30afd16d5e08085b6efa548ab2eebad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:54.837667Z","signature_b64":"eRGpEqVNuW6m0BH9ndyuyhnX/MWqrg0+t5jS06k166Orv+P2svZluESfV9y5SQngcUBF3SH5+pINwublDj4BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e72821eb7f6d47a2b0ba32247126e4c69fd9d1ad1a31f37dafbff094c4580994","last_reissued_at":"2026-07-07T02:18:54.836895Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:54.836895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOGRAND decoding of LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiewei Feng, Ken R. Duffy, Lukas Rapp, Muriel M\\'edard","submitted_at":"2026-07-04T22:09:47Z","abstract_excerpt":"Long forward error correction codes are typically constructed by concatenating shorter component codes that are then decoded through iterative Soft-Input Soft-Output (SISO) of their components. The recently introduced Soft Output Guessing Random Additive Noise Decoding (SOGRAND) has been shown to enable accurate SISO component decoding for a broad range of component codes. Here we establish that by specializing its SISO computation to Single Parity Check codes, SOGRAND offers an alternative existing Check Node (CN) update for decoding Low Density Parity Check codes. Simulation results demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04045","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/2607.04045/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":"2607.04045","created_at":"2026-07-07T02:18:54.837016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04045v1","created_at":"2026-07-07T02:18:54.837016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04045","created_at":"2026-07-07T02:18:54.837016+00:00"},{"alias_kind":"pith_short_12","alias_value":"44UCD237NVD2","created_at":"2026-07-07T02:18:54.837016+00:00"},{"alias_kind":"pith_short_16","alias_value":"44UCD237NVD2FMF2","created_at":"2026-07-07T02:18:54.837016+00:00"},{"alias_kind":"pith_short_8","alias_value":"44UCD237","created_at":"2026-07-07T02:18:54.837016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04068","citing_title":"Tail-Calibrated Soft-Output GRAND for Finite-Memory Noise-Effect Posteriors","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2","json":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2.json","graph_json":"https://pith.science/api/pith-number/44UCD237NVD2FMF2GISHCJXEY2/graph.json","events_json":"https://pith.science/api/pith-number/44UCD237NVD2FMF2GISHCJXEY2/events.json","paper":"https://pith.science/paper/44UCD237"},"agent_actions":{"view_html":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2","download_json":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2.json","view_paper":"https://pith.science/paper/44UCD237","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04045&json=true","fetch_graph":"https://pith.science/api/pith-number/44UCD237NVD2FMF2GISHCJXEY2/graph.json","fetch_events":"https://pith.science/api/pith-number/44UCD237NVD2FMF2GISHCJXEY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2/action/storage_attestation","attest_author":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2/action/author_attestation","sign_citation":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2/action/citation_signature","submit_replication":"https://pith.science/pith/44UCD237NVD2FMF2GISHCJXEY2/action/replication_record"}},"created_at":"2026-07-07T02:18:54.837016+00:00","updated_at":"2026-07-07T02:18:54.837016+00:00"}