{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HNQ6PVDVV4P5SLKKLQHAHDJSR2","short_pith_number":"pith:HNQ6PVDV","schema_version":"1.0","canonical_sha256":"3b61e7d475af1fd92d4a5c0e038d328ea376d8be209ec19a1eaddba138a297f6","source":{"kind":"arxiv","id":"1003.4866","version":1},"attestation_state":"computed","paper":{"title":"On the maximal sum of exponents of runs in a string","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Walen, Wojciech Rytter","submitted_at":"2010-03-25T11:49:37Z","abstract_excerpt":"A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition $v$ with a period $p$ such that $2p \\le |v|$. The exponent of a run is defined as $|v|/p$ and is $\\ge 2$. We show new bounds on the maximal sum of exponents of runs in a string of length $n$. Our upper bound of $4.1n$ is better than the best previously known proven bound of $5.6n$ by Crochemore & Ilie (2008). The lower bound of $2.035n$, obtained using a family of binary words, contradicts the conjecture of Kolpakov & Kucherov (1999) that the maximal sum of exponents of runs in a string of length $n$ is sma"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1003.4866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-25T11:49:37Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0cdae577a03372842d3fb3bf6114772852c716a873b2e578666841ec1bfa0004","abstract_canon_sha256":"57e474c9bc239d1c72408d735658a48e55fbf3de7ae33172db87180152ea2f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:23.134418Z","signature_b64":"S0hHhwjvPgC77u2W4+2HatfI3qfrwLDNZuaUQGP13uftRopo1gGsfasiGtXPwKik7ChK9vT9gkvj829frzvjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b61e7d475af1fd92d4a5c0e038d328ea376d8be209ec19a1eaddba138a297f6","last_reissued_at":"2026-05-18T02:08:23.133759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:23.133759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximal sum of exponents of runs in a string","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Walen, Wojciech Rytter","submitted_at":"2010-03-25T11:49:37Z","abstract_excerpt":"A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition $v$ with a period $p$ such that $2p \\le |v|$. The exponent of a run is defined as $|v|/p$ and is $\\ge 2$. We show new bounds on the maximal sum of exponents of runs in a string of length $n$. Our upper bound of $4.1n$ is better than the best previously known proven bound of $5.6n$ by Crochemore & Ilie (2008). The lower bound of $2.035n$, obtained using a family of binary words, contradicts the conjecture of Kolpakov & Kucherov (1999) that the maximal sum of exponents of runs in a string of length $n$ is sma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4866","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1003.4866","created_at":"2026-05-18T02:08:23.133862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.4866v1","created_at":"2026-05-18T02:08:23.133862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4866","created_at":"2026-05-18T02:08:23.133862+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNQ6PVDVV4P5","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNQ6PVDVV4P5SLKK","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNQ6PVDV","created_at":"2026-05-18T12:26:07.630475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2","json":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2.json","graph_json":"https://pith.science/api/pith-number/HNQ6PVDVV4P5SLKKLQHAHDJSR2/graph.json","events_json":"https://pith.science/api/pith-number/HNQ6PVDVV4P5SLKKLQHAHDJSR2/events.json","paper":"https://pith.science/paper/HNQ6PVDV"},"agent_actions":{"view_html":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2","download_json":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2.json","view_paper":"https://pith.science/paper/HNQ6PVDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.4866&json=true","fetch_graph":"https://pith.science/api/pith-number/HNQ6PVDVV4P5SLKKLQHAHDJSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/HNQ6PVDVV4P5SLKKLQHAHDJSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2/action/storage_attestation","attest_author":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2/action/author_attestation","sign_citation":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2/action/citation_signature","submit_replication":"https://pith.science/pith/HNQ6PVDVV4P5SLKKLQHAHDJSR2/action/replication_record"}},"created_at":"2026-05-18T02:08:23.133862+00:00","updated_at":"2026-05-18T02:08:23.133862+00:00"}