{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CUD62AP27I2A5X5HRHD4GQDGBE","short_pith_number":"pith:CUD62AP2","canonical_record":{"source":{"id":"1509.09237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-09-30T16:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"a0b02f8ed62095674d5360f72fdeae9adead2ec70ed2e34c43dce3c3bcdf4fcd","abstract_canon_sha256":"48a41e4227b66fc6660903658f1fad75d7c009e94517682b290b1c300c79fbf5"},"schema_version":"1.0"},"canonical_sha256":"1507ed01fafa340edfa789c7c34066091fd10ab71cde55a58369d6d5faf228e0","source":{"kind":"arxiv","id":"1509.09237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09237","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09237v1","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09237","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"CUD62AP27I2A","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUD62AP27I2A5X5H","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUD62AP2","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CUD62AP27I2A5X5HRHD4GQDGBE","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-09-30T16:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"a0b02f8ed62095674d5360f72fdeae9adead2ec70ed2e34c43dce3c3bcdf4fcd","abstract_canon_sha256":"48a41e4227b66fc6660903658f1fad75d7c009e94517682b290b1c300c79fbf5"},"schema_version":"1.0"},"canonical_sha256":"1507ed01fafa340edfa789c7c34066091fd10ab71cde55a58369d6d5faf228e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:21.941572Z","signature_b64":"ip8I7Sik3ER4XNhHFsALSFeSX8cYkZE087SBfGGHZeIaVpPU/B0XD7kAQSiMr5cK2G7NM5u2E2hr9KC1dg68Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1507ed01fafa340edfa789c7c34066091fd10ab71cde55a58369d6d5faf228e0","last_reissued_at":"2026-05-18T01:31:21.941095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:21.941095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09237","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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1Fc8abGkLSIL3pB6koY/vk+QuBNnQUZ2ZtWBqQPNsMYwuyqelF5Fpwpm4FB9f9XdHBkYZkrdNiDMjK80LNoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:16:50.507271Z"},"content_sha256":"dd302ca03b91975030bbe90aacd9265817d796e0b1c06fc449bb29e621db04d6","schema_version":"1.0","event_id":"sha256:dd302ca03b91975030bbe90aacd9265817d796e0b1c06fc449bb29e621db04d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CUD62AP27I2A5X5HRHD4GQDGBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Finding All Maximal $\\alpha$-gapped Repeats","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Florin Manea, Pawe{\\l} Gawrychowski, Shunsuke Inenaga, Tomohiro I","submitted_at":"2015-09-30T16:13:06Z","abstract_excerpt":"For $\\alpha\\geq 1$, an $\\alpha$-gapped repeat in a word $w$ is a factor $uvu$ of $w$ such that $|uv|\\leq \\alpha |u|$; the two factors $u$ in such a repeat are called arms, while the factor $v$ is called gap. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right or, respectively, to the left. In this paper we show that the number of maximal $\\alpha$-gapped repeats that may occur in a word is upper bounded by $18\\alpha n$. This allows us to construct an algorithm finding all the maximal $\\alpha$-gapped repeats of a word in $O(\\alpha n)$; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09237","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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnKOlYhHGuEHluhkFAi3C5DWBqUfMZxTO4GO8MYa8wk1i3bvflHTN+RJNbMHzYaI4+OtdH8k3MABZWceuSc5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:16:50.507633Z"},"content_sha256":"35d637889990796f760040497d9cf7e1ea05d978e574ae68010dcac368bb711e","schema_version":"1.0","event_id":"sha256:35d637889990796f760040497d9cf7e1ea05d978e574ae68010dcac368bb711e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUD62AP27I2A5X5HRHD4GQDGBE/bundle.json","state_url":"https://pith.science/pith/CUD62AP27I2A5X5HRHD4GQDGBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUD62AP27I2A5X5HRHD4GQDGBE/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-22T04:16:50Z","links":{"resolver":"https://pith.science/pith/CUD62AP27I2A5X5HRHD4GQDGBE","bundle":"https://pith.science/pith/CUD62AP27I2A5X5HRHD4GQDGBE/bundle.json","state":"https://pith.science/pith/CUD62AP27I2A5X5HRHD4GQDGBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUD62AP27I2A5X5HRHD4GQDGBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CUD62AP27I2A5X5HRHD4GQDGBE","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":"48a41e4227b66fc6660903658f1fad75d7c009e94517682b290b1c300c79fbf5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-09-30T16:13:06Z","title_canon_sha256":"a0b02f8ed62095674d5360f72fdeae9adead2ec70ed2e34c43dce3c3bcdf4fcd"},"schema_version":"1.0","source":{"id":"1509.09237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09237","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09237v1","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09237","created_at":"2026-05-18T01:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"CUD62AP27I2A","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUD62AP27I2A5X5H","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUD62AP2","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:35d637889990796f760040497d9cf7e1ea05d978e574ae68010dcac368bb711e","target":"graph","created_at":"2026-05-18T01:31:21Z","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":"For $\\alpha\\geq 1$, an $\\alpha$-gapped repeat in a word $w$ is a factor $uvu$ of $w$ such that $|uv|\\leq \\alpha |u|$; the two factors $u$ in such a repeat are called arms, while the factor $v$ is called gap. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right or, respectively, to the left. In this paper we show that the number of maximal $\\alpha$-gapped repeats that may occur in a word is upper bounded by $18\\alpha n$. This allows us to construct an algorithm finding all the maximal $\\alpha$-gapped repeats of a word in $O(\\alpha n)$; ","authors_text":"Dominik K\\\"oppl, Florin Manea, Pawe{\\l} Gawrychowski, Shunsuke Inenaga, Tomohiro I","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-09-30T16:13:06Z","title":"Efficiently Finding All Maximal $\\alpha$-gapped Repeats"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09237","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:dd302ca03b91975030bbe90aacd9265817d796e0b1c06fc449bb29e621db04d6","target":"record","created_at":"2026-05-18T01:31:21Z","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":"48a41e4227b66fc6660903658f1fad75d7c009e94517682b290b1c300c79fbf5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-09-30T16:13:06Z","title_canon_sha256":"a0b02f8ed62095674d5360f72fdeae9adead2ec70ed2e34c43dce3c3bcdf4fcd"},"schema_version":"1.0","source":{"id":"1509.09237","kind":"arxiv","version":1}},"canonical_sha256":"1507ed01fafa340edfa789c7c34066091fd10ab71cde55a58369d6d5faf228e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1507ed01fafa340edfa789c7c34066091fd10ab71cde55a58369d6d5faf228e0","first_computed_at":"2026-05-18T01:31:21.941095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:21.941095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ip8I7Sik3ER4XNhHFsALSFeSX8cYkZE087SBfGGHZeIaVpPU/B0XD7kAQSiMr5cK2G7NM5u2E2hr9KC1dg68Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:21.941572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd302ca03b91975030bbe90aacd9265817d796e0b1c06fc449bb29e621db04d6","sha256:35d637889990796f760040497d9cf7e1ea05d978e574ae68010dcac368bb711e"],"state_sha256":"e29ca7ecdd63015681a9030dc12946691198a23109192505e137e4d895d502f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7edvuAY6JRi8j+vh640qHr3lvmF1CmYAN80lQ5N+28qNkP2Ir9kAn4bAk/NMS4OSE+vJ4aHPCsJ/ZC2mwpdqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:16:50.509899Z","bundle_sha256":"f852e18ddbd5b6f4b486852dda489e8da3a2fa8ef23d82d530ceb245e756312d"}}