{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QON4M44IPS2J3UXGDG2XSU2BLK","short_pith_number":"pith:QON4M44I","schema_version":"1.0","canonical_sha256":"839bc673887cb49dd2e619b57953415aaeafe4238811bbebd1e7b3ccb653a564","source":{"kind":"arxiv","id":"1704.06185","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.06185","created_at":"2026-05-18T00:30:30.493350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06185v2","created_at":"2026-05-18T00:30:30.493350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06185","created_at":"2026-05-18T00:30:30.493350+00:00"},{"alias_kind":"pith_short_12","alias_value":"QON4M44IPS2J","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QON4M44IPS2J3UXG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QON4M44I","created_at":"2026-05-18T12:31:39.905425+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/QON4M44IPS2J3UXGDG2XSU2BLK","json":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK.json","graph_json":"https://pith.science/api/pith-number/QON4M44IPS2J3UXGDG2XSU2BLK/graph.json","events_json":"https://pith.science/api/pith-number/QON4M44IPS2J3UXGDG2XSU2BLK/events.json","paper":"https://pith.science/paper/QON4M44I"},"agent_actions":{"view_html":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK","download_json":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK.json","view_paper":"https://pith.science/paper/QON4M44I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06185&json=true","fetch_graph":"https://pith.science/api/pith-number/QON4M44IPS2J3UXGDG2XSU2BLK/graph.json","fetch_events":"https://pith.science/api/pith-number/QON4M44IPS2J3UXGDG2XSU2BLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/action/storage_attestation","attest_author":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/action/author_attestation","sign_citation":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/action/citation_signature","submit_replication":"https://pith.science/pith/QON4M44IPS2J3UXGDG2XSU2BLK/action/replication_record"}},"created_at":"2026-05-18T00:30:30.493350+00:00","updated_at":"2026-05-18T00:30:30.493350+00:00"}