{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X47CBZ5TTWGPXFJSSPNJN2AVQM","short_pith_number":"pith:X47CBZ5T","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"},"canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","source":{"kind":"arxiv","id":"1704.04472","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04472","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04472v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04472","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"X47CBZ5TTWGP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X47CBZ5TTWGPXFJS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X47CBZ5T","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X47CBZ5TTWGPXFJSSPNJN2AVQM","target":"record","payload":{"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"},"canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","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"},"source_kind":"arxiv","source_id":"1704.04472","source_version":2,"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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGRhLWcnJHAe17QXiKN/Eu4xu2NsQdK9sXQZ39AvESCNcmQxifHeH3N6zx8IMMkSREau1wzAR2nr2yUIPNitAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:48:39.705755Z"},"content_sha256":"9debc1e5907e810667f7c07ad8904c577896d013485ac97ffcb19e10ee07d413","schema_version":"1.0","event_id":"sha256:9debc1e5907e810667f7c07ad8904c577896d013485ac97ffcb19e10ee07d413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X47CBZ5TTWGPXFJSSPNJN2AVQM","target":"graph","payload":{"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"},"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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slVMK0/yTkMs+LAXFckeYhG282u9XWukbozAkaj69DWmw6TNMxN4t3U3VnEXSFicsLgoRY9hpS3Z30E9KMDVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:48:39.706406Z"},"content_sha256":"fbfe7144455457673ddfa131a96e7fc26a281cc999f0c1ddae5445fd6a821075","schema_version":"1.0","event_id":"sha256:fbfe7144455457673ddfa131a96e7fc26a281cc999f0c1ddae5445fd6a821075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/bundle.json","state_url":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/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-05-27T02:48:39Z","links":{"resolver":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM","bundle":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/bundle.json","state":"https://pith.science/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X47CBZ5TTWGPXFJSSPNJN2AVQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X47CBZ5TTWGPXFJSSPNJN2AVQM","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":"19951c3b076bc446904f75461f1c09a9eaf4b3374dbfcd594ae0e864606b879e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:34:08Z","title_canon_sha256":"dfe66a11606b408081587abc5eccf8d2eb3e76823f6d466fde19701224803da8"},"schema_version":"1.0","source":{"id":"1704.04472","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04472","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04472v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04472","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"X47CBZ5TTWGP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X47CBZ5TTWGPXFJS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X47CBZ5T","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:fbfe7144455457673ddfa131a96e7fc26a281cc999f0c1ddae5445fd6a821075","target":"graph","created_at":"2026-05-17T23:58:14Z","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":"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 ","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Patrick Hagge Cording, Tomasz Kociumaka, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:34:08Z","title":"Maximal Unbordered Factors of Random Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04472","kind":"arxiv","version":2},"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:9debc1e5907e810667f7c07ad8904c577896d013485ac97ffcb19e10ee07d413","target":"record","created_at":"2026-05-17T23:58:14Z","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":"19951c3b076bc446904f75461f1c09a9eaf4b3374dbfcd594ae0e864606b879e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:34:08Z","title_canon_sha256":"dfe66a11606b408081587abc5eccf8d2eb3e76823f6d466fde19701224803da8"},"schema_version":"1.0","source":{"id":"1704.04472","kind":"arxiv","version":2}},"canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf3e20e7b39d8cfb953293da96e815830606af3ceaca9ca9d601cde74dab926c","first_computed_at":"2026-05-17T23:58:14.997945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.997945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xTaktektndD20OAM2s5lWrKpNfR9yAPnHXw8tLCs7VtawZz/GA1VNJR9SlkOLXeSzNiVWfaDJcyssYUGtryBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.998547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04472","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9debc1e5907e810667f7c07ad8904c577896d013485ac97ffcb19e10ee07d413","sha256:fbfe7144455457673ddfa131a96e7fc26a281cc999f0c1ddae5445fd6a821075"],"state_sha256":"5e4941cbe35443bf394ed3875d4892060f0639cca44b4fae9be7b201a3bf5b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJeo82/YFcD2kYwsbUMnRIe90IntrQNND/mPn7roCJ3MasYb+IT3AlN5ViOYq2AQarEEzewkSm8rzcVd3sKLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:48:39.709895Z","bundle_sha256":"e77aeafad96861828a74968aaf9294ec73cca3fc44f1075185618bc6a9abcc7a"}}