{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UVE4LJG5OL63VWJC3OBEL4QHPW","short_pith_number":"pith:UVE4LJG5","schema_version":"1.0","canonical_sha256":"a549c5a4dd72fdbad922db8245f2077dae4e9d5b3b0d5ce1f7b68d51eb43a252","source":{"kind":"arxiv","id":"1510.00634","version":1},"attestation_state":"computed","paper":{"title":"A Note on Easy and Efficient Computation of Full Abelian Periods of a Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Arnaud Lefebvre, \\'Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq, William F. Smyth","submitted_at":"2015-10-02T16:17:11Z","abstract_excerpt":"Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\\log\\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem."},"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":"1510.00634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-02T16:17:11Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"80ecdc94e09333cc347e74da2c34d3a6e6d59b6c32510679e07fe2d256b6a771","abstract_canon_sha256":"f407beaa2c4a94ad5409545bb2455497d3061d6822621040d678836f5bde83c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.528779Z","signature_b64":"17LYNUCEcxnwvXNkgKseC3AqsNUSWSyeSiIsq8idMIT9imgVXI94kr3mlXx/E8A4BSNwHaRwfBBTd56SCaEbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a549c5a4dd72fdbad922db8245f2077dae4e9d5b3b0d5ce1f7b68d51eb43a252","last_reissued_at":"2026-05-18T00:53:45.528234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.528234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Easy and Efficient Computation of Full Abelian Periods of a Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Arnaud Lefebvre, \\'Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq, William F. Smyth","submitted_at":"2015-10-02T16:17:11Z","abstract_excerpt":"Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\\log\\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00634","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":"1510.00634","created_at":"2026-05-18T00:53:45.528322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00634v1","created_at":"2026-05-18T00:53:45.528322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00634","created_at":"2026-05-18T00:53:45.528322+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVE4LJG5OL63","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVE4LJG5OL63VWJC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVE4LJG5","created_at":"2026-05-18T12:29:44.643036+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/UVE4LJG5OL63VWJC3OBEL4QHPW","json":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW.json","graph_json":"https://pith.science/api/pith-number/UVE4LJG5OL63VWJC3OBEL4QHPW/graph.json","events_json":"https://pith.science/api/pith-number/UVE4LJG5OL63VWJC3OBEL4QHPW/events.json","paper":"https://pith.science/paper/UVE4LJG5"},"agent_actions":{"view_html":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW","download_json":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW.json","view_paper":"https://pith.science/paper/UVE4LJG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00634&json=true","fetch_graph":"https://pith.science/api/pith-number/UVE4LJG5OL63VWJC3OBEL4QHPW/graph.json","fetch_events":"https://pith.science/api/pith-number/UVE4LJG5OL63VWJC3OBEL4QHPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW/action/storage_attestation","attest_author":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW/action/author_attestation","sign_citation":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW/action/citation_signature","submit_replication":"https://pith.science/pith/UVE4LJG5OL63VWJC3OBEL4QHPW/action/replication_record"}},"created_at":"2026-05-18T00:53:45.528322+00:00","updated_at":"2026-05-18T00:53:45.528322+00:00"}