{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A56BKZGOGIZBLU4SK5JVVBTT4L","short_pith_number":"pith:A56BKZGO","canonical_record":{"source":{"id":"1410.2881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T19:49:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd2af65fbfc53b22681788662b310d1de93b7ae0fcace1b30d3547f2e2a5134e","abstract_canon_sha256":"b0fa99008ff9f2bb666a02c7bca3e62a964e3c790f3bfa11cef5f85cfc64ae78"},"schema_version":"1.0"},"canonical_sha256":"077c1564ce323215d39257535a8673e2df6e4da85a4a2878bb6302f4e6b79758","source":{"kind":"arxiv","id":"1410.2881","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2881","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2881v2","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2881","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"A56BKZGOGIZB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A56BKZGOGIZBLU4S","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A56BKZGO","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A56BKZGOGIZBLU4SK5JVVBTT4L","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T19:49:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd2af65fbfc53b22681788662b310d1de93b7ae0fcace1b30d3547f2e2a5134e","abstract_canon_sha256":"b0fa99008ff9f2bb666a02c7bca3e62a964e3c790f3bfa11cef5f85cfc64ae78"},"schema_version":"1.0"},"canonical_sha256":"077c1564ce323215d39257535a8673e2df6e4da85a4a2878bb6302f4e6b79758","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.893097Z","signature_b64":"OaFoLui1+p6U+wIQKLz4IlVNk1PePj4gcoqVKAhtarxyfPmWMI/8xHNcmgn5yietNgNgbeLe3/ofsc6oLK8AAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077c1564ce323215d39257535a8673e2df6e4da85a4a2878bb6302f4e6b79758","last_reissued_at":"2026-05-18T02:33:00.892743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.892743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2881","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9e+x67fCoGS743hTQVxQwyc3NGn6CPutwg1EVMsbBQ+VHdZVkd0qeCTAj6nd2/IgjkDJai7cn35sKYCEbBETAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:55:45.922632Z"},"content_sha256":"473265a72a627ea353e6ee26e73b5aca4ec122ae61ab175cc074188fe16c1fef","schema_version":"1.0","event_id":"sha256:473265a72a627ea353e6ee26e73b5aca4ec122ae61ab175cc074188fe16c1fef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A56BKZGOGIZBLU4SK5JVVBTT4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Curt Schieler, Paul Cuff","submitted_at":"2014-10-10T19:49:53Z","abstract_excerpt":"We introduce a new measure of information-theoretic secrecy based on rate-distortion theory and study it in the context of the Shannon cipher system. Whereas rate-distortion theory is traditionally concerned with a single reconstruction sequence, in this work we suppose that an eavesdropper produces a list of $2^{nR_{\\sf L}}$ reconstruction sequences and measure secrecy by the minimum distortion over the entire list. We show that this setting is equivalent to one in which an eavesdropper must reconstruct a single sequence, but also receives side information about the source sequence and public"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2881","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G28FgpjF0YTLpBrUMGOa61VbelbMivo3a0s8E5AdvfY70A27BdbEfgZCYnxUe9ByJcD+rlO0NITHQAKmYq9WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:55:45.923010Z"},"content_sha256":"298864fd566be9a1550fe4516426fb7ede50bf6768a50fa1efeae6cd556f2b3e","schema_version":"1.0","event_id":"sha256:298864fd566be9a1550fe4516426fb7ede50bf6768a50fa1efeae6cd556f2b3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/bundle.json","state_url":"https://pith.science/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/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-28T08:55:45Z","links":{"resolver":"https://pith.science/pith/A56BKZGOGIZBLU4SK5JVVBTT4L","bundle":"https://pith.science/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/bundle.json","state":"https://pith.science/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A56BKZGOGIZBLU4SK5JVVBTT4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A56BKZGOGIZBLU4SK5JVVBTT4L","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":"b0fa99008ff9f2bb666a02c7bca3e62a964e3c790f3bfa11cef5f85cfc64ae78","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T19:49:53Z","title_canon_sha256":"cd2af65fbfc53b22681788662b310d1de93b7ae0fcace1b30d3547f2e2a5134e"},"schema_version":"1.0","source":{"id":"1410.2881","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2881","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2881v2","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2881","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"A56BKZGOGIZB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A56BKZGOGIZBLU4S","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A56BKZGO","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:298864fd566be9a1550fe4516426fb7ede50bf6768a50fa1efeae6cd556f2b3e","target":"graph","created_at":"2026-05-18T02:33:00Z","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":"We introduce a new measure of information-theoretic secrecy based on rate-distortion theory and study it in the context of the Shannon cipher system. Whereas rate-distortion theory is traditionally concerned with a single reconstruction sequence, in this work we suppose that an eavesdropper produces a list of $2^{nR_{\\sf L}}$ reconstruction sequences and measure secrecy by the minimum distortion over the entire list. We show that this setting is equivalent to one in which an eavesdropper must reconstruct a single sequence, but also receives side information about the source sequence and public","authors_text":"Curt Schieler, Paul Cuff","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T19:49:53Z","title":"The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2881","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:473265a72a627ea353e6ee26e73b5aca4ec122ae61ab175cc074188fe16c1fef","target":"record","created_at":"2026-05-18T02:33:00Z","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":"b0fa99008ff9f2bb666a02c7bca3e62a964e3c790f3bfa11cef5f85cfc64ae78","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T19:49:53Z","title_canon_sha256":"cd2af65fbfc53b22681788662b310d1de93b7ae0fcace1b30d3547f2e2a5134e"},"schema_version":"1.0","source":{"id":"1410.2881","kind":"arxiv","version":2}},"canonical_sha256":"077c1564ce323215d39257535a8673e2df6e4da85a4a2878bb6302f4e6b79758","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"077c1564ce323215d39257535a8673e2df6e4da85a4a2878bb6302f4e6b79758","first_computed_at":"2026-05-18T02:33:00.892743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.892743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OaFoLui1+p6U+wIQKLz4IlVNk1PePj4gcoqVKAhtarxyfPmWMI/8xHNcmgn5yietNgNgbeLe3/ofsc6oLK8AAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.893097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2881","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:473265a72a627ea353e6ee26e73b5aca4ec122ae61ab175cc074188fe16c1fef","sha256:298864fd566be9a1550fe4516426fb7ede50bf6768a50fa1efeae6cd556f2b3e"],"state_sha256":"87f4bd85d476a807c05913a42379dd25bf794e2f099934a469c5ea3ac9097644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6FP1EtisBdjPSPmkmdaIyM/5GSD2wor/bbD2FazaXwpJMGdV5x9Ra2baYnoKRmOku/DPLqah2KvBVJ/IfG7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:55:45.924911Z","bundle_sha256":"6819d9b7d088dc7f7173161014eac67bccc880fd3de6bc3046611b4fde8b669f"}}