{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3QUA7WFIVXBBUBTLZDDCMPJDV6","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":"605f3eb2ab86ec43da18fa1cfe4478ddf0c73ba0c72ae9c89d388a6f977d8e7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-29T06:33:15Z","title_canon_sha256":"33f0e53d0de70ff8c78e359261bca25f8f467070fb6d8f88d3361089821a58a7"},"schema_version":"1.0","source":{"id":"2409.19576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.19576","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2409.19576v1","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19576","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"3QUA7WFIVXBB","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"3QUA7WFIVXBBUBTL","created_at":"2026-07-05T09:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"3QUA7WFI","created_at":"2026-07-05T09:13:17Z"}],"graph_snapshots":[{"event_id":"sha256:02c5ea0ee6cf1009ab0e7c3044b6bd64c7bdbf9c78a828edc6762f3f1183dd4a","target":"graph","created_at":"2026-07-05T09:13:17Z","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/2409.19576/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kazuhisa Seto, Shun Takahashi, Takashi Horiyama, Takuya Mieno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-29T06:33:15Z","title":"Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19576","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:45f1a44b3a30d63c3a402a4453644f37693592212fdd07b74709fa93ec067e1d","target":"record","created_at":"2026-07-05T09:13:17Z","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":"605f3eb2ab86ec43da18fa1cfe4478ddf0c73ba0c72ae9c89d388a6f977d8e7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-29T06:33:15Z","title_canon_sha256":"33f0e53d0de70ff8c78e359261bca25f8f467070fb6d8f88d3361089821a58a7"},"schema_version":"1.0","source":{"id":"2409.19576","kind":"arxiv","version":1}},"canonical_sha256":"dc280fd8a8adc21a066bc8c6263d23af9bae3f806d351e5993a01ed4bf7f760f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc280fd8a8adc21a066bc8c6263d23af9bae3f806d351e5993a01ed4bf7f760f","first_computed_at":"2026-07-05T09:13:17.676169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:13:17.676169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EBeVQfSqwBCbsG09qhtnLY/KRPUm/aJQbPI5A+HNUVHfqCqioP/0rGud3/OZSE9dihlSQezu0yZhT0yTs8RUAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:13:17.676612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.19576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45f1a44b3a30d63c3a402a4453644f37693592212fdd07b74709fa93ec067e1d","sha256:02c5ea0ee6cf1009ab0e7c3044b6bd64c7bdbf9c78a828edc6762f3f1183dd4a"],"state_sha256":"167df904b324fac96e08677cb864ed2f1d33ab75e9ea9f3c3dfadff6149737c5"}