{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WJM5P2QVNB6UO2OAPYM56MNLXG","short_pith_number":"pith:WJM5P2QV","canonical_record":{"source":{"id":"1501.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T05:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"3b49d8474df9b76bead6cd661cb03104f5eec40f88dc8bb5730b960af1a33722","abstract_canon_sha256":"d12267e22aba238eeda8dc812a64d23b44de1f35a23b7f82760be14e8018e244"},"schema_version":"1.0"},"canonical_sha256":"b259d7ea15687d4769c07e19df31abb9a1c9bb5ac17d8527eded1c2aa705a322","source":{"kind":"arxiv","id":"1501.06259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06259","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06259v1","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06259","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJM5P2QVNB6U","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WJM5P2QVNB6UO2OA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WJM5P2QV","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WJM5P2QVNB6UO2OAPYM56MNLXG","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T05:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"3b49d8474df9b76bead6cd661cb03104f5eec40f88dc8bb5730b960af1a33722","abstract_canon_sha256":"d12267e22aba238eeda8dc812a64d23b44de1f35a23b7f82760be14e8018e244"},"schema_version":"1.0"},"canonical_sha256":"b259d7ea15687d4769c07e19df31abb9a1c9bb5ac17d8527eded1c2aa705a322","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:41.897360Z","signature_b64":"vMe+4pOPkDC04SRt8WvO4xpgqeUk+/GAGSiJfAhhfvMkqoUT5I9VDwYyHr5OHLVi7PggtBgk4Tn+t7o+yuNEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b259d7ea15687d4769c07e19df31abb9a1c9bb5ac17d8527eded1c2aa705a322","last_reissued_at":"2026-05-18T02:28:41.896880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:41.896880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06259","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:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2yBV4/a6Qs60yg8UX/L3womtJNFgjwdIJMKYY6FGek5RdMceNBksbtCpF3PZSKn+Z/NlPbG/8Him1bb7sKVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:33:49.089057Z"},"content_sha256":"784bf7e9295bdefe35b4194ccac70ac1d8f75a5f97e239f06fac96c775d8d3ba","schema_version":"1.0","event_id":"sha256:784bf7e9295bdefe35b4194ccac70ac1d8f75a5f97e239f06fac96c775d8d3ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WJM5P2QVNB6UO2OAPYM56MNLXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Longest Repeat Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Atalay Mert \\.Ileri, Bojian Xu, M. O\\u{g}uzhan K\\\"ulekci","submitted_at":"2015-01-26T05:53:03Z","abstract_excerpt":"Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study the problem of finding longest repetitive substrings covering particular string positions. We propose an $O(n)$ time and space algorithm for finding the longest repeat covering every position of a string of size $n$. Our work is optimal since the reading and the storage of an input string of size $n$ takes $O(n)$ time and space. Because any substring of a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06259","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:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4rP53haxGZK8ryISSYkgO1s4Gnx+cDX4/U38vim/49YGP+ylUAaAgIGlGEwuntnmlf5L7I99fNywWGsIxHOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:33:49.089413Z"},"content_sha256":"f5e86aa572ea5c956d31120f402ebb43369ad638b60309778fdfe82187157b25","schema_version":"1.0","event_id":"sha256:f5e86aa572ea5c956d31120f402ebb43369ad638b60309778fdfe82187157b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/bundle.json","state_url":"https://pith.science/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/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-08T12:33:49Z","links":{"resolver":"https://pith.science/pith/WJM5P2QVNB6UO2OAPYM56MNLXG","bundle":"https://pith.science/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/bundle.json","state":"https://pith.science/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJM5P2QVNB6UO2OAPYM56MNLXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WJM5P2QVNB6UO2OAPYM56MNLXG","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":"d12267e22aba238eeda8dc812a64d23b44de1f35a23b7f82760be14e8018e244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T05:53:03Z","title_canon_sha256":"3b49d8474df9b76bead6cd661cb03104f5eec40f88dc8bb5730b960af1a33722"},"schema_version":"1.0","source":{"id":"1501.06259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06259","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06259v1","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06259","created_at":"2026-05-18T02:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJM5P2QVNB6U","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WJM5P2QVNB6UO2OA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WJM5P2QV","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f5e86aa572ea5c956d31120f402ebb43369ad638b60309778fdfe82187157b25","target":"graph","created_at":"2026-05-18T02:28:41Z","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":"Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study the problem of finding longest repetitive substrings covering particular string positions. We propose an $O(n)$ time and space algorithm for finding the longest repeat covering every position of a string of size $n$. Our work is optimal since the reading and the storage of an input string of size $n$ takes $O(n)$ time and space. Because any substring of a re","authors_text":"Atalay Mert \\.Ileri, Bojian Xu, M. O\\u{g}uzhan K\\\"ulekci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T05:53:03Z","title":"On Longest Repeat Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06259","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:784bf7e9295bdefe35b4194ccac70ac1d8f75a5f97e239f06fac96c775d8d3ba","target":"record","created_at":"2026-05-18T02:28:41Z","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":"d12267e22aba238eeda8dc812a64d23b44de1f35a23b7f82760be14e8018e244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T05:53:03Z","title_canon_sha256":"3b49d8474df9b76bead6cd661cb03104f5eec40f88dc8bb5730b960af1a33722"},"schema_version":"1.0","source":{"id":"1501.06259","kind":"arxiv","version":1}},"canonical_sha256":"b259d7ea15687d4769c07e19df31abb9a1c9bb5ac17d8527eded1c2aa705a322","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b259d7ea15687d4769c07e19df31abb9a1c9bb5ac17d8527eded1c2aa705a322","first_computed_at":"2026-05-18T02:28:41.896880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:41.896880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vMe+4pOPkDC04SRt8WvO4xpgqeUk+/GAGSiJfAhhfvMkqoUT5I9VDwYyHr5OHLVi7PggtBgk4Tn+t7o+yuNEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:41.897360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:784bf7e9295bdefe35b4194ccac70ac1d8f75a5f97e239f06fac96c775d8d3ba","sha256:f5e86aa572ea5c956d31120f402ebb43369ad638b60309778fdfe82187157b25"],"state_sha256":"42c98bd0cd5cc212bb8a974bd5d69aea5e42a063902c5ba402704a35dc2f42fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKiyxdyWzylmrayA4jVhyZT9K7iHAWYpVpuwOAY4vBUmf5eiQjMqseijgcxMWX7B02ClIXhDLN0GsAjy60aoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:33:49.091420Z","bundle_sha256":"f1093638810b54e04fda26216bc5e7f5a2c76e231cefd8fab9cbecbbaf9ee8eb"}}