{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XCWZGHPVSUXOPT7YERDYADRUPW","short_pith_number":"pith:XCWZGHPV","canonical_record":{"source":{"id":"1509.01221","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-03T19:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"af27056038fdabd6ff3ea8b351ab5aff370cd25ae34eb1efee4700112cff7391","abstract_canon_sha256":"9a5688601b812109e1ed06f2dd345959b4a16d1507f786aeb27d6b4fd66c32ff"},"schema_version":"1.0"},"canonical_sha256":"b8ad931df5952ee7cff82447800e347d8fbeffc8bfdc7a2e4bc8db9bfef9002d","source":{"kind":"arxiv","id":"1509.01221","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01221","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01221v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01221","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"XCWZGHPVSUXO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XCWZGHPVSUXOPT7Y","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XCWZGHPV","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XCWZGHPVSUXOPT7YERDYADRUPW","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01221","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-03T19:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"af27056038fdabd6ff3ea8b351ab5aff370cd25ae34eb1efee4700112cff7391","abstract_canon_sha256":"9a5688601b812109e1ed06f2dd345959b4a16d1507f786aeb27d6b4fd66c32ff"},"schema_version":"1.0"},"canonical_sha256":"b8ad931df5952ee7cff82447800e347d8fbeffc8bfdc7a2e4bc8db9bfef9002d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:13.352969Z","signature_b64":"eR9mtm/YcqT/Dne+0EMqpaTDG9//jmwkS1elxJkuR1hmsXxX4DBnNG3jwgUUT6bUO50LiS+gm2fyzodSs1PpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ad931df5952ee7cff82447800e347d8fbeffc8bfdc7a2e4bc8db9bfef9002d","last_reissued_at":"2026-05-18T01:31:13.352271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:13.352271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01221","source_version":3,"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AoJnPBF6lq7aNi0VLO20jXxRIx0y7kjNRa0uNbvsqiAN2seaQUuvVKEir3Excw+iNQfwKG2qC0RgP2OuT1jHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:01:03.777806Z"},"content_sha256":"791a0423bfa15d7411b19b944b99079af543d8fe583105295949614a2e0d4e8d","schema_version":"1.0","event_id":"sha256:791a0423bfa15d7411b19b944b99079af543d8fe583105295949614a2e0d4e8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XCWZGHPVSUXOPT7YERDYADRUPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal searching of gapped repeats in a word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gregory Kucherov, Maxime Crochemore, Roman Kolpakov","submitted_at":"2015-09-03T19:11:14Z","abstract_excerpt":"Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\\em $\\alpha$-gapped repeats} in strings, defined as factors $uvu$ with $|uv|\\leq \\alpha |u|$. Our main result is the $O(\\alpha n)$ bound on the number of {\\em maximal} $\\alpha$-gapped repeats in a string of length $n$, previously proved to be $O(\\alpha^2 n)$ in (Kolpakov et al., 2013). For a closely related notion of maximal $\\delta$-subrepetition (maximal factors of exponent between $1+\\delta$ and $2$), our result implies the $O(n/\\delta)$ bound on their number, which improves the bound of (Kolpakov et "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01221","kind":"arxiv","version":3},"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t05W1ak1bXZxyohYGT1iohRqLMM3A3lwF48K+WGo55cT6GquZ3C3yfFH1GautjdXPxVRUkQc42WaDWfBXZVPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:01:03.778470Z"},"content_sha256":"735fadae3b304268f35392306e614c00cad713970fe10caf73f260bfd4a21c85","schema_version":"1.0","event_id":"sha256:735fadae3b304268f35392306e614c00cad713970fe10caf73f260bfd4a21c85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCWZGHPVSUXOPT7YERDYADRUPW/bundle.json","state_url":"https://pith.science/pith/XCWZGHPVSUXOPT7YERDYADRUPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCWZGHPVSUXOPT7YERDYADRUPW/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-01T01:01:03Z","links":{"resolver":"https://pith.science/pith/XCWZGHPVSUXOPT7YERDYADRUPW","bundle":"https://pith.science/pith/XCWZGHPVSUXOPT7YERDYADRUPW/bundle.json","state":"https://pith.science/pith/XCWZGHPVSUXOPT7YERDYADRUPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCWZGHPVSUXOPT7YERDYADRUPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XCWZGHPVSUXOPT7YERDYADRUPW","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":"9a5688601b812109e1ed06f2dd345959b4a16d1507f786aeb27d6b4fd66c32ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-03T19:11:14Z","title_canon_sha256":"af27056038fdabd6ff3ea8b351ab5aff370cd25ae34eb1efee4700112cff7391"},"schema_version":"1.0","source":{"id":"1509.01221","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01221","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01221v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01221","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"XCWZGHPVSUXO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XCWZGHPVSUXOPT7Y","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XCWZGHPV","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:735fadae3b304268f35392306e614c00cad713970fe10caf73f260bfd4a21c85","target":"graph","created_at":"2026-05-18T01:31:13Z","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":"Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\\em $\\alpha$-gapped repeats} in strings, defined as factors $uvu$ with $|uv|\\leq \\alpha |u|$. Our main result is the $O(\\alpha n)$ bound on the number of {\\em maximal} $\\alpha$-gapped repeats in a string of length $n$, previously proved to be $O(\\alpha^2 n)$ in (Kolpakov et al., 2013). For a closely related notion of maximal $\\delta$-subrepetition (maximal factors of exponent between $1+\\delta$ and $2$), our result implies the $O(n/\\delta)$ bound on their number, which improves the bound of (Kolpakov et ","authors_text":"Gregory Kucherov, Maxime Crochemore, Roman Kolpakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-03T19:11:14Z","title":"Optimal searching of gapped repeats in a word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01221","kind":"arxiv","version":3},"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:791a0423bfa15d7411b19b944b99079af543d8fe583105295949614a2e0d4e8d","target":"record","created_at":"2026-05-18T01:31:13Z","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":"9a5688601b812109e1ed06f2dd345959b4a16d1507f786aeb27d6b4fd66c32ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-03T19:11:14Z","title_canon_sha256":"af27056038fdabd6ff3ea8b351ab5aff370cd25ae34eb1efee4700112cff7391"},"schema_version":"1.0","source":{"id":"1509.01221","kind":"arxiv","version":3}},"canonical_sha256":"b8ad931df5952ee7cff82447800e347d8fbeffc8bfdc7a2e4bc8db9bfef9002d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ad931df5952ee7cff82447800e347d8fbeffc8bfdc7a2e4bc8db9bfef9002d","first_computed_at":"2026-05-18T01:31:13.352271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:13.352271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eR9mtm/YcqT/Dne+0EMqpaTDG9//jmwkS1elxJkuR1hmsXxX4DBnNG3jwgUUT6bUO50LiS+gm2fyzodSs1PpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:13.352969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01221","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:791a0423bfa15d7411b19b944b99079af543d8fe583105295949614a2e0d4e8d","sha256:735fadae3b304268f35392306e614c00cad713970fe10caf73f260bfd4a21c85"],"state_sha256":"411518560a94d1d2ee691b4fbad260c7aa71afd4420bfebf8b263856585e503f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfPWRA/HZEjGldTlTVKMbEHQHN/4IVRtGVGb4bgmZeqBqokzlAMS3Xk/8dxKje/AXhsyIugecmYUJvx6dq8LBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:01:03.781885Z","bundle_sha256":"39ac6ab5199f224a0a999bfb5903e661680d76f1a2a76d2608a6bcca2ac7e0a8"}}