{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EHQPFEWSUIFGWTNFTVQCZAL5R2","short_pith_number":"pith:EHQPFEWS","canonical_record":{"source":{"id":"1511.02612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"869a7be2777b3d23a1a93802f88ac4f11ab8fdbf606df7d1b10763fe1c2d3ee0","abstract_canon_sha256":"5b7a0b3aa79976c0b38a4164e834ef71d02a42b0b8d24690a896d1b9429a3207"},"schema_version":"1.0"},"canonical_sha256":"21e0f292d2a20a6b4da59d602c817d8eac4f9372f40f529620ddd96cdd0212f2","source":{"kind":"arxiv","id":"1511.02612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02612","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02612v2","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02612","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"EHQPFEWSUIFG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EHQPFEWSUIFGWTNF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EHQPFEWS","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EHQPFEWSUIFGWTNFTVQCZAL5R2","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"869a7be2777b3d23a1a93802f88ac4f11ab8fdbf606df7d1b10763fe1c2d3ee0","abstract_canon_sha256":"5b7a0b3aa79976c0b38a4164e834ef71d02a42b0b8d24690a896d1b9429a3207"},"schema_version":"1.0"},"canonical_sha256":"21e0f292d2a20a6b4da59d602c817d8eac4f9372f40f529620ddd96cdd0212f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:30.468985Z","signature_b64":"OJzlEqbMF+jOMXJ/DpDZY/FgseexUH0Pgmhe3BclKRODfKEhtRmXzjdBd6cY39wGWoRawsFwBJAh21OkeTIICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21e0f292d2a20a6b4da59d602c817d8eac4f9372f40f529620ddd96cdd0212f2","last_reissued_at":"2026-05-18T01:17:30.468421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:30.468421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02612","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QMEQQZqNSIl3RChiw7JaZe2p9nu2h7ffWGdSDOAsFP7mxm6wr9lOt52meI/iHsgDBAx/Hxhb1rPKIKj+/eECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:45:03.606599Z"},"content_sha256":"f2241c3deea02df373538b807442811eec062d3d814704cbc8e181606f8b417a","schema_version":"1.0","event_id":"sha256:f2241c3deea02df373538b807442811eec062d3d814704cbc8e181606f8b417a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EHQPFEWSUIFGWTNFTVQCZAL5R2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Dynamic Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki, Pawe{\\l} Gawrychowski, Piotr Sankowski, Tomasz Kociumaka","submitted_at":"2015-11-09T09:38:47Z","abstract_excerpt":"In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical order (less, equal, greater) between two strings, LCP - calculates the longest common prefix of two strings. We present an efficient data structure for this problem, where an update requires only $O(\\log n)$ worst-case time with high probability, with $n$ being the total length of all strings in the collection, and a query takes constant worst-cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02612","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9M7vGl3+B3f4QFFj28fK6GFF18zhOyqU14oNwlDfvIcdvZJZOBl/wjfad4FdsUgZ5kC9yTFZNVWQn83+K/uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:45:03.607150Z"},"content_sha256":"3bcaacad2b0a488b23b860df7d9a0163b83211f6628ca7ecbb0df7f4da3caa1c","schema_version":"1.0","event_id":"sha256:3bcaacad2b0a488b23b860df7d9a0163b83211f6628ca7ecbb0df7f4da3caa1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/bundle.json","state_url":"https://pith.science/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/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-05T03:45:03Z","links":{"resolver":"https://pith.science/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2","bundle":"https://pith.science/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/bundle.json","state":"https://pith.science/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHQPFEWSUIFGWTNFTVQCZAL5R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EHQPFEWSUIFGWTNFTVQCZAL5R2","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":"5b7a0b3aa79976c0b38a4164e834ef71d02a42b0b8d24690a896d1b9429a3207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:38:47Z","title_canon_sha256":"869a7be2777b3d23a1a93802f88ac4f11ab8fdbf606df7d1b10763fe1c2d3ee0"},"schema_version":"1.0","source":{"id":"1511.02612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02612","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02612v2","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02612","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"EHQPFEWSUIFG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EHQPFEWSUIFGWTNF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EHQPFEWS","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3bcaacad2b0a488b23b860df7d9a0163b83211f6628ca7ecbb0df7f4da3caa1c","target":"graph","created_at":"2026-05-18T01:17: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 paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical order (less, equal, greater) between two strings, LCP - calculates the longest common prefix of two strings. We present an efficient data structure for this problem, where an update requires only $O(\\log n)$ worst-case time with high probability, with $n$ being the total length of all strings in the collection, and a query takes constant worst-cas","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki, Pawe{\\l} Gawrychowski, Piotr Sankowski, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:38:47Z","title":"Optimal Dynamic Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02612","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:f2241c3deea02df373538b807442811eec062d3d814704cbc8e181606f8b417a","target":"record","created_at":"2026-05-18T01:17: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":"5b7a0b3aa79976c0b38a4164e834ef71d02a42b0b8d24690a896d1b9429a3207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:38:47Z","title_canon_sha256":"869a7be2777b3d23a1a93802f88ac4f11ab8fdbf606df7d1b10763fe1c2d3ee0"},"schema_version":"1.0","source":{"id":"1511.02612","kind":"arxiv","version":2}},"canonical_sha256":"21e0f292d2a20a6b4da59d602c817d8eac4f9372f40f529620ddd96cdd0212f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21e0f292d2a20a6b4da59d602c817d8eac4f9372f40f529620ddd96cdd0212f2","first_computed_at":"2026-05-18T01:17:30.468421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:30.468421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJzlEqbMF+jOMXJ/DpDZY/FgseexUH0Pgmhe3BclKRODfKEhtRmXzjdBd6cY39wGWoRawsFwBJAh21OkeTIICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:30.468985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2241c3deea02df373538b807442811eec062d3d814704cbc8e181606f8b417a","sha256:3bcaacad2b0a488b23b860df7d9a0163b83211f6628ca7ecbb0df7f4da3caa1c"],"state_sha256":"a407f8385ed97aafc8372ce3f1c161bc2a3587a7bc7aa3dec37dab87165e6adb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3M2j4kyWeIeIy4HpNXxe8G9IaQa1vV7LIcJ4CEm2l12Co+57KGMYp3DXPyKeFzXnar3+FGj5L3MvxDFmyTSXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:45:03.610164Z","bundle_sha256":"4ea3152907bcfdfd1c11af7f585c8d34bcffb07f8aebca118b1a3d3c3829883c"}}