{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UPZ6FGWPEICXGTRGQXXY3K2DIA","short_pith_number":"pith:UPZ6FGWP","canonical_record":{"source":{"id":"1211.0270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T19:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"f20da440ffaf9a13fa2de62ea9e139e6bfeadfdca4a030ace664b04b1247d7b5","abstract_canon_sha256":"384d4341f0152e8b4d8d6a87d13c325d3d47d0617e16b4aa77d7fb7434acd583"},"schema_version":"1.0"},"canonical_sha256":"a3f3e29acf2205734e2685ef8dab43403eecc926c450d1e2b3c26a28cd0f2c1b","source":{"kind":"arxiv","id":"1211.0270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0270","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0270v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0270","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"UPZ6FGWPEICX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UPZ6FGWPEICXGTRG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UPZ6FGWP","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UPZ6FGWPEICXGTRGQXXY3K2DIA","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T19:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"f20da440ffaf9a13fa2de62ea9e139e6bfeadfdca4a030ace664b04b1247d7b5","abstract_canon_sha256":"384d4341f0152e8b4d8d6a87d13c325d3d47d0617e16b4aa77d7fb7434acd583"},"schema_version":"1.0"},"canonical_sha256":"a3f3e29acf2205734e2685ef8dab43403eecc926c450d1e2b3c26a28cd0f2c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.486684Z","signature_b64":"ek9yrn0lnPVa/39AMCfTvJLP8Nkt1ovh4F7RonwV3i+PfEn3XpFeAVy0l3gl9WYXCvKMTgTTvAO+LhZdzDR5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f3e29acf2205734e2685ef8dab43403eecc926c450d1e2b3c26a28cd0f2c1b","last_reissued_at":"2026-05-18T03:27:32.486059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.486059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0270","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-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avG9mEFnRlth/N+QM2lbnwb3WUW6Ux+fSevH/45fKbosM2HdAL1cufkZMKWTCsFXNQjGWwMQf5RHRZku0WS/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:45:34.783796Z"},"content_sha256":"1a9c53b4defc5d0ebf1b563f85e865a5202e437d565b695fa63a779f3d02a75f","schema_version":"1.0","event_id":"sha256:1a9c53b4defc5d0ebf1b563f85e865a5202e437d565b695fa63a779f3d02a75f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UPZ6FGWPEICXGTRGQXXY3K2DIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Space Trade-Offs for Longest Common Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","submitted_at":"2012-11-01T19:55:11Z","abstract_excerpt":"We revisit the longest common extension (LCE) problem, that is, preprocess a string $T$ into a compact data structure that supports fast LCE queries. An LCE query takes a pair $(i,j)$ of indices in $T$ and returns the length of the longest common prefix of the suffixes of $T$ starting at positions $i$ and $j$. We study the time-space trade-offs for the problem, that is, the space used for the data structure vs. the worst-case time for answering an LCE query. Let $n$ be the length of $T$. Given a parameter $\\tau$, $1 \\leq \\tau \\leq n$, we show how to achieve either $O(\\infrac{n}{\\sqrt{\\tau}})$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0270","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-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yq/LZ9FYIqe4DtWTPBc8Inin+fEg+J2tFWZ2ObfsJC4W89OrsGmcmT8xo6KNoBI43EKG1M1CPZ0fMMAW1wpRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:45:34.784154Z"},"content_sha256":"fc8b3220662b22bca6cbc7def18484c948b0016fe494eab763160a43b3fc0d7f","schema_version":"1.0","event_id":"sha256:fc8b3220662b22bca6cbc7def18484c948b0016fe494eab763160a43b3fc0d7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/bundle.json","state_url":"https://pith.science/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/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-03T12:45:34Z","links":{"resolver":"https://pith.science/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA","bundle":"https://pith.science/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/bundle.json","state":"https://pith.science/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPZ6FGWPEICXGTRGQXXY3K2DIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UPZ6FGWPEICXGTRGQXXY3K2DIA","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":"384d4341f0152e8b4d8d6a87d13c325d3d47d0617e16b4aa77d7fb7434acd583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T19:55:11Z","title_canon_sha256":"f20da440ffaf9a13fa2de62ea9e139e6bfeadfdca4a030ace664b04b1247d7b5"},"schema_version":"1.0","source":{"id":"1211.0270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0270","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0270v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0270","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"UPZ6FGWPEICX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UPZ6FGWPEICXGTRG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UPZ6FGWP","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:fc8b3220662b22bca6cbc7def18484c948b0016fe494eab763160a43b3fc0d7f","target":"graph","created_at":"2026-05-18T03:27:32Z","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 revisit the longest common extension (LCE) problem, that is, preprocess a string $T$ into a compact data structure that supports fast LCE queries. An LCE query takes a pair $(i,j)$ of indices in $T$ and returns the length of the longest common prefix of the suffixes of $T$ starting at positions $i$ and $j$. We study the time-space trade-offs for the problem, that is, the space used for the data structure vs. the worst-case time for answering an LCE query. Let $n$ be the length of $T$. Given a parameter $\\tau$, $1 \\leq \\tau \\leq n$, we show how to achieve either $O(\\infrac{n}{\\sqrt{\\tau}})$ ","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T19:55:11Z","title":"Time-Space Trade-Offs for Longest Common Extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0270","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:1a9c53b4defc5d0ebf1b563f85e865a5202e437d565b695fa63a779f3d02a75f","target":"record","created_at":"2026-05-18T03:27:32Z","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":"384d4341f0152e8b4d8d6a87d13c325d3d47d0617e16b4aa77d7fb7434acd583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T19:55:11Z","title_canon_sha256":"f20da440ffaf9a13fa2de62ea9e139e6bfeadfdca4a030ace664b04b1247d7b5"},"schema_version":"1.0","source":{"id":"1211.0270","kind":"arxiv","version":2}},"canonical_sha256":"a3f3e29acf2205734e2685ef8dab43403eecc926c450d1e2b3c26a28cd0f2c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3f3e29acf2205734e2685ef8dab43403eecc926c450d1e2b3c26a28cd0f2c1b","first_computed_at":"2026-05-18T03:27:32.486059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.486059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ek9yrn0lnPVa/39AMCfTvJLP8Nkt1ovh4F7RonwV3i+PfEn3XpFeAVy0l3gl9WYXCvKMTgTTvAO+LhZdzDR5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.486684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a9c53b4defc5d0ebf1b563f85e865a5202e437d565b695fa63a779f3d02a75f","sha256:fc8b3220662b22bca6cbc7def18484c948b0016fe494eab763160a43b3fc0d7f"],"state_sha256":"a5b6bf4197802a7db830b36a5a659a1a1315bd6509387adb96607da588f7083d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVob0G2UT0kdWv9ZDmXvx8ZxaZ3TcYbIli+ciz+DSY2qheFmPwrlVyfzsR/m0JFOJzkPZOom6Tlce2CqE/Q6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:45:34.786065Z","bundle_sha256":"3863d84bf964ef9884c65fecea1e24e9930de748ae5eef9df9079d58fcadaec5"}}