{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JGFVJSUO6ZAPFA3IU3F24PX2XD","short_pith_number":"pith:JGFVJSUO","canonical_record":{"source":{"id":"1404.5715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:16:50Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"5058af4e79121b675bfb4ba2340bcfa76665a2c627726a7b5acc6ffa732da390","abstract_canon_sha256":"78a2eef6dc9881e6d3d6b8ae77227a943fd07b2aee6162d2c77fa82770914904"},"schema_version":"1.0"},"canonical_sha256":"498b54ca8ef640f28368a6cbae3efab8e8c5eb68d413a26ddbceb98ff6bc7333","source":{"kind":"arxiv","id":"1404.5715","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5715","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5715v3","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5715","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"JGFVJSUO6ZAP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGFVJSUO6ZAPFA3I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGFVJSUO","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JGFVJSUO6ZAPFA3IU3F24PX2XD","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:16:50Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"5058af4e79121b675bfb4ba2340bcfa76665a2c627726a7b5acc6ffa732da390","abstract_canon_sha256":"78a2eef6dc9881e6d3d6b8ae77227a943fd07b2aee6162d2c77fa82770914904"},"schema_version":"1.0"},"canonical_sha256":"498b54ca8ef640f28368a6cbae3efab8e8c5eb68d413a26ddbceb98ff6bc7333","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:02.678932Z","signature_b64":"SRWMIVL0LCGgwMTkbJyvcssxsjoe6jk/O4ac9tPgUivpRO1VeSAMJg99f99ca0SHlV5m+75rhfbW/JY19IjGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"498b54ca8ef640f28368a6cbae3efab8e8c5eb68d413a26ddbceb98ff6bc7333","last_reissued_at":"2026-05-18T02:00:02.678361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:02.678361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5715","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-18T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Wi2vsI0AaOMQE8A+f/QhsUWc1SbERgfCdR//PHYpImlQUhF10SBPhjrXX94b3jrzHzOS/0CVO2FWN0Whz4MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:21:37.826283Z"},"content_sha256":"fa259d000ed9185c05df723ec46f1648359b9a9c14f049f3ea6df531792ba4c2","schema_version":"1.0","event_id":"sha256:fa259d000ed9185c05df723ec46f1648359b9a9c14f049f3ea6df531792ba4c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JGFVJSUO6ZAPFA3IU3F24PX2XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Converses for Secret Key Agreement and Secure Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Shun Watanabe","submitted_at":"2014-04-23T06:16:50Z","abstract_excerpt":"We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the secret key length, which is derived using a reduction of binary hypothesis testing to multiparty secret key agreement. Building on this basic result, we derive new converses for multiparty secret key agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to secret key agreement. Finall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5715","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-18T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBLTYKt1swcB6tHw++JWg8PHY1wBOZQI8+Rz5qHhHXqFtUwfCQbfakzTlx4nGtAOUbj00BbhWdXG3JKYGiKSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:21:37.826965Z"},"content_sha256":"636baf4bd52b8bac661a46f064d87413eed2b8d0e2573c25f17b7334f51804d7","schema_version":"1.0","event_id":"sha256:636baf4bd52b8bac661a46f064d87413eed2b8d0e2573c25f17b7334f51804d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/bundle.json","state_url":"https://pith.science/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/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-05-26T03:21:37Z","links":{"resolver":"https://pith.science/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD","bundle":"https://pith.science/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/bundle.json","state":"https://pith.science/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGFVJSUO6ZAPFA3IU3F24PX2XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JGFVJSUO6ZAPFA3IU3F24PX2XD","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":"78a2eef6dc9881e6d3d6b8ae77227a943fd07b2aee6162d2c77fa82770914904","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:16:50Z","title_canon_sha256":"5058af4e79121b675bfb4ba2340bcfa76665a2c627726a7b5acc6ffa732da390"},"schema_version":"1.0","source":{"id":"1404.5715","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5715","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5715v3","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5715","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"JGFVJSUO6ZAP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGFVJSUO6ZAPFA3I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGFVJSUO","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:636baf4bd52b8bac661a46f064d87413eed2b8d0e2573c25f17b7334f51804d7","target":"graph","created_at":"2026-05-18T02:00: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":"We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the secret key length, which is derived using a reduction of binary hypothesis testing to multiparty secret key agreement. Building on this basic result, we derive new converses for multiparty secret key agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to secret key agreement. Finall","authors_text":"Himanshu Tyagi, Shun Watanabe","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:16:50Z","title":"Converses for Secret Key Agreement and Secure Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5715","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:fa259d000ed9185c05df723ec46f1648359b9a9c14f049f3ea6df531792ba4c2","target":"record","created_at":"2026-05-18T02:00: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":"78a2eef6dc9881e6d3d6b8ae77227a943fd07b2aee6162d2c77fa82770914904","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:16:50Z","title_canon_sha256":"5058af4e79121b675bfb4ba2340bcfa76665a2c627726a7b5acc6ffa732da390"},"schema_version":"1.0","source":{"id":"1404.5715","kind":"arxiv","version":3}},"canonical_sha256":"498b54ca8ef640f28368a6cbae3efab8e8c5eb68d413a26ddbceb98ff6bc7333","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"498b54ca8ef640f28368a6cbae3efab8e8c5eb68d413a26ddbceb98ff6bc7333","first_computed_at":"2026-05-18T02:00:02.678361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:02.678361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRWMIVL0LCGgwMTkbJyvcssxsjoe6jk/O4ac9tPgUivpRO1VeSAMJg99f99ca0SHlV5m+75rhfbW/JY19IjGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:02.678932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5715","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa259d000ed9185c05df723ec46f1648359b9a9c14f049f3ea6df531792ba4c2","sha256:636baf4bd52b8bac661a46f064d87413eed2b8d0e2573c25f17b7334f51804d7"],"state_sha256":"d80a1021d9aa3ee20297bfb9ee0209cd513351e79e58233e0c99a1e0da57226d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIWdFAf4vCWwVdgxyJ5+IruaJbYyEdJ22ibyohlpbwV8BkxcGZsW7Qc5hhUMOPkgpd+i17dgS5xjiA11pbCKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:21:37.830091Z","bundle_sha256":"c9ab2d6c0b29144019003e48e55bdaa606d6a060cfcf2fc5957dca803dee4199"}}