{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U4FDCVXPROSTUA2SMPOSIZNOO3","short_pith_number":"pith:U4FDCVXP","schema_version":"1.0","canonical_sha256":"a70a3156ef8ba53a035263dd2465ae76cd41c39e9f4e4d597f51ac5195c494b1","source":{"kind":"arxiv","id":"1807.11609","version":1},"attestation_state":"computed","paper":{"title":"A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Atashpendar, A. W. Roscoe, David Mestel, Peter Y. A. Ryan","submitted_at":"2018-07-30T23:49:17Z","abstract_excerpt":"From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the uniform prior measures the amount of information about the channel input which is conveyed by the output of length $m$, and it is natural to ask for which outputs this is extremized. This question was posed in a previous work, where it was conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by th"},"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":"1807.11609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-30T23:49:17Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"75863ff9e98edb8a6072aeac98e951667ca9c2488d24651d9f0917f67a162201","abstract_canon_sha256":"9798950cc01402a732ae2b925a300a42aa975fd51641ac70d27eba539d5ca445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.621505Z","signature_b64":"jBzsgh54nGNp6CBLwrga1p+9oPpUggBJgQamED/KaoH4STU1D2XdgGQK4fVsW/DsN61uvsn9uEZn2oARE2QEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70a3156ef8ba53a035263dd2465ae76cd41c39e9f4e4d597f51ac5195c494b1","last_reissued_at":"2026-05-18T00:09:21.621029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.621029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Atashpendar, A. W. Roscoe, David Mestel, Peter Y. A. Ryan","submitted_at":"2018-07-30T23:49:17Z","abstract_excerpt":"From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the uniform prior measures the amount of information about the channel input which is conveyed by the output of length $m$, and it is natural to ask for which outputs this is extremized. This question was posed in a previous work, where it was conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11609","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":"1807.11609","created_at":"2026-05-18T00:09:21.621104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11609v1","created_at":"2026-05-18T00:09:21.621104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11609","created_at":"2026-05-18T00:09:21.621104+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4FDCVXPROST","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4FDCVXPROSTUA2S","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4FDCVXP","created_at":"2026-05-18T12:32:56.356000+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/U4FDCVXPROSTUA2SMPOSIZNOO3","json":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3.json","graph_json":"https://pith.science/api/pith-number/U4FDCVXPROSTUA2SMPOSIZNOO3/graph.json","events_json":"https://pith.science/api/pith-number/U4FDCVXPROSTUA2SMPOSIZNOO3/events.json","paper":"https://pith.science/paper/U4FDCVXP"},"agent_actions":{"view_html":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3","download_json":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3.json","view_paper":"https://pith.science/paper/U4FDCVXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11609&json=true","fetch_graph":"https://pith.science/api/pith-number/U4FDCVXPROSTUA2SMPOSIZNOO3/graph.json","fetch_events":"https://pith.science/api/pith-number/U4FDCVXPROSTUA2SMPOSIZNOO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3/action/storage_attestation","attest_author":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3/action/author_attestation","sign_citation":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3/action/citation_signature","submit_replication":"https://pith.science/pith/U4FDCVXPROSTUA2SMPOSIZNOO3/action/replication_record"}},"created_at":"2026-05-18T00:09:21.621104+00:00","updated_at":"2026-05-18T00:09:21.621104+00:00"}