{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IDKKJ2NCJ3EYEP3FMMKU5KCOBS","short_pith_number":"pith:IDKKJ2NC","canonical_record":{"source":{"id":"1504.06830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-26T14:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"a229b3e745876a63086d9e2cdfd0d86118e5315c7794aa6d15fa5026ca77e3ea","abstract_canon_sha256":"48796843f0b95adef0e0599229171f3837b63f11f6a1330cae8b84da75a62403"},"schema_version":"1.0"},"canonical_sha256":"40d4a4e9a24ec9823f6563154ea84e0c8991a7630f59543486c49616d57e24c1","source":{"kind":"arxiv","id":"1504.06830","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06830","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06830v1","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06830","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"IDKKJ2NCJ3EY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IDKKJ2NCJ3EYEP3F","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IDKKJ2NC","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IDKKJ2NCJ3EYEP3FMMKU5KCOBS","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-26T14:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"a229b3e745876a63086d9e2cdfd0d86118e5315c7794aa6d15fa5026ca77e3ea","abstract_canon_sha256":"48796843f0b95adef0e0599229171f3837b63f11f6a1330cae8b84da75a62403"},"schema_version":"1.0"},"canonical_sha256":"40d4a4e9a24ec9823f6563154ea84e0c8991a7630f59543486c49616d57e24c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:44.294584Z","signature_b64":"I/0EMmiAmLi9qvq0Igh/hK60L8p7T/BPhPWvUCmBHC0Os4peyht8RrrP5pljTWsRbTeC2VCJ0jLwnSiHnnu6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d4a4e9a24ec9823f6563154ea84e0c8991a7630f59543486c49616d57e24c1","last_reissued_at":"2026-05-18T02:17:44.294176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:44.294176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06830","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-18T02:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPCgRoxGG8w/gxl0RWvRYnBLHvb9Os2gcWQbKB8+L2NXG2w0ox4kar6tbP8czl0JQf3bLONoEFcbHu8LzctQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:17:59.689002Z"},"content_sha256":"c72c231ae83c01e6b6432013b680fcc69129c1eb3177bcd10e90b873971498ef","schema_version":"1.0","event_id":"sha256:c72c231ae83c01e6b6432013b680fcc69129c1eb3177bcd10e90b873971498ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IDKKJ2NCJ3EYEP3FMMKU5KCOBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Complexity and the Quest for Interactive Compression (A Survey)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Omri Weinstein","submitted_at":"2015-04-26T14:30:05Z","abstract_excerpt":"Information complexity is the interactive analogue of Shannon's classical information theory. In recent years this field has emerged as a powerful tool for proving strong communication lower bounds, and for addressing some of the major open problems in communication complexity and circuit complexity. A notable achievement of information complexity is the breakthrough in understanding of the fundamental direct sum and direct product conjectures, which aim to quantify the power of parallel computation. This survey provides a brief introduction to information complexity, and overviews some of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06830","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-18T02:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XA+bQIrZtQQh9PYUPr0S4FNOgBkYlt4b+WYJkc/whyRSIvUambwLkSAmnAHYoLfUw2D/fQUSrrRWGA9Z1vUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:17:59.689699Z"},"content_sha256":"75f3d6307a12e7ffec364c08d25b702064adbc973a230816aba17467b62a0185","schema_version":"1.0","event_id":"sha256:75f3d6307a12e7ffec364c08d25b702064adbc973a230816aba17467b62a0185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/bundle.json","state_url":"https://pith.science/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/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-06T19:17:59Z","links":{"resolver":"https://pith.science/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS","bundle":"https://pith.science/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/bundle.json","state":"https://pith.science/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDKKJ2NCJ3EYEP3FMMKU5KCOBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IDKKJ2NCJ3EYEP3FMMKU5KCOBS","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":"48796843f0b95adef0e0599229171f3837b63f11f6a1330cae8b84da75a62403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-26T14:30:05Z","title_canon_sha256":"a229b3e745876a63086d9e2cdfd0d86118e5315c7794aa6d15fa5026ca77e3ea"},"schema_version":"1.0","source":{"id":"1504.06830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06830","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06830v1","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06830","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"IDKKJ2NCJ3EY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IDKKJ2NCJ3EYEP3F","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IDKKJ2NC","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:75f3d6307a12e7ffec364c08d25b702064adbc973a230816aba17467b62a0185","target":"graph","created_at":"2026-05-18T02:17:44Z","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":"Information complexity is the interactive analogue of Shannon's classical information theory. In recent years this field has emerged as a powerful tool for proving strong communication lower bounds, and for addressing some of the major open problems in communication complexity and circuit complexity. A notable achievement of information complexity is the breakthrough in understanding of the fundamental direct sum and direct product conjectures, which aim to quantify the power of parallel computation. This survey provides a brief introduction to information complexity, and overviews some of the","authors_text":"Omri Weinstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-26T14:30:05Z","title":"Information Complexity and the Quest for Interactive Compression (A Survey)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06830","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:c72c231ae83c01e6b6432013b680fcc69129c1eb3177bcd10e90b873971498ef","target":"record","created_at":"2026-05-18T02:17:44Z","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":"48796843f0b95adef0e0599229171f3837b63f11f6a1330cae8b84da75a62403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-26T14:30:05Z","title_canon_sha256":"a229b3e745876a63086d9e2cdfd0d86118e5315c7794aa6d15fa5026ca77e3ea"},"schema_version":"1.0","source":{"id":"1504.06830","kind":"arxiv","version":1}},"canonical_sha256":"40d4a4e9a24ec9823f6563154ea84e0c8991a7630f59543486c49616d57e24c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40d4a4e9a24ec9823f6563154ea84e0c8991a7630f59543486c49616d57e24c1","first_computed_at":"2026-05-18T02:17:44.294176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:44.294176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/0EMmiAmLi9qvq0Igh/hK60L8p7T/BPhPWvUCmBHC0Os4peyht8RrrP5pljTWsRbTeC2VCJ0jLwnSiHnnu6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:44.294584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c72c231ae83c01e6b6432013b680fcc69129c1eb3177bcd10e90b873971498ef","sha256:75f3d6307a12e7ffec364c08d25b702064adbc973a230816aba17467b62a0185"],"state_sha256":"b01bdf7e0352f8bf0dc85f48b67943c7a038cb90834ddbc2c2e143ab43fbd31b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0ZF/RAiti2SliGVbb4CViZBYeikCBo0Dt1lbqzdU6T6MErL+pWBjtp0C6w9ki2Q+dIZ+EB6Vzpn1qSp8D2fAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:17:59.694203Z","bundle_sha256":"11e834acd397b4215ce25d73c81e881ea98a6d5504fb85937a18944c581b1594"}}