{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SQJL3XTPLXL6WYNGFBF5R5DHU4","short_pith_number":"pith:SQJL3XTP","canonical_record":{"source":{"id":"2607.28159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T13:01:20Z","cross_cats_sorted":[],"title_canon_sha256":"70a1e0001af9b56db58c5d17362db5cabe0617cfebaec0b4cf88b9defd5a304a","abstract_canon_sha256":"ff5bc968bb9dea94171ba71d30e3405034eafd53e34b2debfa4c230702b450aa"},"schema_version":"1.0"},"canonical_sha256":"9412bdde6f5dd7eb61a6284bd8f467a711e969d14f32d72eacd48bae9e5d9455","source":{"kind":"arxiv","id":"2607.28159","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SQJL3XTPLXL6WYNGFBF5R5DHU4","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T13:01:20Z","cross_cats_sorted":[],"title_canon_sha256":"70a1e0001af9b56db58c5d17362db5cabe0617cfebaec0b4cf88b9defd5a304a","abstract_canon_sha256":"ff5bc968bb9dea94171ba71d30e3405034eafd53e34b2debfa4c230702b450aa"},"schema_version":"1.0"},"canonical_sha256":"9412bdde6f5dd7eb61a6284bd8f467a711e969d14f32d72eacd48bae9e5d9455","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9412bdde6f5dd7eb61a6284bd8f467a711e969d14f32d72eacd48bae9e5d9455","last_reissued_at":"2026-07-31T01:36:01.617950Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:01.617950Z"},"source_kind":"arxiv","source_id":"2607.28159","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-31T01:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t85P9iHbcPhSD8bhyWQ3S0QMP9pfF5tZkhmMJLtthpA5sc0AWsS7RX+96laGaqZfMRKR36X3MGFG41sSymvMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T23:45:55.892481Z"},"content_sha256":"88ff435ef4ba81135a719f7c27b7039959b7996fc4ba2032fa0b7e80b630b884","schema_version":"1.0","event_id":"sha256:88ff435ef4ba81135a719f7c27b7039959b7996fc4ba2032fa0b7e80b630b884"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SQJL3XTPLXL6WYNGFBF5R5DHU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"String Matching in (Block) Graphs: A Full Classification by Walk Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Bals, Pawe{\\l} Gawrychowski, Sebastian Angrick, Solon P. Pissis, Yuki Yonemoto","submitted_at":"2026-07-30T13:01:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28159","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/2607.28159/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-31T01:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKXAj2yD90vg48Q/xuYalCntP9vLKsh55rnEuQgHedxJQHZBdBRjA5YVd3azPBCUaqWuAYRasO9SP3CBkTapDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T23:45:55.893019Z"},"content_sha256":"bebdda3b561da37b9813a2651c13fb3e24b2fb24596868c9c9fc2cf21615dce0","schema_version":"1.0","event_id":"sha256:bebdda3b561da37b9813a2651c13fb3e24b2fb24596868c9c9fc2cf21615dce0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SQJL3XTPLXL6WYNGFBF5R5DHU4","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPICS.CPM.2025.5) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL:https://doi.org/10.4230/LIPIcs. CPM.2025.5,doi:10.4230/LIPICS.CPM.2025.5. [BGM13] Dany Breslauer, Roberto Grossi, and Filippo Mignosi. Simple real-time constant-space string matching.Theor. Comput. Sci., 483:2–9,","arxiv_id":"2607.28159","detector":"doi_compliance","evidence":{"ref_index":2025,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.4230/lipics","reconstructed_doi":"10.4230/LIPICS.CPM.2025.5"},"severity":"advisory","ref_index":2025,"audited_at":"2026-07-31T16:11:41.946218Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPICS.CPM.2025.5","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"075d1e74a0d06b124c485ddabe376336d52cf134abdaf6bf4f5f444243dae4ff","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14440,"payload_sha256":"c6aac562f13f8f92c624cdb06d38bb5a30e20cca8afefb2f95644c417628088d","signature_b64":"u0Bn47T9gfHIAN5PkJAs4veAdfa9btYYRdxCCIyE8aesRsC5JhO4Osz0Iny98JNT5jVQF2ow+gkunl+jKYbMAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T16:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8J4rFw76tU2zjDMJre2DS19MX4nVSU9UUOkbZ3JtFOqKeSlJEPEO4DnSJaPf1FiaSskRv+M1u32IQ8nBEB4ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T23:45:55.897095Z"},"content_sha256":"5295fa6c69f43ea23b8735e4412254ca5967fdb129846bc80afc4c809ee94d57","schema_version":"1.0","event_id":"sha256:5295fa6c69f43ea23b8735e4412254ca5967fdb129846bc80afc4c809ee94d57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/bundle.json","state_url":"https://pith.science/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/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-08-01T23:45:55Z","links":{"resolver":"https://pith.science/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4","bundle":"https://pith.science/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/bundle.json","state":"https://pith.science/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQJL3XTPLXL6WYNGFBF5R5DHU4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9J9oSjgdvs1q94z9Rq60fe5O4u4QP9rJgCofPDC9Q46TAOC3VIb/9XFf63LrJJ3TI5s+yuJoJPiuc0c1AgZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T23:45:55.899520Z","bundle_sha256":"ceacea4857d04608c5aa078eb2a289b8dd0689784637af19debf3635f4d20117"}}