{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RAQRJVXJQJJI5L4BRLLPJOT6EE","short_pith_number":"pith:RAQRJVXJ","canonical_record":{"source":{"id":"1810.07281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-16T21:19:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"679d19668f4c8595643c8aaf3aecd698a9364a4f3b8cfc66fbcfe51c80ba1e41","abstract_canon_sha256":"6ff1f85dfc4634149430e27aeffbfa6ccd4c7640f2515942719bb02b24db9ffb"},"schema_version":"1.0"},"canonical_sha256":"882114d6e982528eaf818ad6f4ba7e213d3f9698d5111f8b8e97247fbacbfc7c","source":{"kind":"arxiv","id":"1810.07281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07281","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07281v2","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07281","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAQRJVXJQJJI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RAQRJVXJQJJI5L4B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RAQRJVXJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RAQRJVXJQJJI5L4BRLLPJOT6EE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-16T21:19:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"679d19668f4c8595643c8aaf3aecd698a9364a4f3b8cfc66fbcfe51c80ba1e41","abstract_canon_sha256":"6ff1f85dfc4634149430e27aeffbfa6ccd4c7640f2515942719bb02b24db9ffb"},"schema_version":"1.0"},"canonical_sha256":"882114d6e982528eaf818ad6f4ba7e213d3f9698d5111f8b8e97247fbacbfc7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:29.960535Z","signature_b64":"OFouqt4QsOLwo07RSFEE1gmyqFkKMjLPv08spHQdSvGXnq8PZ8vUQIVPTXjVNWWktg2EcyJUHDHbr6THh8/MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882114d6e982528eaf818ad6f4ba7e213d3f9698d5111f8b8e97247fbacbfc7c","last_reissued_at":"2026-05-17T23:47:29.959914Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:29.959914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07281","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkOLuusaflumpdaXNYWYAnYuYnfdGGxNyqFgKbMsNwd5IrwUU0hr0vHR7gVbiGlDexsF3ZS871VqxkGnHHvoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:28:04.976199Z"},"content_sha256":"31af7a71a0fdc14f0480a6db9150380640781d3938968635a0c520131522a9b8","schema_version":"1.0","event_id":"sha256:31af7a71a0fdc14f0480a6db9150380640781d3938968635a0c520131522a9b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RAQRJVXJQJJI5L4BRLLPJOT6EE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Decoding of Deletions Using Guess & Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Salim El Rouayheb, Serge Kas Hanna","submitted_at":"2018-10-16T21:19:21Z","abstract_excerpt":"Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message $k$, and the encoding and decoding algorithms of these codes are deterministic and run in polynomial time for a constant number of deletions $\\delta$. The unique decoding properties of GC codes were examined in a previous work by the authors. In this paper, we investigate the list decoding performance of these codes. Namely, we study the average size and the maximum size of the list obtained by a GC decoder for a cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07281","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VD8z0Pc7Goy2RH/nkQXEDSxOEuYJac07xyQhcS17Km01x1LBaiowj9OSXgV2Gk6VjB2/38bQ3mtl2B78UzXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:28:04.976570Z"},"content_sha256":"38845b71af99133ac83f7ed8e662dd5db96db2311f98b425970aa025e99e1097","schema_version":"1.0","event_id":"sha256:38845b71af99133ac83f7ed8e662dd5db96db2311f98b425970aa025e99e1097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/bundle.json","state_url":"https://pith.science/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:28:04Z","links":{"resolver":"https://pith.science/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE","bundle":"https://pith.science/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/bundle.json","state":"https://pith.science/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAQRJVXJQJJI5L4BRLLPJOT6EE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RAQRJVXJQJJI5L4BRLLPJOT6EE","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":"6ff1f85dfc4634149430e27aeffbfa6ccd4c7640f2515942719bb02b24db9ffb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-16T21:19:21Z","title_canon_sha256":"679d19668f4c8595643c8aaf3aecd698a9364a4f3b8cfc66fbcfe51c80ba1e41"},"schema_version":"1.0","source":{"id":"1810.07281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07281","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07281v2","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07281","created_at":"2026-05-17T23:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAQRJVXJQJJI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RAQRJVXJQJJI5L4B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RAQRJVXJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:38845b71af99133ac83f7ed8e662dd5db96db2311f98b425970aa025e99e1097","target":"graph","created_at":"2026-05-17T23:47:29Z","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":"Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message $k$, and the encoding and decoding algorithms of these codes are deterministic and run in polynomial time for a constant number of deletions $\\delta$. The unique decoding properties of GC codes were examined in a previous work by the authors. In this paper, we investigate the list decoding performance of these codes. Namely, we study the average size and the maximum size of the list obtained by a GC decoder for a cons","authors_text":"Salim El Rouayheb, Serge Kas Hanna","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-16T21:19:21Z","title":"List Decoding of Deletions Using Guess & Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07281","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:31af7a71a0fdc14f0480a6db9150380640781d3938968635a0c520131522a9b8","target":"record","created_at":"2026-05-17T23:47:29Z","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":"6ff1f85dfc4634149430e27aeffbfa6ccd4c7640f2515942719bb02b24db9ffb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-16T21:19:21Z","title_canon_sha256":"679d19668f4c8595643c8aaf3aecd698a9364a4f3b8cfc66fbcfe51c80ba1e41"},"schema_version":"1.0","source":{"id":"1810.07281","kind":"arxiv","version":2}},"canonical_sha256":"882114d6e982528eaf818ad6f4ba7e213d3f9698d5111f8b8e97247fbacbfc7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882114d6e982528eaf818ad6f4ba7e213d3f9698d5111f8b8e97247fbacbfc7c","first_computed_at":"2026-05-17T23:47:29.959914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:29.959914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFouqt4QsOLwo07RSFEE1gmyqFkKMjLPv08spHQdSvGXnq8PZ8vUQIVPTXjVNWWktg2EcyJUHDHbr6THh8/MDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:29.960535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31af7a71a0fdc14f0480a6db9150380640781d3938968635a0c520131522a9b8","sha256:38845b71af99133ac83f7ed8e662dd5db96db2311f98b425970aa025e99e1097"],"state_sha256":"c31b2acedc4a8b34a10660f6e83dbc8cc5cb01a1ac6936bbbe1da5a088d8a8fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7djNgAYymf9m+w4/VJmhzehaaKO6kF19L7Zy8inqyw8mIRELWszIOf2aJlxbtdHZYK4VvpCPb42830dIB45Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:28:04.978551Z","bundle_sha256":"f547ee4c062aac1b82f7f8b41a5935ee6841949c0c855be9b433d14abc34ef69"}}