{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RP6RORIZHHOBWSLIYONIWVQVUI","short_pith_number":"pith:RP6RORIZ","schema_version":"1.0","canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","source":{"kind":"arxiv","id":"1805.09924","version":2},"attestation_state":"computed","paper":{"title":"Longest Unbordered Factor in Quasilinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manal Mohamed, Ritu Kundu, Solon P. Pissis, Tomasz Kociumaka","submitted_at":"2018-05-24T22:14:27Z","abstract_excerpt":"A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a border. Here an O(n log n)-time with high probability (or O(n log n log^2 log n)-time deterministic) algorithm to compute the Longest Unbordered Factor Array of w for general alphabets is presented, where n is the length of w. This array specifies the length of the maximal unbordered factor starting at each position of w. This is a major improvement on the running time of the currently best worst-case algorithm working in"},"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":"1805.09924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T22:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"839bbcbfd7584960e1590554f97ecf7b5a8b198eb4bfd8702e8b63a4d233c787","abstract_canon_sha256":"84b8a7b3a37eb792772d471625f861b5d94f2c7ca73abd27b2d650863b6b371b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.804907Z","signature_b64":"SrCgphBEbN6TPdf/+lNjjZrYqHPuWZx82SLGz+5jZrGbNDnkbhsfKBs1iSj3Cy+PCtqa0h8l63zQi2oAd2kVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","last_reissued_at":"2026-05-18T00:11:56.804357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.804357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Unbordered Factor in Quasilinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manal Mohamed, Ritu Kundu, Solon P. Pissis, Tomasz Kociumaka","submitted_at":"2018-05-24T22:14:27Z","abstract_excerpt":"A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a border. Here an O(n log n)-time with high probability (or O(n log n log^2 log n)-time deterministic) algorithm to compute the Longest Unbordered Factor Array of w for general alphabets is presented, where n is the length of w. This array specifies the length of the maximal unbordered factor starting at each position of w. This is a major improvement on the running time of the currently best worst-case algorithm working in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09924","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":"1805.09924","created_at":"2026-05-18T00:11:56.804437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09924v2","created_at":"2026-05-18T00:11:56.804437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09924","created_at":"2026-05-18T00:11:56.804437+00:00"},{"alias_kind":"pith_short_12","alias_value":"RP6RORIZHHOB","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RP6RORIZHHOBWSLI","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RP6RORIZ","created_at":"2026-05-18T12:32:50.500415+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/RP6RORIZHHOBWSLIYONIWVQVUI","json":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI.json","graph_json":"https://pith.science/api/pith-number/RP6RORIZHHOBWSLIYONIWVQVUI/graph.json","events_json":"https://pith.science/api/pith-number/RP6RORIZHHOBWSLIYONIWVQVUI/events.json","paper":"https://pith.science/paper/RP6RORIZ"},"agent_actions":{"view_html":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI","download_json":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI.json","view_paper":"https://pith.science/paper/RP6RORIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09924&json=true","fetch_graph":"https://pith.science/api/pith-number/RP6RORIZHHOBWSLIYONIWVQVUI/graph.json","fetch_events":"https://pith.science/api/pith-number/RP6RORIZHHOBWSLIYONIWVQVUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/action/storage_attestation","attest_author":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/action/author_attestation","sign_citation":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/action/citation_signature","submit_replication":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/action/replication_record"}},"created_at":"2026-05-18T00:11:56.804437+00:00","updated_at":"2026-05-18T00:11:56.804437+00:00"}