{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CQ2YVSZJ6RT5CW7PLJPZF52MDT","short_pith_number":"pith:CQ2YVSZJ","schema_version":"1.0","canonical_sha256":"14358acb29f467d15bef5a5f92f74c1cd5eb7f1d0a45d8825342c2d6fca315b1","source":{"kind":"arxiv","id":"0905.4517","version":1},"attestation_state":"computed","paper":{"title":"Omnibus Sequences, Coupon Collection, and Missing Word Counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anant P. Godbole, Greg Brockman, Stephanie Sapp, Sunil Abraham","submitted_at":"2009-05-27T20:55:21Z","abstract_excerpt":"An {\\it Omnibus Sequence} of length $n$ is one that has each possible \"message\" of length $k$ embedded in it as a subsequence. We study various properties of Omnibus Sequences in this paper, making connections, whenever possible, to the classical coupon collector problem."},"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":"0905.4517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-27T20:55:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6002da06fc237ce2b81a3d9dc5ea0309f7a04f8c4e149a8025e2b91e92f9d0c7","abstract_canon_sha256":"9efd6026ceaed75aedd3c112784363a5ef24bdcbe18095f6b170ec4dc2b47dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.170520Z","signature_b64":"7LuJo7E6VabOTd3gJwNQ+28pCkwSLJJV3/C3SEsOJEAAEcN87xbjU8Sgb2jCmCdj043swp/5w2Xhi5sGsK2XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14358acb29f467d15bef5a5f92f74c1cd5eb7f1d0a45d8825342c2d6fca315b1","last_reissued_at":"2026-05-18T03:58:05.169966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.169966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Omnibus Sequences, Coupon Collection, and Missing Word Counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anant P. Godbole, Greg Brockman, Stephanie Sapp, Sunil Abraham","submitted_at":"2009-05-27T20:55:21Z","abstract_excerpt":"An {\\it Omnibus Sequence} of length $n$ is one that has each possible \"message\" of length $k$ embedded in it as a subsequence. We study various properties of Omnibus Sequences in this paper, making connections, whenever possible, to the classical coupon collector problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4517","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":"0905.4517","created_at":"2026-05-18T03:58:05.170041+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.4517v1","created_at":"2026-05-18T03:58:05.170041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4517","created_at":"2026-05-18T03:58:05.170041+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ2YVSZJ6RT5","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ2YVSZJ6RT5CW7P","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ2YVSZJ","created_at":"2026-05-18T12:25:59.703012+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/CQ2YVSZJ6RT5CW7PLJPZF52MDT","json":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT.json","graph_json":"https://pith.science/api/pith-number/CQ2YVSZJ6RT5CW7PLJPZF52MDT/graph.json","events_json":"https://pith.science/api/pith-number/CQ2YVSZJ6RT5CW7PLJPZF52MDT/events.json","paper":"https://pith.science/paper/CQ2YVSZJ"},"agent_actions":{"view_html":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT","download_json":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT.json","view_paper":"https://pith.science/paper/CQ2YVSZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.4517&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ2YVSZJ6RT5CW7PLJPZF52MDT/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ2YVSZJ6RT5CW7PLJPZF52MDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT/action/storage_attestation","attest_author":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT/action/author_attestation","sign_citation":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT/action/citation_signature","submit_replication":"https://pith.science/pith/CQ2YVSZJ6RT5CW7PLJPZF52MDT/action/replication_record"}},"created_at":"2026-05-18T03:58:05.170041+00:00","updated_at":"2026-05-18T03:58:05.170041+00:00"}