{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3QUA7WFIVXBBUBTLZDDCMPJDV6","short_pith_number":"pith:3QUA7WFI","schema_version":"1.0","canonical_sha256":"dc280fd8a8adc21a066bc8c6263d23af9bae3f806d351e5993a01ed4bf7f760f","source":{"kind":"arxiv","id":"2409.19576","version":1},"attestation_state":"computed","paper":{"title":"Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuhisa Seto, Shun Takahashi, Takashi Horiyama, Takuya Mieno","submitted_at":"2024-09-29T06:33:15Z","abstract_excerpt":"A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The notion of closed words was introduced by [Fici, WORDS 2011]. Recently, the maximum number of distinct closed factors occurring in a string was investigated by [Parshina and Puzynina, Theor. Comput. Sci. 2024], and an asymptotic tight bound was proved. In this paper, we propose two algorithms to count the distinct closed factors in a string T of length n over an alphabet of size \\sigma. The first algorithm runs in O(n l"},"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":"2409.19576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-29T06:33:15Z","cross_cats_sorted":[],"title_canon_sha256":"33f0e53d0de70ff8c78e359261bca25f8f467070fb6d8f88d3361089821a58a7","abstract_canon_sha256":"605f3eb2ab86ec43da18fa1cfe4478ddf0c73ba0c72ae9c89d388a6f977d8e7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:17.676612Z","signature_b64":"EBeVQfSqwBCbsG09qhtnLY/KRPUm/aJQbPI5A+HNUVHfqCqioP/0rGud3/OZSE9dihlSQezu0yZhT0yTs8RUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc280fd8a8adc21a066bc8c6263d23af9bae3f806d351e5993a01ed4bf7f760f","last_reissued_at":"2026-07-05T09:13:17.676169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:17.676169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuhisa Seto, Shun Takahashi, Takashi Horiyama, Takuya Mieno","submitted_at":"2024-09-29T06:33:15Z","abstract_excerpt":"A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The notion of closed words was introduced by [Fici, WORDS 2011]. Recently, the maximum number of distinct closed factors occurring in a string was investigated by [Parshina and Puzynina, Theor. Comput. Sci. 2024], and an asymptotic tight bound was proved. In this paper, we propose two algorithms to count the distinct closed factors in a string T of length n over an alphabet of size \\sigma. The first algorithm runs in O(n l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19576","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/2409.19576/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":"2409.19576","created_at":"2026-07-05T09:13:17.676232+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.19576v1","created_at":"2026-07-05T09:13:17.676232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19576","created_at":"2026-07-05T09:13:17.676232+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QUA7WFIVXBB","created_at":"2026-07-05T09:13:17.676232+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QUA7WFIVXBBUBTL","created_at":"2026-07-05T09:13:17.676232+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QUA7WFI","created_at":"2026-07-05T09:13:17.676232+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/3QUA7WFIVXBBUBTLZDDCMPJDV6","json":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6.json","graph_json":"https://pith.science/api/pith-number/3QUA7WFIVXBBUBTLZDDCMPJDV6/graph.json","events_json":"https://pith.science/api/pith-number/3QUA7WFIVXBBUBTLZDDCMPJDV6/events.json","paper":"https://pith.science/paper/3QUA7WFI"},"agent_actions":{"view_html":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6","download_json":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6.json","view_paper":"https://pith.science/paper/3QUA7WFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.19576&json=true","fetch_graph":"https://pith.science/api/pith-number/3QUA7WFIVXBBUBTLZDDCMPJDV6/graph.json","fetch_events":"https://pith.science/api/pith-number/3QUA7WFIVXBBUBTLZDDCMPJDV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6/action/storage_attestation","attest_author":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6/action/author_attestation","sign_citation":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6/action/citation_signature","submit_replication":"https://pith.science/pith/3QUA7WFIVXBBUBTLZDDCMPJDV6/action/replication_record"}},"created_at":"2026-07-05T09:13:17.676232+00:00","updated_at":"2026-07-05T09:13:17.676232+00:00"}