{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QON4M44IPS2J3UXGDG2XSU2BLK","short_pith_number":"pith:QON4M44I","canonical_record":{"source":{"id":"1704.06185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T15:27:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7c8773799b827433ab6f4b63e814be144101d3d2e335bd4a5ede7f3f5762db04","abstract_canon_sha256":"9c20e5cbb0e47d654a75f3aba07577001165c6c6ab7ef1b8ce3a18fbe68c4d93"},"schema_version":"1.0"},"canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","source":{"kind":"arxiv","id":"1704.06185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06185","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06185v2","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06185","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"QON4M44IPS2J","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QON4M44IPS2J3UXG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QON4M44I","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QON4M44IPS2J3UXGDG2XSU2BLK","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T15:27:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7c8773799b827433ab6f4b63e814be144101d3d2e335bd4a5ede7f3f5762db04","abstract_canon_sha256":"9c20e5cbb0e47d654a75f3aba07577001165c6c6ab7ef1b8ce3a18fbe68c4d93"},"schema_version":"1.0"},"canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:30.493859Z","signature_b64":"0MwI50XWWsZF0zzE/g6CFvmQ6R7YR5Oj2g7vy6F9QrEz5f9zsGy7asLG44aOSxRiMJHnOCRA8cpvnDWLaH8dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","last_reissued_at":"2026-05-18T00:30:30.493249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:30.493249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06185","source_version":2,"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:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxiyiCCkE8lyq0xSrHeA6Mqy3paFBZrd4YNrATgmGiaYGandhbH7Tu4knOhVYHqqXau7PeqAqJ6peQ8jpnHoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:10:31.319718Z"},"content_sha256":"01304d690c67f1621f405389483d1d82699655dba0b4f760d444b979c84dc7e2","schema_version":"1.0","event_id":"sha256:01304d690c67f1621f405389483d1d82699655dba0b4f760d444b979c84dc7e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QON4M44IPS2J3UXGDG2XSU2BLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cell-Probe Lower Bounds from Online Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Josh Alman, Joshua R. Wang","submitted_at":"2017-04-20T15:27:26Z","abstract_excerpt":"In this work, we introduce an online model for communication complexity. Analogous to how online algorithms receive their input piece-by-piece, our model presents one of the players, Bob, his input piece-by-piece, and has the players Alice and Bob cooperate to compute a result each time before the next piece is revealed to Bob. This model has a closer and more natural correspondence to dynamic data structures than classic communication models do, and hence presents a new perspective on data structures.\n  We first present a tight lower bound for the online set intersection problem in the online"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06185","kind":"arxiv","version":2},"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:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNcUtppY+3xHNjPO2Kdm4zSMx+hJF7R9NyeDnsXmPjRNSBUR9PjJTmxLJ1Yx/gp+welpFhuEuEM23363qnUXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:10:31.320057Z"},"content_sha256":"c5097deb72d7642396b3dc8581b06f9e8055571f49f98d10941694c809b4ecd2","schema_version":"1.0","event_id":"sha256:c5097deb72d7642396b3dc8581b06f9e8055571f49f98d10941694c809b4ecd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/bundle.json","state_url":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QON4M44IPS2J3UXGDG2XSU2BLK/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-25T17:10:31Z","links":{"resolver":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK","bundle":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/bundle.json","state":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QON4M44IPS2J3UXGDG2XSU2BLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QON4M44IPS2J3UXGDG2XSU2BLK","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":"9c20e5cbb0e47d654a75f3aba07577001165c6c6ab7ef1b8ce3a18fbe68c4d93","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T15:27:26Z","title_canon_sha256":"7c8773799b827433ab6f4b63e814be144101d3d2e335bd4a5ede7f3f5762db04"},"schema_version":"1.0","source":{"id":"1704.06185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06185","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06185v2","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06185","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"QON4M44IPS2J","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QON4M44IPS2J3UXG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QON4M44I","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c5097deb72d7642396b3dc8581b06f9e8055571f49f98d10941694c809b4ecd2","target":"graph","created_at":"2026-05-18T00:30:30Z","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":"In this work, we introduce an online model for communication complexity. Analogous to how online algorithms receive their input piece-by-piece, our model presents one of the players, Bob, his input piece-by-piece, and has the players Alice and Bob cooperate to compute a result each time before the next piece is revealed to Bob. This model has a closer and more natural correspondence to dynamic data structures than classic communication models do, and hence presents a new perspective on data structures.\n  We first present a tight lower bound for the online set intersection problem in the online","authors_text":"Huacheng Yu, Josh Alman, Joshua R. Wang","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T15:27:26Z","title":"Cell-Probe Lower Bounds from Online Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06185","kind":"arxiv","version":2},"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:01304d690c67f1621f405389483d1d82699655dba0b4f760d444b979c84dc7e2","target":"record","created_at":"2026-05-18T00:30:30Z","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":"9c20e5cbb0e47d654a75f3aba07577001165c6c6ab7ef1b8ce3a18fbe68c4d93","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T15:27:26Z","title_canon_sha256":"7c8773799b827433ab6f4b63e814be144101d3d2e335bd4a5ede7f3f5762db04"},"schema_version":"1.0","source":{"id":"1704.06185","kind":"arxiv","version":2}},"canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","first_computed_at":"2026-05-18T00:30:30.493249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:30.493249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MwI50XWWsZF0zzE/g6CFvmQ6R7YR5Oj2g7vy6F9QrEz5f9zsGy7asLG44aOSxRiMJHnOCRA8cpvnDWLaH8dDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:30.493859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01304d690c67f1621f405389483d1d82699655dba0b4f760d444b979c84dc7e2","sha256:c5097deb72d7642396b3dc8581b06f9e8055571f49f98d10941694c809b4ecd2"],"state_sha256":"3ad8f847d1153a8c53d365ee2cf8c4f0238c0d1f2fab44247f7c40a624095065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MfRRgWZBbHQLr7qUVSm2RKatbomLN4b4CnyDHEsi8/px9LUCl/GikhfFaZAmfINcZhA7C2+CDGqM5XO1OAhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:10:31.321967Z","bundle_sha256":"faf78c1c9461cbc57fa9bfa7d8b40d07bda82b14a18581ab982d7177dc451e74"}}