{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:THNME6WDG4FZFVXLBWOE43D5JB","short_pith_number":"pith:THNME6WD","schema_version":"1.0","canonical_sha256":"99dac27ac3370b92d6eb0d9c4e6c7d485d047532498e9df3d2accf062c1d8dc2","source":{"kind":"arxiv","id":"1211.5389","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Computing Abelian Periods of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arnaud Lefebvre, Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq","submitted_at":"2012-11-22T22:32:07Z","abstract_excerpt":"Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \\emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\\sigma$ can have $\\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \\times \\sigma)$ using $O(n \\times \\sigma)$ space. We present an off-line algorithm based on a $\\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the "},"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":"1211.5389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-22T22:32:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"00f367d880bb68ed2c3e12c0dc97ef0e304222a82e4e7c6f74f98656a5d39e5b","abstract_canon_sha256":"4a7e2c992bbab5f037963a55c6ffb5c3228a53029678c9130d200bb3a67d572b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:35.780935Z","signature_b64":"nvtE1yKfF6IPACY1eMFqGSn/dDyKhVyFkUU7fuNJR6hIqsbb6tO6kTiPlGXfDONMvxi24N2YYrpWcMIebJIjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99dac27ac3370b92d6eb0d9c4e6c7d485d047532498e9df3d2accf062c1d8dc2","last_reissued_at":"2026-05-18T03:05:35.780333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:35.780333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Computing Abelian Periods of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arnaud Lefebvre, Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq","submitted_at":"2012-11-22T22:32:07Z","abstract_excerpt":"Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \\emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\\sigma$ can have $\\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \\times \\sigma)$ using $O(n \\times \\sigma)$ space. We present an off-line algorithm based on a $\\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5389","kind":"arxiv","version":2},"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":"1211.5389","created_at":"2026-05-18T03:05:35.780425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5389v2","created_at":"2026-05-18T03:05:35.780425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5389","created_at":"2026-05-18T03:05:35.780425+00:00"},{"alias_kind":"pith_short_12","alias_value":"THNME6WDG4FZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"THNME6WDG4FZFVXL","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"THNME6WD","created_at":"2026-05-18T12:27:23.164592+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/THNME6WDG4FZFVXLBWOE43D5JB","json":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB.json","graph_json":"https://pith.science/api/pith-number/THNME6WDG4FZFVXLBWOE43D5JB/graph.json","events_json":"https://pith.science/api/pith-number/THNME6WDG4FZFVXLBWOE43D5JB/events.json","paper":"https://pith.science/paper/THNME6WD"},"agent_actions":{"view_html":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB","download_json":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB.json","view_paper":"https://pith.science/paper/THNME6WD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5389&json=true","fetch_graph":"https://pith.science/api/pith-number/THNME6WDG4FZFVXLBWOE43D5JB/graph.json","fetch_events":"https://pith.science/api/pith-number/THNME6WDG4FZFVXLBWOE43D5JB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB/action/storage_attestation","attest_author":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB/action/author_attestation","sign_citation":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB/action/citation_signature","submit_replication":"https://pith.science/pith/THNME6WDG4FZFVXLBWOE43D5JB/action/replication_record"}},"created_at":"2026-05-18T03:05:35.780425+00:00","updated_at":"2026-05-18T03:05:35.780425+00:00"}