{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VOC24SOMK4MQ6MU2SNFYOSEJCW","short_pith_number":"pith:VOC24SOM","schema_version":"1.0","canonical_sha256":"ab85ae49cc57190f329a934b874889158195b30cd4299ccaef5108349b131d60","source":{"kind":"arxiv","id":"1601.03617","version":3},"attestation_state":"computed","paper":{"title":"Interactive Communication for Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Pramod Viswanath, Shun Watanabe","submitted_at":"2016-01-14T15:16:11Z","abstract_excerpt":"Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange which increases the communication size in steps until the task is done. Next, we derive a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreement problem. Our single-shot analysis applies to all discrete random variables and yields upper and lower bound of a similar form. In fact, the bounds are asymptotically tight and lead to a characteri"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1601.03617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-14T15:16:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"208649ccd6149a8b89ab5c2cd09ef667c561c52fff8313ec780231a55be90eba","abstract_canon_sha256":"c9eba2d8ddbdfccf9fa03b88d6aabe6171c0ac6e07cd00698acbbc63ae2a92e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:50.853441Z","signature_b64":"MJFQay0zIAnIMNU8jyKg2KdxQlb4tGSUsMsyZpqmW1yuBRFjiv3N/+ToL7XHegAVI3WYSrHfFo4deIBdtX2jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab85ae49cc57190f329a934b874889158195b30cd4299ccaef5108349b131d60","last_reissued_at":"2026-05-18T00:30:50.852792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:50.852792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Communication for Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Pramod Viswanath, Shun Watanabe","submitted_at":"2016-01-14T15:16:11Z","abstract_excerpt":"Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange which increases the communication size in steps until the task is done. Next, we derive a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreement problem. Our single-shot analysis applies to all discrete random variables and yields upper and lower bound of a similar form. In fact, the bounds are asymptotically tight and lead to a characteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03617","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03617","created_at":"2026-05-18T00:30:50.852899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03617v3","created_at":"2026-05-18T00:30:50.852899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03617","created_at":"2026-05-18T00:30:50.852899+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOC24SOMK4MQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOC24SOMK4MQ6MU2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOC24SOM","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW","json":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW.json","graph_json":"https://pith.science/api/pith-number/VOC24SOMK4MQ6MU2SNFYOSEJCW/graph.json","events_json":"https://pith.science/api/pith-number/VOC24SOMK4MQ6MU2SNFYOSEJCW/events.json","paper":"https://pith.science/paper/VOC24SOM"},"agent_actions":{"view_html":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW","download_json":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW.json","view_paper":"https://pith.science/paper/VOC24SOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03617&json=true","fetch_graph":"https://pith.science/api/pith-number/VOC24SOMK4MQ6MU2SNFYOSEJCW/graph.json","fetch_events":"https://pith.science/api/pith-number/VOC24SOMK4MQ6MU2SNFYOSEJCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW/action/storage_attestation","attest_author":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW/action/author_attestation","sign_citation":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW/action/citation_signature","submit_replication":"https://pith.science/pith/VOC24SOMK4MQ6MU2SNFYOSEJCW/action/replication_record"}},"created_at":"2026-05-18T00:30:50.852899+00:00","updated_at":"2026-05-18T00:30:50.852899+00:00"}