{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KTWQUCUBNA5YD2Y35ZKDX4XPLL","short_pith_number":"pith:KTWQUCUB","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"},"canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","source":{"kind":"arxiv","id":"1412.2543","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2543","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2543v1","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2543","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"pith_short_12","alias_value":"KTWQUCUBNA5Y","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KTWQUCUBNA5YD2Y3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KTWQUCUB","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KTWQUCUBNA5YD2Y35ZKDX4XPLL","target":"record","payload":{"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"},"canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","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"},"source_kind":"arxiv","source_id":"1412.2543","source_version":1,"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-18T02:31:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDKDEa/ayPlPRtmjKYI/Syd1vvgNBN/aU1zCy1ogbccjUYHb7GA/E78UN8ffZy//WhdurWOPgHvaYPbDH0ynBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:40:04.128350Z"},"content_sha256":"764c8777b529f09b20a258778b9c9cfa083bd065d0f2d915a3266911ea88dbc7","schema_version":"1.0","event_id":"sha256:764c8777b529f09b20a258778b9c9cfa083bd065d0f2d915a3266911ea88dbc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KTWQUCUBNA5YD2Y35ZKDX4XPLL","target":"graph","payload":{"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"},"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-18T02:31:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwzTburte6NySoIGmiory9VMpmptFJ0/YVsSuaK0J3dipxiWlxwNg9AyMg6+6GqeSXMPqHyYdYihS8mv+hi5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:40:04.129128Z"},"content_sha256":"48bad5508c55aa09f35ecc01f46a363c7f879ec2736440d48abc2984d00daeda","schema_version":"1.0","event_id":"sha256:48bad5508c55aa09f35ecc01f46a363c7f879ec2736440d48abc2984d00daeda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/bundle.json","state_url":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/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-01T01:40:04Z","links":{"resolver":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL","bundle":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/bundle.json","state":"https://pith.science/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTWQUCUBNA5YD2Y35ZKDX4XPLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KTWQUCUBNA5YD2Y35ZKDX4XPLL","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":"77903e9d5b80f14237e010fdd0e4281e3d2920081fa62c780c566a73d8b64cb2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T12:47:57Z","title_canon_sha256":"b03038b8e54dea017825fe998929ccbf930b543b39baff32459ac7e494d9fe5c"},"schema_version":"1.0","source":{"id":"1412.2543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2543","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2543v1","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2543","created_at":"2026-05-18T02:31:57Z"},{"alias_kind":"pith_short_12","alias_value":"KTWQUCUBNA5Y","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KTWQUCUBNA5YD2Y3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KTWQUCUB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:48bad5508c55aa09f35ecc01f46a363c7f879ec2736440d48abc2984d00daeda","target":"graph","created_at":"2026-05-18T02:31:57Z","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":"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","authors_text":"Jayakrishnan Unnikrishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T12:47:57Z","title":"Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2543","kind":"arxiv","version":1},"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:764c8777b529f09b20a258778b9c9cfa083bd065d0f2d915a3266911ea88dbc7","target":"record","created_at":"2026-05-18T02:31:57Z","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":"77903e9d5b80f14237e010fdd0e4281e3d2920081fa62c780c566a73d8b64cb2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T12:47:57Z","title_canon_sha256":"b03038b8e54dea017825fe998929ccbf930b543b39baff32459ac7e494d9fe5c"},"schema_version":"1.0","source":{"id":"1412.2543","kind":"arxiv","version":1}},"canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ed0a0a81683b81eb1bee543bf2ef5ae9310bb9fe7793ef72e1613393eecce8","first_computed_at":"2026-05-18T02:31:57.634085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:57.634085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MytA5gUz2QQM4i1/w6SsWSEBj6+YSZb9sZbTkVUuZSO3F0axeAYG4bltUoNXGN0HpSbDTZQOj2ZfmD/HsNpyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:57.634849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:764c8777b529f09b20a258778b9c9cfa083bd065d0f2d915a3266911ea88dbc7","sha256:48bad5508c55aa09f35ecc01f46a363c7f879ec2736440d48abc2984d00daeda"],"state_sha256":"8127001184686cd312b7dfe3fa34590d367dd6c7d22b351a11d5cb602c1aac53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LPowjk7U+WMHwbt4po2Bs/JhJ1rtjwpE2KA9sdzRuTBU79qH7MdgPd9zDM4DtMT4XJMNq8PUifd5RNcNUvNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:40:04.133824Z","bundle_sha256":"66b1e1f17fd654b5e77a78a34ca22380bb5f5d4c262baba740f4e2f50fbb284f"}}