{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZMMBF6AXBT4KIKCXAWWLGZPC2V","short_pith_number":"pith:ZMMBF6AX","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"},"canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","source":{"kind":"arxiv","id":"1806.03102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03102","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03102v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03102","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZMMBF6AXBT4K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZMMBF6AXBT4KIKCX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZMMBF6AX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZMMBF6AXBT4KIKCXAWWLGZPC2V","target":"record","payload":{"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"},"canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","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"},"source_kind":"arxiv","source_id":"1806.03102","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-18T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QHlj+m5d8urnxk19P+JOFWGxq6V/Aukm3HuP3lu6clrw5Ylpr3DNc2MIyDMhC9hz7vxVNcnXPaL/8Vn+d23Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:14:36.146454Z"},"content_sha256":"948df2ba1dc03bd2901f2e211a9881ec0587cc6715a604d5dab9a855e71a4375","schema_version":"1.0","event_id":"sha256:948df2ba1dc03bd2901f2e211a9881ec0587cc6715a604d5dab9a855e71a4375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZMMBF6AXBT4KIKCXAWWLGZPC2V","target":"graph","payload":{"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"},"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:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wY2kan2N85n9XQ07khp2pnViwOx8aV87OTz60oigVMrEqOvgKlbbvOIjE/cwHZ+ZILUUF36XJLBT42Mpx9/BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:14:36.147089Z"},"content_sha256":"e93be2cb873b459165ac8a9c91aaed1a6aeca030f3e9927747757a189685e381","schema_version":"1.0","event_id":"sha256:e93be2cb873b459165ac8a9c91aaed1a6aeca030f3e9927747757a189685e381"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/bundle.json","state_url":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/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-05-24T12:14:36Z","links":{"resolver":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V","bundle":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/bundle.json","state":"https://pith.science/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMMBF6AXBT4KIKCXAWWLGZPC2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZMMBF6AXBT4KIKCXAWWLGZPC2V","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":"b49945fd089c9f47fbb30f345be5579882c391f16e70fa88017fee27514c568f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-08T11:58:40Z","title_canon_sha256":"455a64a493ccf5b4d9513dd85d21014d5b072db9a826716f592021af59ecea2f"},"schema_version":"1.0","source":{"id":"1806.03102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03102","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03102v1","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03102","created_at":"2026-05-18T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZMMBF6AXBT4K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZMMBF6AXBT4KIKCX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZMMBF6AX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e93be2cb873b459165ac8a9c91aaed1a6aeca030f3e9927747757a189685e381","target":"graph","created_at":"2026-05-18T00:13:49Z","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":"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","authors_text":"Eva Rotenberg, Inge Li G{\\o}rtz, Mikko Berggreen Ettienne, Philip Bille, Roberto Grossi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-08T11:58:40Z","title":"Compressed Communication Complexity of Longest Common Prefixes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03102","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:948df2ba1dc03bd2901f2e211a9881ec0587cc6715a604d5dab9a855e71a4375","target":"record","created_at":"2026-05-18T00:13:49Z","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":"b49945fd089c9f47fbb30f345be5579882c391f16e70fa88017fee27514c568f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-08T11:58:40Z","title_canon_sha256":"455a64a493ccf5b4d9513dd85d21014d5b072db9a826716f592021af59ecea2f"},"schema_version":"1.0","source":{"id":"1806.03102","kind":"arxiv","version":1}},"canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb1812f8170cf8a4285705acb365e2d559f9f4686bbaa95fb2c817f26110b295","first_computed_at":"2026-05-18T00:13:49.647129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:49.647129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hy6Gpmk6ymj8aWC4KA3/pCF2/WfQJVpKDzGX5f7Vl1CkZRYps/1R09oze5Q0C4Mw8I5Ef22FamQGJJTDgj9jBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:49.647816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:948df2ba1dc03bd2901f2e211a9881ec0587cc6715a604d5dab9a855e71a4375","sha256:e93be2cb873b459165ac8a9c91aaed1a6aeca030f3e9927747757a189685e381"],"state_sha256":"43641281067c3460d6e800069c2724cf9f63c7462509007c4bafa4799c33f207"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ytvuECwk1dousVo0Y+xdCi+C/By8t3XF9redl8udp0BMFteIv4ZG+delFgZhi2+XTjk3OckYDzg6bla4oEIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:14:36.150633Z","bundle_sha256":"b024881ca6b48769e02a96881bf1244b2c1b767393967497d2ab66bbf4acdeed"}}