{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6MYKCHH3YGSJOPZ6LBCU4YE5PP","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":"1c6ee9b0e068d45bb1dae5e0efe3d6bb1083f7c79ba4232fc55759c3223bb178","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T21:26:52Z","title_canon_sha256":"d394962ddc0f5c2dc4bd144a6b10eee835044beb03c157f58dbf1d84c7549e39"},"schema_version":"1.0","source":{"id":"1712.07222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07222","created_at":"2026-05-18T00:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07222v2","created_at":"2026-05-18T00:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07222","created_at":"2026-05-18T00:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"6MYKCHH3YGSJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6MYKCHH3YGSJOPZ6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6MYKCHH3","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6813827dbba20f5c119ddb6e2cfd30e1e9f1b02dd2e8ff5db66baf6b1f6a2c1f","target":"graph","created_at":"2026-05-18T00:17:11Z","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":"In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log n + O(log log n) bits of redundancy, where n is the length of the code. To the best of the author's knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.","authors_text":"Frederic Sala, Ryan Gabrys","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T21:26:52Z","title":"Codes Correcting Two Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07222","kind":"arxiv","version":2},"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:0840fdf6d4b767e4676c03d6fc8038fd090abbee5c336efc3249d12cb2b32ca8","target":"record","created_at":"2026-05-18T00:17:11Z","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":"1c6ee9b0e068d45bb1dae5e0efe3d6bb1083f7c79ba4232fc55759c3223bb178","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T21:26:52Z","title_canon_sha256":"d394962ddc0f5c2dc4bd144a6b10eee835044beb03c157f58dbf1d84c7549e39"},"schema_version":"1.0","source":{"id":"1712.07222","kind":"arxiv","version":2}},"canonical_sha256":"f330a11cfbc1a4973f3e58454e609d7bd9352a172c3b5f916e9e2643462e6cc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f330a11cfbc1a4973f3e58454e609d7bd9352a172c3b5f916e9e2643462e6cc7","first_computed_at":"2026-05-18T00:17:11.002015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:11.002015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGhhf84mF17oQJodT2/p4j6rc23ZckWqWn6miHinzdU0x7RKx81GWbuDof97Hkykr/s8N4pbi54MT3Mix8gbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:11.002696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0840fdf6d4b767e4676c03d6fc8038fd090abbee5c336efc3249d12cb2b32ca8","sha256:6813827dbba20f5c119ddb6e2cfd30e1e9f1b02dd2e8ff5db66baf6b1f6a2c1f"],"state_sha256":"51d06a35dfe879b96674275fad95bf46cdd67be222a42c322db16da14876894c"}