{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KTWQUCUBNA5YD2Y35ZKDX4XPLL","short_pith_number":"pith:KTWQUCUB","schema_version":"1.0","canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","source":{"kind":"arxiv","id":"1412.2543","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jayakrishnan Unnikrishnan","submitted_at":"2014-12-08T12:47:57Z","abstract_excerpt":"Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the constraint that the observed sequences are produced by distinct sources. In general, the number of sequences $N$ may be different from the number of sources $M$, and only some $K \\leq \\min\\{M,N\\}$ of the observed sequences may be produced by a source from the set of sources of interest. We consider two versions of the problem -- one in which the probability law"},"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":"1412.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T12:47:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b03038b8e54dea017825fe998929ccbf930b543b39baff32459ac7e494d9fe5c","abstract_canon_sha256":"77903e9d5b80f14237e010fdd0e4281e3d2920081fa62c780c566a73d8b64cb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:57.634849Z","signature_b64":"MytA5gUz2QQM4i1/w6SsWSEBj6+YSZb9sZbTkVUuZSO3F0axeAYG4bltUoNXGN0HpSbDTZQOj2ZfmD/HsNpyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","last_reissued_at":"2026-05-18T02:31:57.634085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:57.634085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jayakrishnan Unnikrishnan","submitted_at":"2014-12-08T12:47:57Z","abstract_excerpt":"Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the constraint that the observed sequences are produced by distinct sources. In general, the number of sequences $N$ may be different from the number of sources $M$, and only some $K \\leq \\min\\{M,N\\}$ of the observed sequences may be produced by a source from the set of sources of interest. We consider two versions of the problem -- one in which the probability law"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2543","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":"1412.2543","created_at":"2026-05-18T02:31:57.634219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2543v1","created_at":"2026-05-18T02:31:57.634219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2543","created_at":"2026-05-18T02:31:57.634219+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTWQUCUBNA5Y","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTWQUCUBNA5YD2Y3","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTWQUCUB","created_at":"2026-05-18T12:28:35.611951+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/KTWQUCUBNA5YD2Y35ZKDX4XPLL","json":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL.json","graph_json":"https://pith.science/api/pith-number/KTWQUCUBNA5YD2Y35ZKDX4XPLL/graph.json","events_json":"https://pith.science/api/pith-number/KTWQUCUBNA5YD2Y35ZKDX4XPLL/events.json","paper":"https://pith.science/paper/KTWQUCUB"},"agent_actions":{"view_html":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL","download_json":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL.json","view_paper":"https://pith.science/paper/KTWQUCUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2543&json=true","fetch_graph":"https://pith.science/api/pith-number/KTWQUCUBNA5YD2Y35ZKDX4XPLL/graph.json","fetch_events":"https://pith.science/api/pith-number/KTWQUCUBNA5YD2Y35ZKDX4XPLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/action/storage_attestation","attest_author":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/action/author_attestation","sign_citation":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/action/citation_signature","submit_replication":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/action/replication_record"}},"created_at":"2026-05-18T02:31:57.634219+00:00","updated_at":"2026-05-18T02:31:57.634219+00:00"}