{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HHJ7GLWMOFHB7S5FP4V6QZWUGM","short_pith_number":"pith:HHJ7GLWM","schema_version":"1.0","canonical_sha256":"39d3f32ecc714e1fcba57f2be866d433064d2a9564bbc1ea1b93ed61f3ee26d3","source":{"kind":"arxiv","id":"1108.5212","version":1},"attestation_state":"computed","paper":{"title":"Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski","submitted_at":"2011-08-25T22:25:48Z","abstract_excerpt":"We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting interleaved process, but no knowledge of the number or structure of the component Markov processes, or of the switch. We study conditions for uniqueness of the interleaved representation of a process, showing that certain switch configurations, as well as memoryless component processes, can cause ambiguities in the representation. We show that a deinterleaving sc"},"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":"1108.5212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T22:25:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bf6292f6d5749c0df0ab7b368b38d182413b34a2dd1b38cfbe8063c6b88f127","abstract_canon_sha256":"b7b74b79b431d354ef836fe54369fce939f37868d8885b04dd04f6758d244033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:38.736553Z","signature_b64":"hYp+K1AnVl4hPK+hoKNLKXrvrsVerQ4IQ7ypIjHQ4xGg8T7ItyLcGa15wASWaQXD9Hmg/3htJRdBBxUpEjviDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d3f32ecc714e1fcba57f2be866d433064d2a9564bbc1ea1b93ed61f3ee26d3","last_reissued_at":"2026-05-18T04:14:38.736170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:38.736170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski","submitted_at":"2011-08-25T22:25:48Z","abstract_excerpt":"We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting interleaved process, but no knowledge of the number or structure of the component Markov processes, or of the switch. We study conditions for uniqueness of the interleaved representation of a process, showing that certain switch configurations, as well as memoryless component processes, can cause ambiguities in the representation. We show that a deinterleaving sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5212","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":"1108.5212","created_at":"2026-05-18T04:14:38.736225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5212v1","created_at":"2026-05-18T04:14:38.736225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5212","created_at":"2026-05-18T04:14:38.736225+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHJ7GLWMOFHB","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHJ7GLWMOFHB7S5F","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHJ7GLWM","created_at":"2026-05-18T12:26:30.835961+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/HHJ7GLWMOFHB7S5FP4V6QZWUGM","json":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM.json","graph_json":"https://pith.science/api/pith-number/HHJ7GLWMOFHB7S5FP4V6QZWUGM/graph.json","events_json":"https://pith.science/api/pith-number/HHJ7GLWMOFHB7S5FP4V6QZWUGM/events.json","paper":"https://pith.science/paper/HHJ7GLWM"},"agent_actions":{"view_html":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM","download_json":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM.json","view_paper":"https://pith.science/paper/HHJ7GLWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5212&json=true","fetch_graph":"https://pith.science/api/pith-number/HHJ7GLWMOFHB7S5FP4V6QZWUGM/graph.json","fetch_events":"https://pith.science/api/pith-number/HHJ7GLWMOFHB7S5FP4V6QZWUGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM/action/storage_attestation","attest_author":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM/action/author_attestation","sign_citation":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM/action/citation_signature","submit_replication":"https://pith.science/pith/HHJ7GLWMOFHB7S5FP4V6QZWUGM/action/replication_record"}},"created_at":"2026-05-18T04:14:38.736225+00:00","updated_at":"2026-05-18T04:14:38.736225+00:00"}