{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VKAT6GASQXFUH6ADFUEJ722I5Q","short_pith_number":"pith:VKAT6GAS","canonical_record":{"source":{"id":"2404.14235","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-22T14:46:30Z","cross_cats_sorted":[],"title_canon_sha256":"838486038bbca9eabedb783f8f57bd4d6bff0fee828a11983d3e3cb6434c507e","abstract_canon_sha256":"8c82ae72340089226fbd72a70ef48768361f0da8e90ad60348fe15ef3bf77126"},"schema_version":"1.0"},"canonical_sha256":"aa813f181285cb43f8032d089feb48ec0225016f2a93b5d21a8f1bdf2b5e621a","source":{"kind":"arxiv","id":"2404.14235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14235","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14235v1","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14235","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"VKAT6GASQXFU","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKAT6GASQXFUH6AD","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKAT6GAS","created_at":"2026-07-05T08:10:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VKAT6GASQXFUH6ADFUEJ722I5Q","target":"record","payload":{"canonical_record":{"source":{"id":"2404.14235","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-22T14:46:30Z","cross_cats_sorted":[],"title_canon_sha256":"838486038bbca9eabedb783f8f57bd4d6bff0fee828a11983d3e3cb6434c507e","abstract_canon_sha256":"8c82ae72340089226fbd72a70ef48768361f0da8e90ad60348fe15ef3bf77126"},"schema_version":"1.0"},"canonical_sha256":"aa813f181285cb43f8032d089feb48ec0225016f2a93b5d21a8f1bdf2b5e621a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:44.090195Z","signature_b64":"UN/yzSzYL3EcIYU0hFjN4D48OoZDFvMumksdYagOHu+aw9Wf66wmOsP+c73wvGtSj8CIBFvjblP5BxPLidrxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa813f181285cb43f8032d089feb48ec0225016f2a93b5d21a8f1bdf2b5e621a","last_reissued_at":"2026-07-05T08:10:44.089690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:44.089690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.14235","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-07-05T08:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWVdRpFCIm2Su4XUgaUCes+ROu88GdZfLTNJqMv9DWYoTj15fQ5IYi7mfMq4TFCN6o4JbKUiHPAzetsCGiQyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:23:19.093350Z"},"content_sha256":"1c65ad260a1725565e934f55b80f7e6ca73ccce48ee595c536ab99fa009826a1","schema_version":"1.0","event_id":"sha256:1c65ad260a1725565e934f55b80f7e6ca73ccce48ee595c536ab99fa009826a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VKAT6GASQXFUH6ADFUEJ722I5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the LCP Array of a Labeled Graph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Cenzato, Giovanni Manzini, Jarno Alanko, Nicola Cotumaccio, Nicola Prezza, Sung-Hwan Kim","submitted_at":"2024-04-22T14:46:30Z","abstract_excerpt":"The LCP array is an important tool in stringology, allowing to speed up pattern matching algorithms and enabling compact representations of the suffix tree. Recently, Conte et al. [DCC 2023] and Cotumaccio et al. [SPIRE 2023] extended the definition of this array to Wheeler DFAs and, ultimately, to arbitrary labeled graphs, proving that it can be used to efficiently solve matching statistics queries on the graph's paths. In this paper, we provide the first efficient algorithm building the LCP array of a directed labeled graph with $n$ nodes and $m$ edges labeled over an alphabet of size $\\sigm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14235","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.14235/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mc3r/brGlnex2wOlZen27JykGW2uXyBjv8YInvN1X9aZi8j//j9JxAjR8DiS5W7cOU0sbANzkpfYT6jcPAVQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:23:19.093732Z"},"content_sha256":"d523c775101b129171a041ca6891383d4b6711203abee7e3ac03dda28a490dad","schema_version":"1.0","event_id":"sha256:d523c775101b129171a041ca6891383d4b6711203abee7e3ac03dda28a490dad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/bundle.json","state_url":"https://pith.science/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/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-07-07T08:23:19Z","links":{"resolver":"https://pith.science/pith/VKAT6GASQXFUH6ADFUEJ722I5Q","bundle":"https://pith.science/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/bundle.json","state":"https://pith.science/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKAT6GASQXFUH6ADFUEJ722I5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VKAT6GASQXFUH6ADFUEJ722I5Q","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":"8c82ae72340089226fbd72a70ef48768361f0da8e90ad60348fe15ef3bf77126","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-22T14:46:30Z","title_canon_sha256":"838486038bbca9eabedb783f8f57bd4d6bff0fee828a11983d3e3cb6434c507e"},"schema_version":"1.0","source":{"id":"2404.14235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14235","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14235v1","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14235","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"VKAT6GASQXFU","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKAT6GASQXFUH6AD","created_at":"2026-07-05T08:10:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKAT6GAS","created_at":"2026-07-05T08:10:44Z"}],"graph_snapshots":[{"event_id":"sha256:d523c775101b129171a041ca6891383d4b6711203abee7e3ac03dda28a490dad","target":"graph","created_at":"2026-07-05T08:10:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.14235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The LCP array is an important tool in stringology, allowing to speed up pattern matching algorithms and enabling compact representations of the suffix tree. Recently, Conte et al. [DCC 2023] and Cotumaccio et al. [SPIRE 2023] extended the definition of this array to Wheeler DFAs and, ultimately, to arbitrary labeled graphs, proving that it can be used to efficiently solve matching statistics queries on the graph's paths. In this paper, we provide the first efficient algorithm building the LCP array of a directed labeled graph with $n$ nodes and $m$ edges labeled over an alphabet of size $\\sigm","authors_text":"Davide Cenzato, Giovanni Manzini, Jarno Alanko, Nicola Cotumaccio, Nicola Prezza, Sung-Hwan Kim","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-22T14:46:30Z","title":"Computing the LCP Array of a Labeled Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14235","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:1c65ad260a1725565e934f55b80f7e6ca73ccce48ee595c536ab99fa009826a1","target":"record","created_at":"2026-07-05T08:10:44Z","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":"8c82ae72340089226fbd72a70ef48768361f0da8e90ad60348fe15ef3bf77126","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-22T14:46:30Z","title_canon_sha256":"838486038bbca9eabedb783f8f57bd4d6bff0fee828a11983d3e3cb6434c507e"},"schema_version":"1.0","source":{"id":"2404.14235","kind":"arxiv","version":1}},"canonical_sha256":"aa813f181285cb43f8032d089feb48ec0225016f2a93b5d21a8f1bdf2b5e621a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa813f181285cb43f8032d089feb48ec0225016f2a93b5d21a8f1bdf2b5e621a","first_computed_at":"2026-07-05T08:10:44.089690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:44.089690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UN/yzSzYL3EcIYU0hFjN4D48OoZDFvMumksdYagOHu+aw9Wf66wmOsP+c73wvGtSj8CIBFvjblP5BxPLidrxCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:44.090195Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.14235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c65ad260a1725565e934f55b80f7e6ca73ccce48ee595c536ab99fa009826a1","sha256:d523c775101b129171a041ca6891383d4b6711203abee7e3ac03dda28a490dad"],"state_sha256":"eadfd54e9a1edba92ffa03b2f4c600605a2c654755be123de2af69401075e36c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYdEEJ2ek0HKrcqb1xRcLpW+cCsDDnAeZg/ByLyfVdDvfMCa0TJ80QxtxJkyMRhLL3jHo1fZgp4mBtu/iUqdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:23:19.095698Z","bundle_sha256":"4628171897247254aa4f822b2c714b8e098ae20064fe88f922f43a916185f2a2"}}