{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RP6RORIZHHOBWSLIYONIWVQVUI","short_pith_number":"pith:RP6RORIZ","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"},"canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","source":{"kind":"arxiv","id":"1805.09924","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09924","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09924v2","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09924","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"RP6RORIZHHOB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RP6RORIZHHOBWSLI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RP6RORIZ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RP6RORIZHHOBWSLIYONIWVQVUI","target":"record","payload":{"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"},"canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","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"},"source_kind":"arxiv","source_id":"1805.09924","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-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n58j387h7y97rcHHRYpStF5nrY0jsSqnwKY69/VJsFqclRu3y4b1AeQ4mlZ7c1BIO1QTMxni3fmHr1GsfzAxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:09.274620Z"},"content_sha256":"24b21a2ac78ee6007a0d6b96e8f97282883947135208724b2451449bfd631854","schema_version":"1.0","event_id":"sha256:24b21a2ac78ee6007a0d6b96e8f97282883947135208724b2451449bfd631854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RP6RORIZHHOBWSLIYONIWVQVUI","target":"graph","payload":{"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"},"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-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+yoejvmINre7fic9e7tpMOseJ1fDWDdzsd2+GMJDNPUN9VHHam+Ne0FbSdqk6cBX2Dh2WEq2ZD4GnRNasrEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:09.275011Z"},"content_sha256":"fe253a6c81cbce71019ac1fab40659b466e9eb075db3b51fdfb388aeda80cbf7","schema_version":"1.0","event_id":"sha256:fe253a6c81cbce71019ac1fab40659b466e9eb075db3b51fdfb388aeda80cbf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/bundle.json","state_url":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RP6RORIZHHOBWSLIYONIWVQVUI/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-30T08:40:09Z","links":{"resolver":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI","bundle":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/bundle.json","state":"https://pith.science/pith/RP6RORIZHHOBWSLIYONIWVQVUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RP6RORIZHHOBWSLIYONIWVQVUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RP6RORIZHHOBWSLIYONIWVQVUI","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":"84b8a7b3a37eb792772d471625f861b5d94f2c7ca73abd27b2d650863b6b371b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T22:14:27Z","title_canon_sha256":"839bbcbfd7584960e1590554f97ecf7b5a8b198eb4bfd8702e8b63a4d233c787"},"schema_version":"1.0","source":{"id":"1805.09924","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09924","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09924v2","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09924","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"RP6RORIZHHOB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RP6RORIZHHOBWSLI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RP6RORIZ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:fe253a6c81cbce71019ac1fab40659b466e9eb075db3b51fdfb388aeda80cbf7","target":"graph","created_at":"2026-05-18T00:11:56Z","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 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","authors_text":"Manal Mohamed, Ritu Kundu, Solon P. Pissis, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T22:14:27Z","title":"Longest Unbordered Factor in Quasilinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09924","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:24b21a2ac78ee6007a0d6b96e8f97282883947135208724b2451449bfd631854","target":"record","created_at":"2026-05-18T00:11:56Z","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":"84b8a7b3a37eb792772d471625f861b5d94f2c7ca73abd27b2d650863b6b371b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T22:14:27Z","title_canon_sha256":"839bbcbfd7584960e1590554f97ecf7b5a8b198eb4bfd8702e8b63a4d233c787"},"schema_version":"1.0","source":{"id":"1805.09924","kind":"arxiv","version":2}},"canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bfd17451939dc1b4968c39a8b5615a23abd1e438f5c8b260d8efaaaee6649bd","first_computed_at":"2026-05-18T00:11:56.804357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.804357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrCgphBEbN6TPdf/+lNjjZrYqHPuWZx82SLGz+5jZrGbNDnkbhsfKBs1iSj3Cy+PCtqa0h8l63zQi2oAd2kVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.804907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09924","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b21a2ac78ee6007a0d6b96e8f97282883947135208724b2451449bfd631854","sha256:fe253a6c81cbce71019ac1fab40659b466e9eb075db3b51fdfb388aeda80cbf7"],"state_sha256":"8b433b4b8334d60a0a62a492283b5593ee2f59e12caf619bc97b343c34b99394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qpty6bVwVDEXBRd3ZnM967DmcE+67dFHsgaWmV9rkzXpgpD7q9DtTCnJBQ9WUTYArSFTWYNGomAgoRsrxNcJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:40:09.277526Z","bundle_sha256":"168c02cd74382c7124b49cfaed336babd9fe6c3a1fc9c836677d09c854a13cc6"}}