{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:EXZ4CWDHIE6EO3UCNDHWGZ6P2P","short_pith_number":"pith:EXZ4CWDH","canonical_record":{"source":{"id":"0904.0308","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-02T05:38:27Z","cross_cats_sorted":["cs.CR","math.AC","math.IT"],"title_canon_sha256":"b3c439f392418de9149a92720007e17fc70b0b16409eab42d1b18179a5d2d9c0","abstract_canon_sha256":"7a1776d01e00b7e5a5360f5d0afde159dc43959c65f47fb175337762df5c73bd"},"schema_version":"1.0"},"canonical_sha256":"25f3c15867413c476e8268cf6367cfd3d9c659e4f623028fb94057b79c976b7c","source":{"kind":"arxiv","id":"0904.0308","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.0308","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0904.0308v5","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0308","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"EXZ4CWDHIE6E","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EXZ4CWDHIE6EO3UC","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EXZ4CWDH","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:EXZ4CWDHIE6EO3UCNDHWGZ6P2P","target":"record","payload":{"canonical_record":{"source":{"id":"0904.0308","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-02T05:38:27Z","cross_cats_sorted":["cs.CR","math.AC","math.IT"],"title_canon_sha256":"b3c439f392418de9149a92720007e17fc70b0b16409eab42d1b18179a5d2d9c0","abstract_canon_sha256":"7a1776d01e00b7e5a5360f5d0afde159dc43959c65f47fb175337762df5c73bd"},"schema_version":"1.0"},"canonical_sha256":"25f3c15867413c476e8268cf6367cfd3d9c659e4f623028fb94057b79c976b7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.254078Z","signature_b64":"+hi7Q7C3p3JwuGdf0/eRrVeMqLIqQAtJ7lZOEn4BvjZ47ASZCuQiIbisFGdWHxj9Zljy0PzRy9TSZJbI/NKLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f3c15867413c476e8268cf6367cfd3d9c659e4f623028fb94057b79c976b7c","last_reissued_at":"2026-05-18T00:58:20.253359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.253359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.0308","source_version":5,"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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0eiIXyukLhqmBQ5MZjt4mBlwqG5PkY+Zy5jWyRAhAO230FVU//p7hTeRhQJ0Pxg1XkCTR3IYYWQAj6PdXM3JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:27.580124Z"},"content_sha256":"e56e4b2743e8615056d4b621d4450fa452ef8f0e3c620b9e5312b80ee54daaf2","schema_version":"1.0","event_id":"sha256:e56e4b2743e8615056d4b621d4450fa452ef8f0e3c620b9e5312b80ee54daaf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:EXZ4CWDHIE6EO3UCNDHWGZ6P2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential decreasing rate of leaked information in universal random privacy amplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi","submitted_at":"2009-04-02T05:38:27Z","abstract_excerpt":"We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett et al(1995)'s bound based on the R\\'enyi entropy of order 2 because the bound obtained here uses the R\\'enyi entropy of order $1+s$ for $s \\in [0,1]$. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi(2006)'s exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0308","kind":"arxiv","version":5},"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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txg7mOinnaT+S2cKm3YBjh2q+1k3fIzcmG3hf5WNIshfsWYTOxPy4+/YkFuCqKje7y59Zfw5MV+ypih/5UqMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:27.580494Z"},"content_sha256":"0083a10e740d50f7136307734299c170770daf2d503d86c18cf67d932bfc296d","schema_version":"1.0","event_id":"sha256:0083a10e740d50f7136307734299c170770daf2d503d86c18cf67d932bfc296d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/bundle.json","state_url":"https://pith.science/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/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-03T02:43:27Z","links":{"resolver":"https://pith.science/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P","bundle":"https://pith.science/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/bundle.json","state":"https://pith.science/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXZ4CWDHIE6EO3UCNDHWGZ6P2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:EXZ4CWDHIE6EO3UCNDHWGZ6P2P","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":"7a1776d01e00b7e5a5360f5d0afde159dc43959c65f47fb175337762df5c73bd","cross_cats_sorted":["cs.CR","math.AC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-02T05:38:27Z","title_canon_sha256":"b3c439f392418de9149a92720007e17fc70b0b16409eab42d1b18179a5d2d9c0"},"schema_version":"1.0","source":{"id":"0904.0308","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.0308","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0904.0308v5","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0308","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"EXZ4CWDHIE6E","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EXZ4CWDHIE6EO3UC","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EXZ4CWDH","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:0083a10e740d50f7136307734299c170770daf2d503d86c18cf67d932bfc296d","target":"graph","created_at":"2026-05-18T00:58:20Z","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 derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett et al(1995)'s bound based on the R\\'enyi entropy of order 2 because the bound obtained here uses the R\\'enyi entropy of order $1+s$ for $s \\in [0,1]$. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi(2006)'s exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.","authors_text":"Masahito Hayashi","cross_cats":["cs.CR","math.AC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-02T05:38:27Z","title":"Exponential decreasing rate of leaked information in universal random privacy amplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0308","kind":"arxiv","version":5},"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:e56e4b2743e8615056d4b621d4450fa452ef8f0e3c620b9e5312b80ee54daaf2","target":"record","created_at":"2026-05-18T00:58:20Z","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":"7a1776d01e00b7e5a5360f5d0afde159dc43959c65f47fb175337762df5c73bd","cross_cats_sorted":["cs.CR","math.AC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-02T05:38:27Z","title_canon_sha256":"b3c439f392418de9149a92720007e17fc70b0b16409eab42d1b18179a5d2d9c0"},"schema_version":"1.0","source":{"id":"0904.0308","kind":"arxiv","version":5}},"canonical_sha256":"25f3c15867413c476e8268cf6367cfd3d9c659e4f623028fb94057b79c976b7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25f3c15867413c476e8268cf6367cfd3d9c659e4f623028fb94057b79c976b7c","first_computed_at":"2026-05-18T00:58:20.253359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.253359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hi7Q7C3p3JwuGdf0/eRrVeMqLIqQAtJ7lZOEn4BvjZ47ASZCuQiIbisFGdWHxj9Zljy0PzRy9TSZJbI/NKLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.254078Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.0308","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e56e4b2743e8615056d4b621d4450fa452ef8f0e3c620b9e5312b80ee54daaf2","sha256:0083a10e740d50f7136307734299c170770daf2d503d86c18cf67d932bfc296d"],"state_sha256":"b3ca7a017a3dd6c0f0804c61f59ec6486a34d1c807d4407c0aadf777a7c0f8d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRNIPJ9ydFECXFUxXBZVPXtRrl9c8jnb3acseNW4YSRO6he21WLgamiY7RDjTdW5EQC290mh7fMdsXD4wC18Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:43:27.582500Z","bundle_sha256":"7c02bed853f0d8fe45f1824025f88e293485508fcae140503c1ff11f5c19e031"}}