{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZMMBF6AXBT4KIKCXAWWLGZPC2V","short_pith_number":"pith:ZMMBF6AX","schema_version":"1.0","canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","source":{"kind":"arxiv","id":"1806.03102","version":1},"attestation_state":"computed","paper":{"title":"Compressed Communication Complexity of Longest Common Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eva Rotenberg, Inge Li G{\\o}rtz, Mikko Berggreen Ettienne, Philip Bille, Roberto Grossi","submitted_at":"2018-06-08T11:58:40Z","abstract_excerpt":"We consider the communication complexity of fundamental longest common prefix (Lcp) problems. In the simplest version, two parties, Alice and Bob, each hold a string, $A$ and $B$, and we want to determine the length of their longest common prefix $l=\\text{Lcp}(A,B)$ using as few rounds and bits of communication as possible. We show that if the longest common prefix of $A$ and $B$ is compressible, then we can significantly reduce the number of rounds compared to the optimal uncompressed protocol, while achieving the same (or fewer) bits of communication. Namely, if the longest common prefix has"},"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":"1806.03102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-08T11:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"455a64a493ccf5b4d9513dd85d21014d5b072db9a826716f592021af59ecea2f","abstract_canon_sha256":"b49945fd089c9f47fbb30f345be5579882c391f16e70fa88017fee27514c568f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:49.647816Z","signature_b64":"Hy6Gpmk6ymj8aWC4KA3/pCF2/WfQJVpKDzGX5f7Vl1CkZRYps/1R09oze5Q0C4Mw8I5Ef22FamQGJJTDgj9jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","last_reissued_at":"2026-05-18T00:13:49.647129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:49.647129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Communication Complexity of Longest Common Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eva Rotenberg, Inge Li G{\\o}rtz, Mikko Berggreen Ettienne, Philip Bille, Roberto Grossi","submitted_at":"2018-06-08T11:58:40Z","abstract_excerpt":"We consider the communication complexity of fundamental longest common prefix (Lcp) problems. In the simplest version, two parties, Alice and Bob, each hold a string, $A$ and $B$, and we want to determine the length of their longest common prefix $l=\\text{Lcp}(A,B)$ using as few rounds and bits of communication as possible. We show that if the longest common prefix of $A$ and $B$ is compressible, then we can significantly reduce the number of rounds compared to the optimal uncompressed protocol, while achieving the same (or fewer) bits of communication. Namely, if the longest common prefix has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03102","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.03102","created_at":"2026-05-18T00:13:49.647262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03102v1","created_at":"2026-05-18T00:13:49.647262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03102","created_at":"2026-05-18T00:13:49.647262+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMMBF6AXBT4K","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMMBF6AXBT4KIKCX","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMMBF6AX","created_at":"2026-05-18T12:33:07.085635+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/ZMMBF6AXBT4KIKCXAWWLGZPC2V","json":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V.json","graph_json":"https://pith.science/api/pith-number/ZMMBF6AXBT4KIKCXAWWLGZPC2V/graph.json","events_json":"https://pith.science/api/pith-number/ZMMBF6AXBT4KIKCXAWWLGZPC2V/events.json","paper":"https://pith.science/paper/ZMMBF6AX"},"agent_actions":{"view_html":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V","download_json":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V.json","view_paper":"https://pith.science/paper/ZMMBF6AX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03102&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMMBF6AXBT4KIKCXAWWLGZPC2V/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMMBF6AXBT4KIKCXAWWLGZPC2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/action/storage_attestation","attest_author":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/action/author_attestation","sign_citation":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/action/citation_signature","submit_replication":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/action/replication_record"}},"created_at":"2026-05-18T00:13:49.647262+00:00","updated_at":"2026-05-18T00:13:49.647262+00:00"}