{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JSGA7JN4OCFDRGIUR6LCI3WGOW","short_pith_number":"pith:JSGA7JN4","canonical_record":{"source":{"id":"1801.03687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T09:41:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36bc5530baeb0400a174239f9d414ed327e16946cd64f2f362966b2a64cd4de3","abstract_canon_sha256":"2b6ebe70bb54eda2dd27bf1d5189a0e64aba2aed62f403b349cf50ebe306e2af"},"schema_version":"1.0"},"canonical_sha256":"4c8c0fa5bc708a3899148f96246ec6759e8739653b04525fdcfde5692083ce29","source":{"kind":"arxiv","id":"1801.03687","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03687","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03687v2","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03687","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"JSGA7JN4OCFD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JSGA7JN4OCFDRGIU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JSGA7JN4","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JSGA7JN4OCFDRGIUR6LCI3WGOW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T09:41:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36bc5530baeb0400a174239f9d414ed327e16946cd64f2f362966b2a64cd4de3","abstract_canon_sha256":"2b6ebe70bb54eda2dd27bf1d5189a0e64aba2aed62f403b349cf50ebe306e2af"},"schema_version":"1.0"},"canonical_sha256":"4c8c0fa5bc708a3899148f96246ec6759e8739653b04525fdcfde5692083ce29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.122437Z","signature_b64":"DyJQZFr5krfmHWQLNMIh5PRM/qi/1edCMLssxD2VAYyduRc2l/vSpx+KFepvYIuxD6WHyZp1CCsAZjziE3UjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c8c0fa5bc708a3899148f96246ec6759e8739653b04525fdcfde5692083ce29","last_reissued_at":"2026-05-17T23:48:02.121795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.121795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03687","source_version":2,"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:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zu71/ZWFz/z3J9J1BIDocKvOrepbUHw9jGnWHlCSSSnllYecHpVbWYtgA9iBaYyHAz+GGJZtyMykUORkgsfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:30:12.453752Z"},"content_sha256":"2112b8c2b1b924f30a097800898b8cdd9c693679447b7d2a5c4ef018bb28034a","schema_version":"1.0","event_id":"sha256:2112b8c2b1b924f30a097800898b8cdd9c693679447b7d2a5c4ef018bb28034a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JSGA7JN4OCFDRGIUR6LCI3WGOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, Yuval Kochman","submitted_at":"2018-01-11T09:41:01Z","abstract_excerpt":"The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is reduced to the problem of determining the reliability function of channel codes designed for detection (in analogy to a similar result which connects the reliability function of distributed lossless compression and ordinary channel codes). Second, a single-letter random-coding bound based on a hierarchical ensemble, as well as a single-letter expurgated bound, are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03687","kind":"arxiv","version":2},"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:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E840XIo2jirZPjeQG+bmnmtMqpe8g/TTy3kqnOHyhVmR2CHB3Jhcb4g5W/+FJ2unUMYPXJN0Px4lbEcIY951DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:30:12.454098Z"},"content_sha256":"3300c25fbc388d7d9d97356aaef89468d2216f15285b8700d87fa12ea7430998","schema_version":"1.0","event_id":"sha256:3300c25fbc388d7d9d97356aaef89468d2216f15285b8700d87fa12ea7430998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/bundle.json","state_url":"https://pith.science/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/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-01T15:30:12Z","links":{"resolver":"https://pith.science/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW","bundle":"https://pith.science/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/bundle.json","state":"https://pith.science/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSGA7JN4OCFDRGIUR6LCI3WGOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JSGA7JN4OCFDRGIUR6LCI3WGOW","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":"2b6ebe70bb54eda2dd27bf1d5189a0e64aba2aed62f403b349cf50ebe306e2af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T09:41:01Z","title_canon_sha256":"36bc5530baeb0400a174239f9d414ed327e16946cd64f2f362966b2a64cd4de3"},"schema_version":"1.0","source":{"id":"1801.03687","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03687","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03687v2","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03687","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"JSGA7JN4OCFD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JSGA7JN4OCFDRGIU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JSGA7JN4","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:3300c25fbc388d7d9d97356aaef89468d2216f15285b8700d87fa12ea7430998","target":"graph","created_at":"2026-05-17T23:48:02Z","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 distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is reduced to the problem of determining the reliability function of channel codes designed for detection (in analogy to a similar result which connects the reliability function of distributed lossless compression and ordinary channel codes). Second, a single-letter random-coding bound based on a hierarchical ensemble, as well as a single-letter expurgated bound, are","authors_text":"Nir Weinberger, Yuval Kochman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T09:41:01Z","title":"On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03687","kind":"arxiv","version":2},"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:2112b8c2b1b924f30a097800898b8cdd9c693679447b7d2a5c4ef018bb28034a","target":"record","created_at":"2026-05-17T23:48:02Z","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":"2b6ebe70bb54eda2dd27bf1d5189a0e64aba2aed62f403b349cf50ebe306e2af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T09:41:01Z","title_canon_sha256":"36bc5530baeb0400a174239f9d414ed327e16946cd64f2f362966b2a64cd4de3"},"schema_version":"1.0","source":{"id":"1801.03687","kind":"arxiv","version":2}},"canonical_sha256":"4c8c0fa5bc708a3899148f96246ec6759e8739653b04525fdcfde5692083ce29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c8c0fa5bc708a3899148f96246ec6759e8739653b04525fdcfde5692083ce29","first_computed_at":"2026-05-17T23:48:02.121795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:02.121795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DyJQZFr5krfmHWQLNMIh5PRM/qi/1edCMLssxD2VAYyduRc2l/vSpx+KFepvYIuxD6WHyZp1CCsAZjziE3UjDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:02.122437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03687","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2112b8c2b1b924f30a097800898b8cdd9c693679447b7d2a5c4ef018bb28034a","sha256:3300c25fbc388d7d9d97356aaef89468d2216f15285b8700d87fa12ea7430998"],"state_sha256":"2879a6892a87b6ecac005fc25bba1ca37c8ced25cbc26862d8871c4645990c35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLCYGKMfD7T768EUd0i8yY0l7cJbVVguGvl3hxZPucUG7ZgpAbi1hMUZlVavpKslIkQx4xLDr2Bl1+QPnUNuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:30:12.456091Z","bundle_sha256":"8e3253f3fbbf08a896c4daa9768319b9f747b0247c7419e2ad3b9438301e3240"}}