{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5CUO6U4LPEKHVEVG2SEPK2T5EZ","short_pith_number":"pith:5CUO6U4L","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"},"canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","source":{"kind":"arxiv","id":"1504.07406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07406","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07406v1","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07406","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"5CUO6U4LPEKH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5CUO6U4LPEKHVEVG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5CUO6U4L","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5CUO6U4LPEKHVEVG2SEPK2T5EZ","target":"record","payload":{"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"},"canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","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"},"source_kind":"arxiv","source_id":"1504.07406","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kw9J/YYRjWip9apIXBkqShbTwojm6on1LXN9S+4NcZHAbtYibft/BP/w60LNlGyQKot/cQD5vDraSZD72PHjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:27:18.990993Z"},"content_sha256":"7eecb5bbb890e8ab53cbde7eaa20236aec41efaf597b15b72d8417857acd5b17","schema_version":"1.0","event_id":"sha256:7eecb5bbb890e8ab53cbde7eaa20236aec41efaf597b15b72d8417857acd5b17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5CUO6U4LPEKHVEVG2SEPK2T5EZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqC9mP2NOlI4zQxdwNX1hZ9H5uHDXSoJ+R4sUZdHe1iFgw3ccRgNNxgL9ZZs9jrgz31fOQh332cdPAZetCA0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:27:18.991345Z"},"content_sha256":"e9fe4d05712b4214b5c708e163963fc6a18d2b60fe35c3e5833b26b918be283d","schema_version":"1.0","event_id":"sha256:e9fe4d05712b4214b5c708e163963fc6a18d2b60fe35c3e5833b26b918be283d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/bundle.json","state_url":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T21:27:18Z","links":{"resolver":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ","bundle":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/bundle.json","state":"https://pith.science/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CUO6U4LPEKHVEVG2SEPK2T5EZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5CUO6U4LPEKHVEVG2SEPK2T5EZ","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":"69c6a448322023910283a394838e5a1fff2199776232a2452754546f3ba9e60a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T10:08:20Z","title_canon_sha256":"9fc106749043e4031e1ceb88f5a8f1bcb04a9bb1b107ffbe6dd67dcdd2ffc650"},"schema_version":"1.0","source":{"id":"1504.07406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07406","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07406v1","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07406","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"5CUO6U4LPEKH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5CUO6U4LPEKHVEVG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5CUO6U4L","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e9fe4d05712b4214b5c708e163963fc6a18d2b60fe35c3e5833b26b918be283d","target":"graph","created_at":"2026-05-18T02:17:34Z","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"},"paper":{"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.","authors_text":"Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T10:08:20Z","title":"On Maximal Unbordered Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07406","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:7eecb5bbb890e8ab53cbde7eaa20236aec41efaf597b15b72d8417857acd5b17","target":"record","created_at":"2026-05-18T02:17:34Z","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":"69c6a448322023910283a394838e5a1fff2199776232a2452754546f3ba9e60a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T10:08:20Z","title_canon_sha256":"9fc106749043e4031e1ceb88f5a8f1bcb04a9bb1b107ffbe6dd67dcdd2ffc650"},"schema_version":"1.0","source":{"id":"1504.07406","kind":"arxiv","version":1}},"canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8a8ef538b79147a92a6d488f56a7d26421d1ddf572318b4bfe066ed052ea648","first_computed_at":"2026-05-18T02:17:34.809590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:34.809590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65iKHaQLTXY1pGvFaeH7Y3zwOfKohqturHvx8P/CSLwrWcdDdrcIfY4XNMKUO3gMAELfAIAROHUWoSchZ6EeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:34.810259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eecb5bbb890e8ab53cbde7eaa20236aec41efaf597b15b72d8417857acd5b17","sha256:e9fe4d05712b4214b5c708e163963fc6a18d2b60fe35c3e5833b26b918be283d"],"state_sha256":"8c37f687adcd33bef521371ed99a5cc6beac5a58503d2f1fdd982aba242f1f9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"302z99QFHluLhCCoTdvMu1ebbeU2CrVHKPlaVSmWIXnKRmzA0fMHc2KcL7u6gNDAuT0L1hA5PEp5KqW0jbI+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:27:18.993355Z","bundle_sha256":"e3de7a02b4b8ef2b34d7fa15941717c41b2008a6ae0a5cb64e3c12ac0ca2fcdf"}}