{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UV25N452YNMXEGJU3EAM5AAXEY","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":"0ec482b66dff4f6caf749e0a90ab578604b9a38869baf959bc84475fe651ce94","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-28T02:20:41Z","title_canon_sha256":"0fd114afbcdb823d4596136c677c5acb47fc74418f28074703de06ca1faa1e23"},"schema_version":"1.0","source":{"id":"2506.22728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22728","created_at":"2026-06-05T01:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22728v2","created_at":"2026-06-05T01:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22728","created_at":"2026-06-05T01:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"UV25N452YNMX","created_at":"2026-06-05T01:15:14Z"},{"alias_kind":"pith_short_16","alias_value":"UV25N452YNMXEGJU","created_at":"2026-06-05T01:15:14Z"},{"alias_kind":"pith_short_8","alias_value":"UV25N452","created_at":"2026-06-05T01:15:14Z"}],"graph_snapshots":[{"event_id":"sha256:af95866d469193cf772d22d9b0777a8a7f07dc99db7f04dbd71a0cd58ae8e212","target":"graph","created_at":"2026-06-05T01:15:14Z","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/2506.22728/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $w$ be a string of length $n$. The problem of counting factors crossing a position -- Problem 64 from the textbook ``125 Problems in Text Algorithms'' [Crochemore, Lecroq, and Rytter, 2021] -- asks to count the number $\\mathcal{C}(w,k)$ (resp. $\\mathcal{N}(w,k)$) of distinct substrings in $w$ that have occurrences containing (resp. not containing) a position $k$ in $w$. The solutions provided in their textbook compute $\\mathcal{C}(w,k)$ and $\\mathcal{N}(w,k)$ in $O(n)$ time for a single position $k$ in $w$, and thus a direct application would require $O(n^2)$ time for all positions $k = 1,","authors_text":"Dominik K\\\"oppl, Haruki Umezaki, Hideo Bannai, Hiroki Shibata, Shunsuke Inenaga, Yuto Nakashima","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-28T02:20:41Z","title":"Counting Distinct (Non-)Crossing Substrings in Optimal Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22728","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:0531015eb0814e64dd1d6283d4bdc6f8b36a58e08dcfe750e4e78571e085a85a","target":"record","created_at":"2026-06-05T01:15:14Z","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":"0ec482b66dff4f6caf749e0a90ab578604b9a38869baf959bc84475fe651ce94","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-28T02:20:41Z","title_canon_sha256":"0fd114afbcdb823d4596136c677c5acb47fc74418f28074703de06ca1faa1e23"},"schema_version":"1.0","source":{"id":"2506.22728","kind":"arxiv","version":2}},"canonical_sha256":"a575d6f3bac359721934d900ce8017263720d7c050474e70c46feb40e710689c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a575d6f3bac359721934d900ce8017263720d7c050474e70c46feb40e710689c","first_computed_at":"2026-06-05T01:15:14.526815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:14.526815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3QK5KOBMUwN4kBIcgxuTwr37oD6bdiMTiy3hU7uP3+p/240VAfYMs/+E0cg+uAQiFxaYDv2YrfQ+zDsZYQgDw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:14.527649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.22728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0531015eb0814e64dd1d6283d4bdc6f8b36a58e08dcfe750e4e78571e085a85a","sha256:af95866d469193cf772d22d9b0777a8a7f07dc99db7f04dbd71a0cd58ae8e212"],"state_sha256":"f680e491f21300bf0cb633089767f3a5b93343e4dbafdccd7d20d85bec48403d"}