{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YAJ7DLKJFTIAE5KBQHWWN65DHX","short_pith_number":"pith:YAJ7DLKJ","canonical_record":{"source":{"id":"1104.3153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T20:29:30Z","cross_cats_sorted":[],"title_canon_sha256":"b60a77b1abd2107850ae4505951fe3632aef247b06d640f3d4b69ddba155f039","abstract_canon_sha256":"2bb7a17743662e86d4fe3454eb6525a877790a30e56ac8fe3a7cc10c7924218b"},"schema_version":"1.0"},"canonical_sha256":"c013f1ad492cd002754181ed66fba33dcda48d57b0c61da1afce49a2ce2434d9","source":{"kind":"arxiv","id":"1104.3153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3153","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3153v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3153","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"YAJ7DLKJFTIA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YAJ7DLKJFTIAE5KB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YAJ7DLKJ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YAJ7DLKJFTIAE5KBQHWWN65DHX","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T20:29:30Z","cross_cats_sorted":[],"title_canon_sha256":"b60a77b1abd2107850ae4505951fe3632aef247b06d640f3d4b69ddba155f039","abstract_canon_sha256":"2bb7a17743662e86d4fe3454eb6525a877790a30e56ac8fe3a7cc10c7924218b"},"schema_version":"1.0"},"canonical_sha256":"c013f1ad492cd002754181ed66fba33dcda48d57b0c61da1afce49a2ce2434d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.679120Z","signature_b64":"hG3OVcEuCqsR6TgysoKwCDwr781doNfufWj+m3AEuUYEws+v8k9PCWa31mpqKS0whUUquSjsOExbYju361p6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c013f1ad492cd002754181ed66fba33dcda48d57b0c61da1afce49a2ce2434d9","last_reissued_at":"2026-05-18T04:24:05.678647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.678647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3153","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDvLkcMxtnvg6mZFwyxmGKCk9hi4jaSkVI5k/sZLGygQGrHadFG76zaM2eZe323U5AYKB9Y5ERwWAG4OGpxUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:36:19.445866Z"},"content_sha256":"5da610c31f4b1fa748992844812152088242667b16edc3ee7b29386700dcb9f1","schema_version":"1.0","event_id":"sha256:5da610c31f4b1fa748992844812152088242667b16edc3ee7b29386700dcb9f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YAJ7DLKJFTIAE5KBQHWWN65DHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Seeds Computation Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Michalis Christou, Solon P. Pissis, Tomasz Walen, Wojciech Rytter","submitted_at":"2011-04-15T20:29:30Z","abstract_excerpt":"The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In the paper we give linear time algorithms for some of its versions --- computing shortest left-seed array, longest left-seed array and checking for seeds of a given length. The algorithm for the last probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3153","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODJuZ3t87pmg+QI0/klR/slJHXnxxKlq5u3ZCbHqlboXSxHG61w7SfPFSmuL/RA5AxqrOvli444MUEFP4KaZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:36:19.446191Z"},"content_sha256":"0947a146f6963f1b515b712238fecc9318ac61b0aaa56adbc3a33e73a239dd30","schema_version":"1.0","event_id":"sha256:0947a146f6963f1b515b712238fecc9318ac61b0aaa56adbc3a33e73a239dd30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/bundle.json","state_url":"https://pith.science/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/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-24T06:36:19Z","links":{"resolver":"https://pith.science/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX","bundle":"https://pith.science/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/bundle.json","state":"https://pith.science/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAJ7DLKJFTIAE5KBQHWWN65DHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YAJ7DLKJFTIAE5KBQHWWN65DHX","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":"2bb7a17743662e86d4fe3454eb6525a877790a30e56ac8fe3a7cc10c7924218b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T20:29:30Z","title_canon_sha256":"b60a77b1abd2107850ae4505951fe3632aef247b06d640f3d4b69ddba155f039"},"schema_version":"1.0","source":{"id":"1104.3153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3153","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3153v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3153","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"YAJ7DLKJFTIA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YAJ7DLKJFTIAE5KB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YAJ7DLKJ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:0947a146f6963f1b515b712238fecc9318ac61b0aaa56adbc3a33e73a239dd30","target":"graph","created_at":"2026-05-18T04:24:05Z","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":"The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In the paper we give linear time algorithms for some of its versions --- computing shortest left-seed array, longest left-seed array and checking for seeds of a given length. The algorithm for the last probl","authors_text":"Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Michalis Christou, Solon P. Pissis, Tomasz Walen, Wojciech Rytter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T20:29:30Z","title":"Efficient Seeds Computation Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3153","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:5da610c31f4b1fa748992844812152088242667b16edc3ee7b29386700dcb9f1","target":"record","created_at":"2026-05-18T04:24:05Z","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":"2bb7a17743662e86d4fe3454eb6525a877790a30e56ac8fe3a7cc10c7924218b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T20:29:30Z","title_canon_sha256":"b60a77b1abd2107850ae4505951fe3632aef247b06d640f3d4b69ddba155f039"},"schema_version":"1.0","source":{"id":"1104.3153","kind":"arxiv","version":1}},"canonical_sha256":"c013f1ad492cd002754181ed66fba33dcda48d57b0c61da1afce49a2ce2434d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c013f1ad492cd002754181ed66fba33dcda48d57b0c61da1afce49a2ce2434d9","first_computed_at":"2026-05-18T04:24:05.678647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.678647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hG3OVcEuCqsR6TgysoKwCDwr781doNfufWj+m3AEuUYEws+v8k9PCWa31mpqKS0whUUquSjsOExbYju361p6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.679120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5da610c31f4b1fa748992844812152088242667b16edc3ee7b29386700dcb9f1","sha256:0947a146f6963f1b515b712238fecc9318ac61b0aaa56adbc3a33e73a239dd30"],"state_sha256":"8d4e493857af5bb8d8f616dc0307c1f420050e04388c13178ceb4f04df60907c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jqvD8XM8q9Yoxw7MU+RXd5Byok2zoqMoT0E3ykw+KmCsTVPvjlXq+nRCfF9TmCXTjn9tCT+UEyhJuCyIyrSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:36:19.447997Z","bundle_sha256":"c0ebab47d702253096c29d1e7ea8f4362b07f44c9b0e093c1742400f8e3c264a"}}