{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZKKSQGICEXUDXLGBENYH7JPCL","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":"c46b7d9a0fc48e74692ea1454b6c21364f7c19f22e1365ac569cdacb9925835e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:23:35Z","title_canon_sha256":"70dda381134aed50f41f7f60a506eba8feadc88743915a860b4c00e47fcd8097"},"schema_version":"1.0","source":{"id":"1703.05302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05302","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05302v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05302","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"EZKKSQGICEXU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZKKSQGICEXUDXLG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZKKSQGI","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:016fb44fd0ca5bb1481c7c3ca5cbfbf548717a42332abe09b483ae52b859d1e6","target":"graph","created_at":"2026-05-18T00:48:34Z","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"},"paper":{"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.","authors_text":"Ilya Dumer, Kirill Shabunov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:23:35Z","title":"Recursive constructions and their maximum likelihood decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05302","kind":"arxiv","version":1},"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:50456cabebe56b20e18dbbe69e81ea5da636dd1a3875e5a855d85574169d2a7a","target":"record","created_at":"2026-05-18T00:48:34Z","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":"c46b7d9a0fc48e74692ea1454b6c21364f7c19f22e1365ac569cdacb9925835e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:23:35Z","title_canon_sha256":"70dda381134aed50f41f7f60a506eba8feadc88743915a860b4c00e47fcd8097"},"schema_version":"1.0","source":{"id":"1703.05302","kind":"arxiv","version":1}},"canonical_sha256":"2654a940c8112f41dd66091b83fd2f12e167a6d0a72d0fbf663c6d617b245db5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2654a940c8112f41dd66091b83fd2f12e167a6d0a72d0fbf663c6d617b245db5","first_computed_at":"2026-05-18T00:48:34.643857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:34.643857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uWjMAqSy+2SQmujEcxxOYz5JFfoMXij6UfC3U/hyc8rjmyyvtnaRzWLFS/eWlp8yuCHaVilbPI410jGZDr78DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:34.644383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50456cabebe56b20e18dbbe69e81ea5da636dd1a3875e5a855d85574169d2a7a","sha256:016fb44fd0ca5bb1481c7c3ca5cbfbf548717a42332abe09b483ae52b859d1e6"],"state_sha256":"1f6a1ef80517ff1d7dfe438a5ccdf374b9a9a017be5aecdf78c4bb6c6f097bbb"}