{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UV25N452YNMXEGJU3EAM5AAXEY","short_pith_number":"pith:UV25N452","schema_version":"1.0","canonical_sha256":"a575d6f3bac359721934d900ce8017263720d7c050474e70c46feb40e710689c","source":{"kind":"arxiv","id":"2506.22728","version":2},"attestation_state":"computed","paper":{"title":"Counting Distinct (Non-)Crossing Substrings in Optimal Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Haruki Umezaki, Hideo Bannai, Hiroki Shibata, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2025-06-28T02:20:41Z","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.22728","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-28T02:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"0fd114afbcdb823d4596136c677c5acb47fc74418f28074703de06ca1faa1e23","abstract_canon_sha256":"0ec482b66dff4f6caf749e0a90ab578604b9a38869baf959bc84475fe651ce94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:14.527649Z","signature_b64":"j3QK5KOBMUwN4kBIcgxuTwr37oD6bdiMTiy3hU7uP3+p/240VAfYMs/+E0cg+uAQiFxaYDv2YrfQ+zDsZYQgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a575d6f3bac359721934d900ce8017263720d7c050474e70c46feb40e710689c","last_reissued_at":"2026-06-05T01:15:14.526815Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:14.526815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Distinct (Non-)Crossing Substrings in Optimal Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Haruki Umezaki, Hideo Bannai, Hiroki Shibata, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2025-06-28T02:20:41Z","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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22728","kind":"arxiv","version":2},"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/2506.22728/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.22728","created_at":"2026-06-05T01:15:14.526920+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22728v2","created_at":"2026-06-05T01:15:14.526920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22728","created_at":"2026-06-05T01:15:14.526920+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV25N452YNMX","created_at":"2026-06-05T01:15:14.526920+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV25N452YNMXEGJU","created_at":"2026-06-05T01:15:14.526920+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV25N452","created_at":"2026-06-05T01:15:14.526920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY","json":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY.json","graph_json":"https://pith.science/api/pith-number/UV25N452YNMXEGJU3EAM5AAXEY/graph.json","events_json":"https://pith.science/api/pith-number/UV25N452YNMXEGJU3EAM5AAXEY/events.json","paper":"https://pith.science/paper/UV25N452"},"agent_actions":{"view_html":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY","download_json":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY.json","view_paper":"https://pith.science/paper/UV25N452","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22728&json=true","fetch_graph":"https://pith.science/api/pith-number/UV25N452YNMXEGJU3EAM5AAXEY/graph.json","fetch_events":"https://pith.science/api/pith-number/UV25N452YNMXEGJU3EAM5AAXEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY/action/storage_attestation","attest_author":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY/action/author_attestation","sign_citation":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY/action/citation_signature","submit_replication":"https://pith.science/pith/UV25N452YNMXEGJU3EAM5AAXEY/action/replication_record"}},"created_at":"2026-06-05T01:15:14.526920+00:00","updated_at":"2026-06-05T01:15:14.526920+00:00"}