{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVE4LJG5OL63VWJC3OBEL4QHPW","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":"f407beaa2c4a94ad5409545bb2455497d3061d6822621040d678836f5bde83c8","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-02T16:17:11Z","title_canon_sha256":"80ecdc94e09333cc347e74da2c34d3a6e6d59b6c32510679e07fe2d256b6a771"},"schema_version":"1.0","source":{"id":"1510.00634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00634","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00634v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00634","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"UVE4LJG5OL63","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVE4LJG5OL63VWJC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVE4LJG5","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:705ab6ddb14bc60c97c75c01973e49b7e761885f46042a790b559d8e3d4c6dac","target":"graph","created_at":"2026-05-18T00:53:45Z","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":"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.","authors_text":"Arnaud Lefebvre, \\'Elise Prieur-Gaston, Gabriele Fici, Thierry Lecroq, William F. Smyth","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-02T16:17:11Z","title":"A Note on Easy and Efficient Computation of Full Abelian Periods of a Word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00634","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:09e7b64f2454907c683c1f911ae23e1c3d679efbf9977b5fbd647b2c45d92d42","target":"record","created_at":"2026-05-18T00:53:45Z","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":"f407beaa2c4a94ad5409545bb2455497d3061d6822621040d678836f5bde83c8","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-02T16:17:11Z","title_canon_sha256":"80ecdc94e09333cc347e74da2c34d3a6e6d59b6c32510679e07fe2d256b6a771"},"schema_version":"1.0","source":{"id":"1510.00634","kind":"arxiv","version":1}},"canonical_sha256":"a549c5a4dd72fdbad922db8245f2077dae4e9d5b3b0d5ce1f7b68d51eb43a252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a549c5a4dd72fdbad922db8245f2077dae4e9d5b3b0d5ce1f7b68d51eb43a252","first_computed_at":"2026-05-18T00:53:45.528234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:45.528234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"17LYNUCEcxnwvXNkgKseC3AqsNUSWSyeSiIsq8idMIT9imgVXI94kr3mlXx/E8A4BSNwHaRwfBBTd56SCaEbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:45.528779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09e7b64f2454907c683c1f911ae23e1c3d679efbf9977b5fbd647b2c45d92d42","sha256:705ab6ddb14bc60c97c75c01973e49b7e761885f46042a790b559d8e3d4c6dac"],"state_sha256":"1dda913bb8657b1e48e4fdabd75b1b174fd7536ffe97c4f9f760a42efd94ff78"}