{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:64WEZYTITJZECA33BTHOTRTM63","short_pith_number":"pith:64WEZYTI","canonical_record":{"source":{"id":"1312.2381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0b0dc821bc3f12471006f5841cc6da14d34fe085804bca7cbc6e1b8239cd1904","abstract_canon_sha256":"889906ff5a668e2378e7bbe39f06916e8e74dc8a1954dc4b5733d3d4111b5c85"},"schema_version":"1.0"},"canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","source":{"kind":"arxiv","id":"1312.2381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2381","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2381v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2381","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"64WEZYTITJZE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"64WEZYTITJZECA33","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"64WEZYTI","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:64WEZYTITJZECA33BTHOTRTM63","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0b0dc821bc3f12471006f5841cc6da14d34fe085804bca7cbc6e1b8239cd1904","abstract_canon_sha256":"889906ff5a668e2378e7bbe39f06916e8e74dc8a1954dc4b5733d3d4111b5c85"},"schema_version":"1.0"},"canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.390844Z","signature_b64":"dw3gi6L/aj0DDP3EAmNxR85CZ5x578Nc5I9svIAUgDGqAbtI5V7e22Mmwj/OUtc5c2c6NX9DI74B4XHAg5qDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","last_reissued_at":"2026-05-18T03:05:10.390371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.390371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2381","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iC8m9gTgVl+hYr867gM4MghiwdQ3pClwv0MgffZYxxlMQ6kLY6uv3LX5LDUQjz7sfNqr/oziDuI/LFF31BouDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:20:57.079485Z"},"content_sha256":"ea276b6337ee457e53f889254450a551902315b6eca5c9f4f2854778df89c93d","schema_version":"1.0","event_id":"sha256:ea276b6337ee457e53f889254450a551902315b6eca5c9f4f2854778df89c93d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:64WEZYTITJZECA33BTHOTRTM63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Longest Common Compatible Prefix Problem for Partial Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Alessio Langiu, Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2013-12-09T11:10:11Z","abstract_excerpt":"For a partial word $w$ the longest common compatible prefix of two positions $i,j$, denoted $lccp(i,j)$, is the largest $k$ such that $w[i,i+k-1]\\uparrow w[j,j+k-1]$, where $\\uparrow$ is the compatibility relation of partial words (it is not an equivalence relation). The LCCP problem is to preprocess a partial word in such a way that any query $lccp(i,j)$ about this word can be answered in $O(1)$ time. It is a natural generalization of the longest common prefix (LCP) problem for regular words, for which an $O(n)$ preprocessing time and $O(1)$ query time solution exists.\n  Recently an efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2381","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fk/zP+VsOdgcrBjKx5ZJnVZXWagvIC4DOY6Uv2scQLoZtKaX/kmHLC8N98wP7SVrvbHM18MHElBz2PRD99lTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:20:57.079908Z"},"content_sha256":"4fcadfeb32cc35510f620e14e35410c202df4f6353eda1ec396f5a0eae77678f","schema_version":"1.0","event_id":"sha256:4fcadfeb32cc35510f620e14e35410c202df4f6353eda1ec396f5a0eae77678f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/bundle.json","state_url":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64WEZYTITJZECA33BTHOTRTM63/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-31T09:20:57Z","links":{"resolver":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63","bundle":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/bundle.json","state":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64WEZYTITJZECA33BTHOTRTM63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:64WEZYTITJZECA33BTHOTRTM63","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":"889906ff5a668e2378e7bbe39f06916e8e74dc8a1954dc4b5733d3d4111b5c85","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","title_canon_sha256":"0b0dc821bc3f12471006f5841cc6da14d34fe085804bca7cbc6e1b8239cd1904"},"schema_version":"1.0","source":{"id":"1312.2381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2381","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2381v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2381","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"64WEZYTITJZE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"64WEZYTITJZECA33","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"64WEZYTI","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:4fcadfeb32cc35510f620e14e35410c202df4f6353eda1ec396f5a0eae77678f","target":"graph","created_at":"2026-05-18T03:05:10Z","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":"For a partial word $w$ the longest common compatible prefix of two positions $i,j$, denoted $lccp(i,j)$, is the largest $k$ such that $w[i,i+k-1]\\uparrow w[j,j+k-1]$, where $\\uparrow$ is the compatibility relation of partial words (it is not an equivalence relation). The LCCP problem is to preprocess a partial word in such a way that any query $lccp(i,j)$ about this word can be answered in $O(1)$ time. It is a natural generalization of the longest common prefix (LCP) problem for regular words, for which an $O(n)$ preprocessing time and $O(1)$ query time solution exists.\n  Recently an efficient","authors_text":"Alessio Langiu, Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","title":"A Note on the Longest Common Compatible Prefix Problem for Partial Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2381","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:ea276b6337ee457e53f889254450a551902315b6eca5c9f4f2854778df89c93d","target":"record","created_at":"2026-05-18T03:05:10Z","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":"889906ff5a668e2378e7bbe39f06916e8e74dc8a1954dc4b5733d3d4111b5c85","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","title_canon_sha256":"0b0dc821bc3f12471006f5841cc6da14d34fe085804bca7cbc6e1b8239cd1904"},"schema_version":"1.0","source":{"id":"1312.2381","kind":"arxiv","version":1}},"canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","first_computed_at":"2026-05-18T03:05:10.390371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:10.390371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dw3gi6L/aj0DDP3EAmNxR85CZ5x578Nc5I9svIAUgDGqAbtI5V7e22Mmwj/OUtc5c2c6NX9DI74B4XHAg5qDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:10.390844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea276b6337ee457e53f889254450a551902315b6eca5c9f4f2854778df89c93d","sha256:4fcadfeb32cc35510f620e14e35410c202df4f6353eda1ec396f5a0eae77678f"],"state_sha256":"d19c678ab2b78d3e95fd7fae3725e91ba6526ba3bf883ae2970f45e5ef6d8ced"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G1u9T41JIvq8i9y0BPEKP76fvOASSa4eXPQFHsKpkuGztjXtfthWBcAhserFWWpXyQzJJjkSVGioBRYv46EBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:20:57.083507Z","bundle_sha256":"6e764447e958ba6e24aeb8cb43ee3818c021490d2c417eca3f594872de6bf434"}}