{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KEDPWATDDI67C7WPVOE4YYWXY7","short_pith_number":"pith:KEDPWATD","canonical_record":{"source":{"id":"1506.06983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"cd3e1da34f93afd523886c7db4f8eb5b09492482c4d72043348f04ed1ce99a71","abstract_canon_sha256":"d0bc4b4d4d46eba0b206aff2d38bb52247e15580b696a66df8619b06b6c8862f"},"schema_version":"1.0"},"canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","source":{"kind":"arxiv","id":"1506.06983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06983","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06983v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06983","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"KEDPWATDDI67","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KEDPWATDDI67C7WP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KEDPWATD","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KEDPWATDDI67C7WPVOE4YYWXY7","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"cd3e1da34f93afd523886c7db4f8eb5b09492482c4d72043348f04ed1ce99a71","abstract_canon_sha256":"d0bc4b4d4d46eba0b206aff2d38bb52247e15580b696a66df8619b06b6c8862f"},"schema_version":"1.0"},"canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.401208Z","signature_b64":"HMI7AXZpp1RzcaLtOjBf6MFpbClbjzCajFsMLvLPMQDWokfcaj8OOCvhr69MAX1h6mwETlFF10M+M4tos0oGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","last_reissued_at":"2026-05-18T01:40:55.400458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.400458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06983","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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSzS8QwNwSu9ipez1H/hbLQCZxvNcsvEuk1k5Zu3W3tmoOKrMPYU3TZ5+U/iW6kPw3q75zSWJopr7inCDWDtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:24:07.222937Z"},"content_sha256":"e696ea758035e32abc7a9655c6573323a988ccfcb76519f517b3c0c4ec472f53","schema_version":"1.0","event_id":"sha256:e696ea758035e32abc7a9655c6573323a988ccfcb76519f517b3c0c4ec472f53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KEDPWATDDI67C7WPVOE4YYWXY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman","submitted_at":"2015-06-23T13:29:26Z","abstract_excerpt":"We consider the problem of finding repetitive structures and inherent patterns in a given string $\\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\\s{u}$ of a string $\\s{s}$ is both a prefix and a suffix of $\\s{s}$ such that $\\s{u} \\not= \\s{s}$. The computation of the border array of a string $\\s{s}$, namely the borders of each prefix of $\\s{s}$, is strongly related to the string matching problem: given a string $\\s{w}$, find all of its occurrences in $\\s{s}$. A {\\itshape Lyndon word} is a primitive word (i.e., it is not a power of another word) which is minimal for the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06983","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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCB+BsDv+wwILvZRFJcgR8AkoNZunXldNrdV6pxy4QaORVQAPbdnnje2jiX07n6iENdIp6wd6QGyDwLv332hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:24:07.223345Z"},"content_sha256":"66dcd54804192aaf69fa574bf4c1bc08319dda3aa9bb85637b17cf3e4aad0e1b","schema_version":"1.0","event_id":"sha256:66dcd54804192aaf69fa574bf4c1bc08319dda3aa9bb85637b17cf3e4aad0e1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/bundle.json","state_url":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEDPWATDDI67C7WPVOE4YYWXY7/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-22T14:24:07Z","links":{"resolver":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7","bundle":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/bundle.json","state":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEDPWATDDI67C7WPVOE4YYWXY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KEDPWATDDI67C7WPVOE4YYWXY7","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":"d0bc4b4d4d46eba0b206aff2d38bb52247e15580b696a66df8619b06b6c8862f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","title_canon_sha256":"cd3e1da34f93afd523886c7db4f8eb5b09492482c4d72043348f04ed1ce99a71"},"schema_version":"1.0","source":{"id":"1506.06983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06983","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06983v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06983","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"KEDPWATDDI67","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KEDPWATDDI67C7WP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KEDPWATD","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:66dcd54804192aaf69fa574bf4c1bc08319dda3aa9bb85637b17cf3e4aad0e1b","target":"graph","created_at":"2026-05-18T01:40:55Z","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":"We consider the problem of finding repetitive structures and inherent patterns in a given string $\\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\\s{u}$ of a string $\\s{s}$ is both a prefix and a suffix of $\\s{s}$ such that $\\s{u} \\not= \\s{s}$. The computation of the border array of a string $\\s{s}$, namely the borders of each prefix of $\\s{s}$, is strongly related to the string matching problem: given a string $\\s{w}$, find all of its occurrences in $\\s{s}$. A {\\itshape Lyndon word} is a primitive word (i.e., it is not a power of another word) which is minimal for the l","authors_text":"Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","title":"Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06983","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:e696ea758035e32abc7a9655c6573323a988ccfcb76519f517b3c0c4ec472f53","target":"record","created_at":"2026-05-18T01:40:55Z","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":"d0bc4b4d4d46eba0b206aff2d38bb52247e15580b696a66df8619b06b6c8862f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","title_canon_sha256":"cd3e1da34f93afd523886c7db4f8eb5b09492482c4d72043348f04ed1ce99a71"},"schema_version":"1.0","source":{"id":"1506.06983","kind":"arxiv","version":1}},"canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","first_computed_at":"2026-05-18T01:40:55.400458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:55.400458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HMI7AXZpp1RzcaLtOjBf6MFpbClbjzCajFsMLvLPMQDWokfcaj8OOCvhr69MAX1h6mwETlFF10M+M4tos0oGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:55.401208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e696ea758035e32abc7a9655c6573323a988ccfcb76519f517b3c0c4ec472f53","sha256:66dcd54804192aaf69fa574bf4c1bc08319dda3aa9bb85637b17cf3e4aad0e1b"],"state_sha256":"6fcf3afd3207a312c85d9fc53e2bf2d5b38958f382d71b5d0b05c7ddc3bed5e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57yn3vzZHbbIDVIt0YdQe6cxjsfmY4UCrF1A4WTO+KciMknEdCwUYTjMgtYVFZkfmKdw6UN5J+PtzKY9geWtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:24:07.225480Z","bundle_sha256":"e8d9e91ff51f411b18bc785d540e766beb189c55bda710e5d142c99bfaa44c45"}}