{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DPKDVLB6AMIIDVMKGGGIY3SCSG","short_pith_number":"pith:DPKDVLB6","schema_version":"1.0","canonical_sha256":"1bd43aac3e031081d58a318c8c6e4291aaf943889e3a4d12c8b82b9ca7510ae0","source":{"kind":"arxiv","id":"1501.01429","version":1},"attestation_state":"computed","paper":{"title":"Online Computation of Abelian Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Arnaud Lefebvre, \\'Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq","submitted_at":"2015-01-07T10:22:12Z","abstract_excerpt":"Given a word $w$ and a Parikh vector $\\mathcal{P}$, an abelian run of period $\\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\\mathcal{P}$. We give an algorithm that finds all the abelian runs of period $\\mathcal{P}$ in a word of length $n$ in time $O(n\\times |\\mathcal{P}|)$ and space $O(\\sigma+|\\mathcal{P}|)$."},"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":"1501.01429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-07T10:22:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6283660538220d9a1482dbc6af888a9b94685a511707b77f86628dc31044293e","abstract_canon_sha256":"4e0c4bbd405fb0735efccc6b4ed0f6f479673b798de8ff1a3118b8f60c62822f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.272449Z","signature_b64":"x4jgzUt3gP/8iYUWeeKk2L8lPyghV1HsvomKiLozTGnfonvK7RIAwuRkjLt8LoGbOqb2rzb5gnRbeuzMwnzcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd43aac3e031081d58a318c8c6e4291aaf943889e3a4d12c8b82b9ca7510ae0","last_reissued_at":"2026-05-18T02:29:54.272031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.272031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Computation of Abelian Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Arnaud Lefebvre, \\'Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq","submitted_at":"2015-01-07T10:22:12Z","abstract_excerpt":"Given a word $w$ and a Parikh vector $\\mathcal{P}$, an abelian run of period $\\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\\mathcal{P}$. We give an algorithm that finds all the abelian runs of period $\\mathcal{P}$ in a word of length $n$ in time $O(n\\times |\\mathcal{P}|)$ and space $O(\\sigma+|\\mathcal{P}|)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01429","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":"1501.01429","created_at":"2026-05-18T02:29:54.272096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01429v1","created_at":"2026-05-18T02:29:54.272096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01429","created_at":"2026-05-18T02:29:54.272096+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPKDVLB6AMII","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPKDVLB6AMIIDVMK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPKDVLB6","created_at":"2026-05-18T12:29:17.054201+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/DPKDVLB6AMIIDVMKGGGIY3SCSG","json":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG.json","graph_json":"https://pith.science/api/pith-number/DPKDVLB6AMIIDVMKGGGIY3SCSG/graph.json","events_json":"https://pith.science/api/pith-number/DPKDVLB6AMIIDVMKGGGIY3SCSG/events.json","paper":"https://pith.science/paper/DPKDVLB6"},"agent_actions":{"view_html":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG","download_json":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG.json","view_paper":"https://pith.science/paper/DPKDVLB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01429&json=true","fetch_graph":"https://pith.science/api/pith-number/DPKDVLB6AMIIDVMKGGGIY3SCSG/graph.json","fetch_events":"https://pith.science/api/pith-number/DPKDVLB6AMIIDVMKGGGIY3SCSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG/action/storage_attestation","attest_author":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG/action/author_attestation","sign_citation":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG/action/citation_signature","submit_replication":"https://pith.science/pith/DPKDVLB6AMIIDVMKGGGIY3SCSG/action/replication_record"}},"created_at":"2026-05-18T02:29:54.272096+00:00","updated_at":"2026-05-18T02:29:54.272096+00:00"}