{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X47CBZ5TTWGPXFJSSPNJN2AVQM","short_pith_number":"pith:X47CBZ5T","schema_version":"1.0","canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","source":{"kind":"arxiv","id":"1704.04472","version":2},"attestation_state":"computed","paper":{"title":"Maximal Unbordered Factors of Random Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Patrick Hagge Cording, Tomasz Kociumaka, Travis Gagie","submitted_at":"2017-04-14T16:34:08Z","abstract_excerpt":"A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself. Loptev, Kucherov, and Starikovskaya [CPM 2015] conjectured the following: If we pick a string of length $n$ from a fixed non-unary alphabet uniformly at random, then the expected maximum length of its unbordered factors is $n - O(1)$. We confirm this conjecture by proving that the expected value is, in fact, ${n - \\Theta(\\sigma^{-1})}$, where $\\sigma$ is the size of the alphabet. This immediately implies that we can find such a maximal "},"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":"1704.04472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"dfe66a11606b408081587abc5eccf8d2eb3e76823f6d466fde19701224803da8","abstract_canon_sha256":"19951c3b076bc446904f75461f1c09a9eaf4b3374dbfcd594ae0e864606b879e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.998547Z","signature_b64":"1xTaktektndD20OAM2s5lWrKpNfR9yAPnHXw8tLCs7VtawZz/GA1VNJR9SlkOLXeSzNiVWfaDJcyssYUGtryBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","last_reissued_at":"2026-05-17T23:58:14.997945Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.997945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Unbordered Factors of Random Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Patrick Hagge Cording, Tomasz Kociumaka, Travis Gagie","submitted_at":"2017-04-14T16:34:08Z","abstract_excerpt":"A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself. Loptev, Kucherov, and Starikovskaya [CPM 2015] conjectured the following: If we pick a string of length $n$ from a fixed non-unary alphabet uniformly at random, then the expected maximum length of its unbordered factors is $n - O(1)$. We confirm this conjecture by proving that the expected value is, in fact, ${n - \\Theta(\\sigma^{-1})}$, where $\\sigma$ is the size of the alphabet. This immediately implies that we can find such a maximal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04472","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":""},"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":"1704.04472","created_at":"2026-05-17T23:58:14.998028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04472v2","created_at":"2026-05-17T23:58:14.998028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04472","created_at":"2026-05-17T23:58:14.998028+00:00"},{"alias_kind":"pith_short_12","alias_value":"X47CBZ5TTWGP","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X47CBZ5TTWGPXFJS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X47CBZ5T","created_at":"2026-05-18T12:31:53.515858+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/X47CBZ5TTWGPXFJSSPNJN2AVQM","json":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM.json","graph_json":"https://pith.science/api/pith-number/X47CBZ5TTWGPXFJSSPNJN2AVQM/graph.json","events_json":"https://pith.science/api/pith-number/X47CBZ5TTWGPXFJSSPNJN2AVQM/events.json","paper":"https://pith.science/paper/X47CBZ5T"},"agent_actions":{"view_html":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM","download_json":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM.json","view_paper":"https://pith.science/paper/X47CBZ5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04472&json=true","fetch_graph":"https://pith.science/api/pith-number/X47CBZ5TTWGPXFJSSPNJN2AVQM/graph.json","fetch_events":"https://pith.science/api/pith-number/X47CBZ5TTWGPXFJSSPNJN2AVQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/action/storage_attestation","attest_author":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/action/author_attestation","sign_citation":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/action/citation_signature","submit_replication":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/action/replication_record"}},"created_at":"2026-05-17T23:58:14.998028+00:00","updated_at":"2026-05-17T23:58:14.998028+00:00"}