{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMNESFQZVBOCOYMJUEUTG6DAP6","short_pith_number":"pith:WMNESFQZ","schema_version":"1.0","canonical_sha256":"b31a491619a85c276189a1293378607faa91cc7cb5eef0d983f9867ec562994e","source":{"kind":"arxiv","id":"1802.00703","version":2},"attestation_state":"computed","paper":{"title":"From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Aisling Connolly, Arash Atashpendar, A. W. Roscoe, David Mestel, Marc Beunardeau, Peter Y. A. Ryan, R\\'emi G\\'eraud","submitted_at":"2018-02-02T14:37:15Z","abstract_excerpt":"A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them. In a previous work it is conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by the constant and the alternating strings, respectively. In this work, in addition to revisiting the entropy minimization conjecture, we also "},"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":"1802.00703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-02T14:37:15Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"f65bb151036da781e5d874bba5c54cc1a1a8aaf43ab62a5f11a05f30a7f89a63","abstract_canon_sha256":"6f11408e26d31eb972e58271db23305785b394581b98424157769c680b25dae3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:09.513469Z","signature_b64":"np/4aIJn5ewNqleadPaRcvL4A25kiawu7zeURIB16mveTihmRoxRYhlfrXsq+mpeK1Ajqu8aVYaSKv3hRVCsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31a491619a85c276189a1293378607faa91cc7cb5eef0d983f9867ec562994e","last_reissued_at":"2026-05-17T23:52:09.512896Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:09.512896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Aisling Connolly, Arash Atashpendar, A. W. Roscoe, David Mestel, Marc Beunardeau, Peter Y. A. Ryan, R\\'emi G\\'eraud","submitted_at":"2018-02-02T14:37:15Z","abstract_excerpt":"A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them. In a previous work it is conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by the constant and the alternating strings, respectively. In this work, in addition to revisiting the entropy minimization conjecture, we also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00703","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.00703","created_at":"2026-05-17T23:52:09.512968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00703v2","created_at":"2026-05-17T23:52:09.512968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00703","created_at":"2026-05-17T23:52:09.512968+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMNESFQZVBOC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMNESFQZVBOCOYMJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMNESFQZ","created_at":"2026-05-18T12:33:01.666342+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/WMNESFQZVBOCOYMJUEUTG6DAP6","json":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6.json","graph_json":"https://pith.science/api/pith-number/WMNESFQZVBOCOYMJUEUTG6DAP6/graph.json","events_json":"https://pith.science/api/pith-number/WMNESFQZVBOCOYMJUEUTG6DAP6/events.json","paper":"https://pith.science/paper/WMNESFQZ"},"agent_actions":{"view_html":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6","download_json":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6.json","view_paper":"https://pith.science/paper/WMNESFQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00703&json=true","fetch_graph":"https://pith.science/api/pith-number/WMNESFQZVBOCOYMJUEUTG6DAP6/graph.json","fetch_events":"https://pith.science/api/pith-number/WMNESFQZVBOCOYMJUEUTG6DAP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6/action/storage_attestation","attest_author":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6/action/author_attestation","sign_citation":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6/action/citation_signature","submit_replication":"https://pith.science/pith/WMNESFQZVBOCOYMJUEUTG6DAP6/action/replication_record"}},"created_at":"2026-05-17T23:52:09.512968+00:00","updated_at":"2026-05-17T23:52:09.512968+00:00"}