{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SQJL3XTPLXL6WYNGFBF5R5DHU4","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ff5bc968bb9dea94171ba71d30e3405034eafd53e34b2debfa4c230702b450aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T13:01:20Z","title_canon_sha256":"70a1e0001af9b56db58c5d17362db5cabe0617cfebaec0b4cf88b9defd5a304a"},"schema_version":"1.0","source":{"id":"2607.28159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28159","created_at":"2026-07-31T01:36:01Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28159v1","created_at":"2026-07-31T01:36:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28159","created_at":"2026-07-31T01:36:01Z"},{"alias_kind":"pith_short_12","alias_value":"SQJL3XTPLXL6","created_at":"2026-07-31T01:36:01Z"},{"alias_kind":"pith_short_16","alias_value":"SQJL3XTPLXL6WYNG","created_at":"2026-07-31T01:36:01Z"},{"alias_kind":"pith_short_8","alias_value":"SQJL3XTP","created_at":"2026-07-31T01:36:01Z"}],"graph_snapshots":[{"event_id":"sha256:bebdda3b561da37b9813a2651c13fb3e24b2fb24596868c9c9fc2cf21615dce0","target":"graph","created_at":"2026-07-31T01:36:01Z","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/2607.28159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider directed graphs in which the nodes are labeled with strings. A walk in such a graph naturally corresponds to the concatenation of the visited nodes' labels. These graphs are widely used in bioinformatics to compactly describe large collections of highly similar genomes. Given such a graph $G=(V,E)$ and a pattern of length $m$, we seek a walk whose corresponding string has an occurrence of the pattern. We call this the SMLG problem. Amir et al. [J. Algorithms, 2000] showed that SMLG can be solved in $\\mathcal{O}(m|E| + N)$ time, where $N$ is the total length of all node labels. Equi","authors_text":"Ben Bals, Pawe{\\l} Gawrychowski, Sebastian Angrick, Solon P. Pissis, Yuki Yonemoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T13:01:20Z","title":"String Matching in (Block) Graphs: A Full Classification by Walk Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28159","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:88ff435ef4ba81135a719f7c27b7039959b7996fc4ba2032fa0b7e80b630b884","target":"record","created_at":"2026-07-31T01:36:01Z","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":"ff5bc968bb9dea94171ba71d30e3405034eafd53e34b2debfa4c230702b450aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T13:01:20Z","title_canon_sha256":"70a1e0001af9b56db58c5d17362db5cabe0617cfebaec0b4cf88b9defd5a304a"},"schema_version":"1.0","source":{"id":"2607.28159","kind":"arxiv","version":1}},"canonical_sha256":"9412bdde6f5dd7eb61a6284bd8f467a711e969d14f32d72eacd48bae9e5d9455","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9412bdde6f5dd7eb61a6284bd8f467a711e969d14f32d72eacd48bae9e5d9455","first_computed_at":"2026-07-31T01:36:01.617950Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:36:01.617950Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88ff435ef4ba81135a719f7c27b7039959b7996fc4ba2032fa0b7e80b630b884","sha256:bebdda3b561da37b9813a2651c13fb3e24b2fb24596868c9c9fc2cf21615dce0","sha256:5295fa6c69f43ea23b8735e4412254ca5967fdb129846bc80afc4c809ee94d57"],"state_sha256":"0e17659f08717f1080fd7ba87e9bddeb2e74aa5955a3778369b2b591cd38cb38"}