{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G6FJWV6J6236YQJ4BLA4334OXB","short_pith_number":"pith:G6FJWV6J","canonical_record":{"source":{"id":"1602.02390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T16:57:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a647a6b96e77d8056998aaa135b4c7427da6e78724a0c781eb919f0e86c379e4","abstract_canon_sha256":"68f28596ce26f3782bf8ec6af1637d40c0df9eec2fc47c1f8dfe09a1420ef2b3"},"schema_version":"1.0"},"canonical_sha256":"378a9b57c9f6b7ec413c0ac1cdef8eb8617c4d05abf57f5ec02e46ee38be8bdf","source":{"kind":"arxiv","id":"1602.02390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02390","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02390v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02390","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"G6FJWV6J6236","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6FJWV6J6236YQJ4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6FJWV6J","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G6FJWV6J6236YQJ4BLA4334OXB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T16:57:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a647a6b96e77d8056998aaa135b4c7427da6e78724a0c781eb919f0e86c379e4","abstract_canon_sha256":"68f28596ce26f3782bf8ec6af1637d40c0df9eec2fc47c1f8dfe09a1420ef2b3"},"schema_version":"1.0"},"canonical_sha256":"378a9b57c9f6b7ec413c0ac1cdef8eb8617c4d05abf57f5ec02e46ee38be8bdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.133552Z","signature_b64":"MN1SpAoK7adtIhsxI7wHsxT1T/3s2nAA+MomiwSrentueq/fCPOa/GQpUeqfxPl5EV6E/DPqrtLEMIk3Z3FFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378a9b57c9f6b7ec413c0ac1cdef8eb8617c4d05abf57f5ec02e46ee38be8bdf","last_reissued_at":"2026-05-18T01:21:10.132854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.132854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02390","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVtuqCxuXzDRyJUHOL44bZ+EvL51QC+z0Os7qoqMWBRSgQvU5vRJ+CyNYfplnymdHiUSoqrvOORnRzt43vwwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:51:19.082005Z"},"content_sha256":"8b89daf157cb3404edc0a69ccd3809ccf7d0a68a8826d876c063f38c09c7441f","schema_version":"1.0","event_id":"sha256:8b89daf157cb3404edc0a69ccd3809ccf7d0a68a8826d876c063f38c09c7441f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G6FJWV6J6236YQJ4BLA4334OXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Interactive Function Computation via Wyner Common Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shijin Rajakrishnan, Sundara Rajan S, Vinod Prabhakaran","submitted_at":"2016-02-07T16:57:28Z","abstract_excerpt":"The question of how much communication is required between collaborating parties to compute a function of their data is of fundamental importance in the fields of theoretical computer science and information theory. In this work, the focus is on coming up with lower bounds on this. The information cost of a protocol is the amount of information the protocol reveals to Alice and Bob about each others inputs, and the information complexity of a function is the infimum of information costs over all valid protocols. For the amortized case, it is known that the optimal rate for the computation is e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02390","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekMbe2TQQIvxurMMoCG/NZuqPVG/vt29mYjxtSlUw3tzMrQqTtiLvfPDfwgsJOGFuMBpYUihOdZY435Ts48jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:51:19.082406Z"},"content_sha256":"1e6934a5e655657f1ac261586047cd37c1f81fadaede73ecf7e594416b00e4fe","schema_version":"1.0","event_id":"sha256:1e6934a5e655657f1ac261586047cd37c1f81fadaede73ecf7e594416b00e4fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6FJWV6J6236YQJ4BLA4334OXB/bundle.json","state_url":"https://pith.science/pith/G6FJWV6J6236YQJ4BLA4334OXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6FJWV6J6236YQJ4BLA4334OXB/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-23T18:51:19Z","links":{"resolver":"https://pith.science/pith/G6FJWV6J6236YQJ4BLA4334OXB","bundle":"https://pith.science/pith/G6FJWV6J6236YQJ4BLA4334OXB/bundle.json","state":"https://pith.science/pith/G6FJWV6J6236YQJ4BLA4334OXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6FJWV6J6236YQJ4BLA4334OXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G6FJWV6J6236YQJ4BLA4334OXB","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":"68f28596ce26f3782bf8ec6af1637d40c0df9eec2fc47c1f8dfe09a1420ef2b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T16:57:28Z","title_canon_sha256":"a647a6b96e77d8056998aaa135b4c7427da6e78724a0c781eb919f0e86c379e4"},"schema_version":"1.0","source":{"id":"1602.02390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02390","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02390v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02390","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"G6FJWV6J6236","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6FJWV6J6236YQJ4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6FJWV6J","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1e6934a5e655657f1ac261586047cd37c1f81fadaede73ecf7e594416b00e4fe","target":"graph","created_at":"2026-05-18T01:21:10Z","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":"The question of how much communication is required between collaborating parties to compute a function of their data is of fundamental importance in the fields of theoretical computer science and information theory. In this work, the focus is on coming up with lower bounds on this. The information cost of a protocol is the amount of information the protocol reveals to Alice and Bob about each others inputs, and the information complexity of a function is the infimum of information costs over all valid protocols. For the amortized case, it is known that the optimal rate for the computation is e","authors_text":"Shijin Rajakrishnan, Sundara Rajan S, Vinod Prabhakaran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T16:57:28Z","title":"Lower Bounds for Interactive Function Computation via Wyner Common Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02390","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:8b89daf157cb3404edc0a69ccd3809ccf7d0a68a8826d876c063f38c09c7441f","target":"record","created_at":"2026-05-18T01:21:10Z","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":"68f28596ce26f3782bf8ec6af1637d40c0df9eec2fc47c1f8dfe09a1420ef2b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T16:57:28Z","title_canon_sha256":"a647a6b96e77d8056998aaa135b4c7427da6e78724a0c781eb919f0e86c379e4"},"schema_version":"1.0","source":{"id":"1602.02390","kind":"arxiv","version":1}},"canonical_sha256":"378a9b57c9f6b7ec413c0ac1cdef8eb8617c4d05abf57f5ec02e46ee38be8bdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"378a9b57c9f6b7ec413c0ac1cdef8eb8617c4d05abf57f5ec02e46ee38be8bdf","first_computed_at":"2026-05-18T01:21:10.132854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.132854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MN1SpAoK7adtIhsxI7wHsxT1T/3s2nAA+MomiwSrentueq/fCPOa/GQpUeqfxPl5EV6E/DPqrtLEMIk3Z3FFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.133552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b89daf157cb3404edc0a69ccd3809ccf7d0a68a8826d876c063f38c09c7441f","sha256:1e6934a5e655657f1ac261586047cd37c1f81fadaede73ecf7e594416b00e4fe"],"state_sha256":"ef125870939924a3b68753b6f18cff276269e10dafafc4756081c9337674112e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWUKdN+8b9/jenX1mQXwUVfYwiDX2c62CCkzF33pSujWIKDci5skgUlXDc7qM8rtcPHz++wNatgKFcd0ijewCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:51:19.084623Z","bundle_sha256":"1aac41dcdaf422f8ab6e976a4e0326372efd236bb937f1cc1bc6df5ffe4d1469"}}