{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3YXVGEJIFW4PUGJSARUXAYZQWG","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":"6adaaaf864ea52554219328d081f5e8cf264c6bb8793e5eb113d51c9a1cbd7d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-18T08:13:43Z","title_canon_sha256":"dc311529086942df8128a69a7da7b0e3ffc0fa708d219b87b23e2b0c8c203ab4"},"schema_version":"1.0","source":{"id":"1310.4939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4939","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4939v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4939","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"3YXVGEJIFW4P","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3YXVGEJIFW4PUGJS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3YXVGEJI","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:3a5b13398abf3b6e529e53548ac4c322d75d43c8d8a46625bea67c915e3e4863","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"The problem of joint detection and lossless source coding is considered. We derive asymptotically optimal decision rules for deciding whether or not a sequence of observations has emerged from a desired information source, and to compress it if has. In particular, our decision rules asymptotically minimize the cost of compression in the case that the data has been classified as `desirable', subject to given constraints on the two kinds of the probability of error. In another version of this performance criterion, the constraint on the false alarm probability is replaced by the a constraint on ","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-18T08:13:43Z","title":"Asymptotically optimal decision rules for joint detection and source coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4939","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:092407c55edaa01435bb36c79ffd506370150a79a0811d803a4caf0ad9b9bd22","target":"record","created_at":"2026-05-18T00:58:41Z","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":"6adaaaf864ea52554219328d081f5e8cf264c6bb8793e5eb113d51c9a1cbd7d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-18T08:13:43Z","title_canon_sha256":"dc311529086942df8128a69a7da7b0e3ffc0fa708d219b87b23e2b0c8c203ab4"},"schema_version":"1.0","source":{"id":"1310.4939","kind":"arxiv","version":1}},"canonical_sha256":"de2f5311282db8fa19320469706330b180fa6403266589749e39d52aaa8a49bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de2f5311282db8fa19320469706330b180fa6403266589749e39d52aaa8a49bd","first_computed_at":"2026-05-18T00:58:41.912393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.912393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+YzDpZqIA2ID/nhHs6mdVjhBKXi13tlse1ts4mA2Og7CWLCr7A+dikjt+L8+7RBlaXa3vmv0hrpK6pWuJr0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.913072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:092407c55edaa01435bb36c79ffd506370150a79a0811d803a4caf0ad9b9bd22","sha256:3a5b13398abf3b6e529e53548ac4c322d75d43c8d8a46625bea67c915e3e4863"],"state_sha256":"d89af2cd3143893f62800234f8702b3d97fd1ecb95196616f3ea3d8c94552d70"}