{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:H33XA46NCFT5WBFIAJA7CDBCSP","short_pith_number":"pith:H33XA46N","schema_version":"1.0","canonical_sha256":"3ef77073cd1167db04a80241f10c2293c8d1ffea590fa95c0714260c9e94c43a","source":{"kind":"arxiv","id":"cs/0504032","version":1},"attestation_state":"computed","paper":{"title":"Critical Point for Maximum Likelihood Decoding of Linear Block Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marc Fossorier","submitted_at":"2005-04-10T00:40:46Z","abstract_excerpt":"In this letter, the SNR value at which the error performance curve of a soft decision maximum likelihood decoder reaches the slope corresponding to the code minimum distance is determined for a random code. Based on this value, referred to as the critical point, new insight about soft bounded distance decoding of random-like codes (and particularly Reed-Solomon codes) is provided."},"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":"cs/0504032","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-04-10T00:40:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca881c578437cbac93c526473e96bddfb68ed33f5be7be817def2cf2c81b65c9","abstract_canon_sha256":"3c5bd0def7eb8bea67812c8e724ebf4eeb4fa795572772d8c7fff340b4dd4e7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.126458Z","signature_b64":"VUKrnfKbWU4HaTG4nFGYOjz/u3afgBohnz7xwSsESDIE6caE+dRhhhhKKOZCoITYOiVZc9RukEdSNDTBpMxtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ef77073cd1167db04a80241f10c2293c8d1ffea590fa95c0714260c9e94c43a","last_reissued_at":"2026-05-18T00:57:45.125952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.125952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical Point for Maximum Likelihood Decoding of Linear Block Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marc Fossorier","submitted_at":"2005-04-10T00:40:46Z","abstract_excerpt":"In this letter, the SNR value at which the error performance curve of a soft decision maximum likelihood decoder reaches the slope corresponding to the code minimum distance is determined for a random code. Based on this value, referred to as the critical point, new insight about soft bounded distance decoding of random-like codes (and particularly Reed-Solomon codes) is provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504032","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":""},"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":"cs/0504032","created_at":"2026-05-18T00:57:45.126037+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0504032v1","created_at":"2026-05-18T00:57:45.126037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504032","created_at":"2026-05-18T00:57:45.126037+00:00"},{"alias_kind":"pith_short_12","alias_value":"H33XA46NCFT5","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"H33XA46NCFT5WBFI","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"H33XA46N","created_at":"2026-05-18T12:25:53.335082+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/H33XA46NCFT5WBFIAJA7CDBCSP","json":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP.json","graph_json":"https://pith.science/api/pith-number/H33XA46NCFT5WBFIAJA7CDBCSP/graph.json","events_json":"https://pith.science/api/pith-number/H33XA46NCFT5WBFIAJA7CDBCSP/events.json","paper":"https://pith.science/paper/H33XA46N"},"agent_actions":{"view_html":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP","download_json":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP.json","view_paper":"https://pith.science/paper/H33XA46N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0504032&json=true","fetch_graph":"https://pith.science/api/pith-number/H33XA46NCFT5WBFIAJA7CDBCSP/graph.json","fetch_events":"https://pith.science/api/pith-number/H33XA46NCFT5WBFIAJA7CDBCSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP/action/storage_attestation","attest_author":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP/action/author_attestation","sign_citation":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP/action/citation_signature","submit_replication":"https://pith.science/pith/H33XA46NCFT5WBFIAJA7CDBCSP/action/replication_record"}},"created_at":"2026-05-18T00:57:45.126037+00:00","updated_at":"2026-05-18T00:57:45.126037+00:00"}