{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JAIQ5JYGN57VYRACT3A7XFQGTJ","short_pith_number":"pith:JAIQ5JYG","canonical_record":{"source":{"id":"1707.08086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-25T16:57:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"378e433f48084807f5cc57ad465d26bb42eaa1eaf5dc035590d160489e779030","abstract_canon_sha256":"a8d3baaeb83a0728758896405247d0b2680060d250106f184674a276b3b5de96"},"schema_version":"1.0"},"canonical_sha256":"48110ea7066f7f5c44029ec1fb96069a7c9683dcc936420884034390b265ea81","source":{"kind":"arxiv","id":"1707.08086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08086","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08086v1","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08086","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"JAIQ5JYGN57V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAIQ5JYGN57VYRAC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAIQ5JYG","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JAIQ5JYGN57VYRACT3A7XFQGTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-25T16:57:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"378e433f48084807f5cc57ad465d26bb42eaa1eaf5dc035590d160489e779030","abstract_canon_sha256":"a8d3baaeb83a0728758896405247d0b2680060d250106f184674a276b3b5de96"},"schema_version":"1.0"},"canonical_sha256":"48110ea7066f7f5c44029ec1fb96069a7c9683dcc936420884034390b265ea81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:29.478311Z","signature_b64":"DKCxbLtY6JNgBxYI9DVitjTDP3ENl7alE7xheyha013UTnt+Xd0baeyg9VA2z+LF/s86goMKJUMtlrqVflklBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48110ea7066f7f5c44029ec1fb96069a7c9683dcc936420884034390b265ea81","last_reissued_at":"2026-05-18T00:39:29.477377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:29.477377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08086","source_version":1,"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:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B08p9ONbkbS68fYzz+ZdrMRvSJBZi8zpRQGPRs88RF8eojEtfwJligabfbx+mnm0UsccvLhw5dBt70ffGqe4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:35:45.002518Z"},"content_sha256":"fc6645c7bb28e88423618115dbabae6423cca046be9fc3d8a7a5f3c89385cf48","schema_version":"1.0","event_id":"sha256:fc6645c7bb28e88423618115dbabae6423cca046be9fc3d8a7a5f3c89385cf48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JAIQ5JYGN57VYRACT3A7XFQGTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource-Efficient Common Randomness and Secret-Key Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, T.S. Jayram","submitted_at":"2017-07-25T16:57:42Z","abstract_excerpt":"We study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This problem is at the core of secret key generation in cryptography, with connections to communication under uncertainty and locality sensitive hashing. We take the approach of treating correlated sources as a critical resource, and ask whether common randomness can be generated resource-efficiently.\n  We consider two notable sources in this setup arising from corr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08086","kind":"arxiv","version":1},"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:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkIOlzoe7SSxj3RkTbbscBO7yHmdoj7JKxtM4epqZ36MEEqvfDeZ1RWi4oDidDXhf1JVUuc5i3A2ULkRzv2mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:35:45.003301Z"},"content_sha256":"9a75a30e3cf14ee9667df2ace083f9015fe1d6aca132821259eabba061b890e1","schema_version":"1.0","event_id":"sha256:9a75a30e3cf14ee9667df2ace083f9015fe1d6aca132821259eabba061b890e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/bundle.json","state_url":"https://pith.science/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/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-10T01:35:45Z","links":{"resolver":"https://pith.science/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ","bundle":"https://pith.science/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/bundle.json","state":"https://pith.science/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAIQ5JYGN57VYRACT3A7XFQGTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JAIQ5JYGN57VYRACT3A7XFQGTJ","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":"a8d3baaeb83a0728758896405247d0b2680060d250106f184674a276b3b5de96","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-25T16:57:42Z","title_canon_sha256":"378e433f48084807f5cc57ad465d26bb42eaa1eaf5dc035590d160489e779030"},"schema_version":"1.0","source":{"id":"1707.08086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08086","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08086v1","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08086","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"JAIQ5JYGN57V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAIQ5JYGN57VYRAC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAIQ5JYG","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:9a75a30e3cf14ee9667df2ace083f9015fe1d6aca132821259eabba061b890e1","target":"graph","created_at":"2026-05-18T00:39:29Z","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 study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This problem is at the core of secret key generation in cryptography, with connections to communication under uncertainty and locality sensitive hashing. We take the approach of treating correlated sources as a critical resource, and ask whether common randomness can be generated resource-efficiently.\n  We consider two notable sources in this setup arising from corr","authors_text":"Badih Ghazi, T.S. Jayram","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-25T16:57:42Z","title":"Resource-Efficient Common Randomness and Secret-Key Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08086","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:fc6645c7bb28e88423618115dbabae6423cca046be9fc3d8a7a5f3c89385cf48","target":"record","created_at":"2026-05-18T00:39:29Z","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":"a8d3baaeb83a0728758896405247d0b2680060d250106f184674a276b3b5de96","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-25T16:57:42Z","title_canon_sha256":"378e433f48084807f5cc57ad465d26bb42eaa1eaf5dc035590d160489e779030"},"schema_version":"1.0","source":{"id":"1707.08086","kind":"arxiv","version":1}},"canonical_sha256":"48110ea7066f7f5c44029ec1fb96069a7c9683dcc936420884034390b265ea81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48110ea7066f7f5c44029ec1fb96069a7c9683dcc936420884034390b265ea81","first_computed_at":"2026-05-18T00:39:29.477377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:29.477377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DKCxbLtY6JNgBxYI9DVitjTDP3ENl7alE7xheyha013UTnt+Xd0baeyg9VA2z+LF/s86goMKJUMtlrqVflklBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:29.478311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6645c7bb28e88423618115dbabae6423cca046be9fc3d8a7a5f3c89385cf48","sha256:9a75a30e3cf14ee9667df2ace083f9015fe1d6aca132821259eabba061b890e1"],"state_sha256":"9eee3139dac812e57f338e708ed6b948d8907880a1fd94c0dba0899eec7a13b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6l1A+6AD8ytedYN2S1F0NmVFfeK0OD/Fr8gVXK4vvV5Fh8cmIOgKrepX/SqlvVVZpUqwe4Vftp0nHL/hrvPWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:35:45.008015Z","bundle_sha256":"7c14f907cb8d47178471d5fdfc2420d40f243e55a12f5f3553c51898e73b598a"}}