{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EZKKSQGICEXUDXLGBENYH7JPCL","short_pith_number":"pith:EZKKSQGI","schema_version":"1.0","canonical_sha256":"2654a940c8112f41dd66091b83fd2f12e167a6d0a72d0fbf663c6d617b245db5","source":{"kind":"arxiv","id":"1703.05302","version":1},"attestation_state":"computed","paper":{"title":"Recursive constructions and their maximum likelihood decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Dumer, Kirill Shabunov","submitted_at":"2017-03-14T22:23:35Z","abstract_excerpt":"We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity."},"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":"1703.05302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:23:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70dda381134aed50f41f7f60a506eba8feadc88743915a860b4c00e47fcd8097","abstract_canon_sha256":"c46b7d9a0fc48e74692ea1454b6c21364f7c19f22e1365ac569cdacb9925835e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:34.644383Z","signature_b64":"uWjMAqSy+2SQmujEcxxOYz5JFfoMXij6UfC3U/hyc8rjmyyvtnaRzWLFS/eWlp8yuCHaVilbPI410jGZDr78DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2654a940c8112f41dd66091b83fd2f12e167a6d0a72d0fbf663c6d617b245db5","last_reissued_at":"2026-05-18T00:48:34.643857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:34.643857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive constructions and their maximum likelihood decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Dumer, Kirill Shabunov","submitted_at":"2017-03-14T22:23:35Z","abstract_excerpt":"We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05302","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":"1703.05302","created_at":"2026-05-18T00:48:34.643932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05302v1","created_at":"2026-05-18T00:48:34.643932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05302","created_at":"2026-05-18T00:48:34.643932+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZKKSQGICEXU","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZKKSQGICEXUDXLG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZKKSQGI","created_at":"2026-05-18T12:31:12.930513+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/EZKKSQGICEXUDXLGBENYH7JPCL","json":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL.json","graph_json":"https://pith.science/api/pith-number/EZKKSQGICEXUDXLGBENYH7JPCL/graph.json","events_json":"https://pith.science/api/pith-number/EZKKSQGICEXUDXLGBENYH7JPCL/events.json","paper":"https://pith.science/paper/EZKKSQGI"},"agent_actions":{"view_html":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL","download_json":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL.json","view_paper":"https://pith.science/paper/EZKKSQGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05302&json=true","fetch_graph":"https://pith.science/api/pith-number/EZKKSQGICEXUDXLGBENYH7JPCL/graph.json","fetch_events":"https://pith.science/api/pith-number/EZKKSQGICEXUDXLGBENYH7JPCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL/action/storage_attestation","attest_author":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL/action/author_attestation","sign_citation":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL/action/citation_signature","submit_replication":"https://pith.science/pith/EZKKSQGICEXUDXLGBENYH7JPCL/action/replication_record"}},"created_at":"2026-05-18T00:48:34.643932+00:00","updated_at":"2026-05-18T00:48:34.643932+00:00"}