{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6AAUU3ZV46A2M645VRQOSYFQX2","short_pith_number":"pith:6AAUU3ZV","canonical_record":{"source":{"id":"1811.07307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-18T10:16:23Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"27e18930ef9ddbc162dd32d0f9e192ba3a7c5c7f5842d04af63f5534da2805a7","abstract_canon_sha256":"8a00d80ddfd2ca0f41cdade64cae62aa03454ce289a813f8b1f0690f2efc9273"},"schema_version":"1.0"},"canonical_sha256":"f0014a6f35e781a67b9dac60e960b0bea6015968b5345638aac67565c32962fa","source":{"kind":"arxiv","id":"1811.07307","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07307","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07307v3","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07307","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"6AAUU3ZV46A2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AAUU3ZV46A2M645","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AAUU3ZV","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6AAUU3ZV46A2M645VRQOSYFQX2","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-18T10:16:23Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"27e18930ef9ddbc162dd32d0f9e192ba3a7c5c7f5842d04af63f5534da2805a7","abstract_canon_sha256":"8a00d80ddfd2ca0f41cdade64cae62aa03454ce289a813f8b1f0690f2efc9273"},"schema_version":"1.0"},"canonical_sha256":"f0014a6f35e781a67b9dac60e960b0bea6015968b5345638aac67565c32962fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:48.263096Z","signature_b64":"WvCceAfygvsGY7tNNZE9dBHL8Vm4RhAmI6kpbGvaICgCFhHpLtJZYv5JqUZcjwSODq1u62LEosOwGan/H563BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0014a6f35e781a67b9dac60e960b0bea6015968b5345638aac67565c32962fa","last_reissued_at":"2026-05-17T23:59:48.262629Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:48.262629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07307","source_version":3,"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-17T23:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leliubRg7RZmHj794JY3lrvQZF8PSPqXrv8t8jPGUWSNm7PyRjdacM8CJ4GiHcRlE6PVNixdlnLE9hU/qWLgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:04:20.288790Z"},"content_sha256":"e2456cf10b3cb1b793be5741130b74402ebf09b1c39067a4d0fc669896989ade","schema_version":"1.0","event_id":"sha256:e2456cf10b3cb1b793be5741130b74402ebf09b1c39067a4d0fc669896989ade"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6AAUU3ZV46A2M645VRQOSYFQX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theoretic Bounds on Optimal Worst-case Error in Binary Mixture Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Khashayar Gatmiry, Seyed Abolfazl Motahari","submitted_at":"2018-11-18T10:16:23Z","abstract_excerpt":"Identification of latent binary sequences from a pool of noisy observations has a wide range of applications in both statistical learning and population genetics. Each observed sequence is the result of passing one of the latent mother-sequences through a binary symmetric channel, which makes this configuration analogous to a special case of Bernoulli Mixture Models. This paper aims to attain an asymptotically tight upper-bound on the error of Maximum Likelihood mixture identification in such problems. The obtained results demonstrate fundamental guarantees on the inference accuracy of the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07307","kind":"arxiv","version":3},"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-17T23:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qmzvAzcq4Qd1M/GU0qtvn48eS7ZJqEgcaataKHSpUS9WCNxCfsv0inr1UvrZd+aDfSU1qPPQMiqMBP/OAa0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:04:20.289431Z"},"content_sha256":"1b4649dd0a63cc0d13e89568fdba765e121a085b81d75d2175e2a237f0b0dd5d","schema_version":"1.0","event_id":"sha256:1b4649dd0a63cc0d13e89568fdba765e121a085b81d75d2175e2a237f0b0dd5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AAUU3ZV46A2M645VRQOSYFQX2/bundle.json","state_url":"https://pith.science/pith/6AAUU3ZV46A2M645VRQOSYFQX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AAUU3ZV46A2M645VRQOSYFQX2/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-05T19:04:20Z","links":{"resolver":"https://pith.science/pith/6AAUU3ZV46A2M645VRQOSYFQX2","bundle":"https://pith.science/pith/6AAUU3ZV46A2M645VRQOSYFQX2/bundle.json","state":"https://pith.science/pith/6AAUU3ZV46A2M645VRQOSYFQX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AAUU3ZV46A2M645VRQOSYFQX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6AAUU3ZV46A2M645VRQOSYFQX2","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":"8a00d80ddfd2ca0f41cdade64cae62aa03454ce289a813f8b1f0690f2efc9273","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-18T10:16:23Z","title_canon_sha256":"27e18930ef9ddbc162dd32d0f9e192ba3a7c5c7f5842d04af63f5534da2805a7"},"schema_version":"1.0","source":{"id":"1811.07307","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07307","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07307v3","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07307","created_at":"2026-05-17T23:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"6AAUU3ZV46A2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AAUU3ZV46A2M645","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AAUU3ZV","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:1b4649dd0a63cc0d13e89568fdba765e121a085b81d75d2175e2a237f0b0dd5d","target":"graph","created_at":"2026-05-17T23:59:48Z","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":"Identification of latent binary sequences from a pool of noisy observations has a wide range of applications in both statistical learning and population genetics. Each observed sequence is the result of passing one of the latent mother-sequences through a binary symmetric channel, which makes this configuration analogous to a special case of Bernoulli Mixture Models. This paper aims to attain an asymptotically tight upper-bound on the error of Maximum Likelihood mixture identification in such problems. The obtained results demonstrate fundamental guarantees on the inference accuracy of the opt","authors_text":"Khashayar Gatmiry, Seyed Abolfazl Motahari","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-18T10:16:23Z","title":"Information Theoretic Bounds on Optimal Worst-case Error in Binary Mixture Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07307","kind":"arxiv","version":3},"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:e2456cf10b3cb1b793be5741130b74402ebf09b1c39067a4d0fc669896989ade","target":"record","created_at":"2026-05-17T23:59:48Z","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":"8a00d80ddfd2ca0f41cdade64cae62aa03454ce289a813f8b1f0690f2efc9273","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-11-18T10:16:23Z","title_canon_sha256":"27e18930ef9ddbc162dd32d0f9e192ba3a7c5c7f5842d04af63f5534da2805a7"},"schema_version":"1.0","source":{"id":"1811.07307","kind":"arxiv","version":3}},"canonical_sha256":"f0014a6f35e781a67b9dac60e960b0bea6015968b5345638aac67565c32962fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0014a6f35e781a67b9dac60e960b0bea6015968b5345638aac67565c32962fa","first_computed_at":"2026-05-17T23:59:48.262629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:48.262629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvCceAfygvsGY7tNNZE9dBHL8Vm4RhAmI6kpbGvaICgCFhHpLtJZYv5JqUZcjwSODq1u62LEosOwGan/H563BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:48.263096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07307","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2456cf10b3cb1b793be5741130b74402ebf09b1c39067a4d0fc669896989ade","sha256:1b4649dd0a63cc0d13e89568fdba765e121a085b81d75d2175e2a237f0b0dd5d"],"state_sha256":"0534b86f6acc3069b006fc6b051d5ea24a3cb6be590e01d3c03eb5762f0d705e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4STchu8cs8yFpQ9E1wllHg1xNCsmxtnJ6ltm+fX8VJliUemZNImS7uwULFqagI3ZSbCzEydEYPVu4RXVOFYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:04:20.292887Z","bundle_sha256":"df1f05163f53449b0dc6bea461b859c80d9d9da41d8453ce5d41440b8aff1aac"}}