{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5CUO6U4LPEKHVEVG2SEPK2T5EZ","short_pith_number":"pith:5CUO6U4L","schema_version":"1.0","canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","source":{"kind":"arxiv","id":"1504.07406","version":1},"attestation_state":"computed","paper":{"title":"On Maximal Unbordered Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya","submitted_at":"2015-04-28T10:08:20Z","abstract_excerpt":"Given a string $S$ of length $n$, its maximal unbordered factor is the longest factor which does not have a border. In this work we investigate the relationship between $n$ and the length of the maximal unbordered factor of $S$. We prove that for the alphabet of size $\\sigma \\ge 5$ the expected length of the maximal unbordered factor of a string of length~$n$ is at least $0.99 n$ (for sufficiently large values of $n$). As an application of this result, we propose a new algorithm for computing the maximal unbordered factor of a string."},"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":"1504.07406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T10:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"9fc106749043e4031e1ceb88f5a8f1bcb04a9bb1b107ffbe6dd67dcdd2ffc650","abstract_canon_sha256":"69c6a448322023910283a394838e5a1fff2199776232a2452754546f3ba9e60a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.810259Z","signature_b64":"65iKHaQLTXY1pGvFaeH7Y3zwOfKohqturHvx8P/CSLwrWcdDdrcIfY4XNMKUO3gMAELfAIAROHUWoSchZ6EeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","last_reissued_at":"2026-05-18T02:17:34.809590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.809590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Maximal Unbordered Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya","submitted_at":"2015-04-28T10:08:20Z","abstract_excerpt":"Given a string $S$ of length $n$, its maximal unbordered factor is the longest factor which does not have a border. In this work we investigate the relationship between $n$ and the length of the maximal unbordered factor of $S$. We prove that for the alphabet of size $\\sigma \\ge 5$ the expected length of the maximal unbordered factor of a string of length~$n$ is at least $0.99 n$ (for sufficiently large values of $n$). As an application of this result, we propose a new algorithm for computing the maximal unbordered factor of a string."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07406","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":""},"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":"1504.07406","created_at":"2026-05-18T02:17:34.809693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07406v1","created_at":"2026-05-18T02:17:34.809693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07406","created_at":"2026-05-18T02:17:34.809693+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CUO6U4LPEKH","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CUO6U4LPEKHVEVG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CUO6U4L","created_at":"2026-05-18T12:29:05.191682+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/5CUO6U4LPEKHVEVG2SEPK2T5EZ","json":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ.json","graph_json":"https://pith.science/api/pith-number/5CUO6U4LPEKHVEVG2SEPK2T5EZ/graph.json","events_json":"https://pith.science/api/pith-number/5CUO6U4LPEKHVEVG2SEPK2T5EZ/events.json","paper":"https://pith.science/paper/5CUO6U4L"},"agent_actions":{"view_html":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ","download_json":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ.json","view_paper":"https://pith.science/paper/5CUO6U4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07406&json=true","fetch_graph":"https://pith.science/api/pith-number/5CUO6U4LPEKHVEVG2SEPK2T5EZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5CUO6U4LPEKHVEVG2SEPK2T5EZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/action/storage_attestation","attest_author":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/action/author_attestation","sign_citation":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/action/citation_signature","submit_replication":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/action/replication_record"}},"created_at":"2026-05-18T02:17:34.809693+00:00","updated_at":"2026-05-18T02:17:34.809693+00:00"}