{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PSKW5LOLUDADTYGKYFB2RIOZWM","short_pith_number":"pith:PSKW5LOL","schema_version":"1.0","canonical_sha256":"7c956eadcba0c039e0cac143a8a1d9b317904711767ae4df5305e018b26d7671","source":{"kind":"arxiv","id":"1208.3313","version":1},"attestation_state":"computed","paper":{"title":"A Note on Efficient Computation of All Abelian Periods in a String","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Costas Iliopoulos, Jakub Pachocki, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter, Wojciech Tyczy\\'nski","submitted_at":"2012-08-16T08:33:36Z","abstract_excerpt":"We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for Abelian squares. We also obtain a linear time algorithm finding all `long' Abelian periods. The aim of the paper is a (new) reduction of the problem of all Abelian periods to that of (already solved) all Abelian squares which provides new insight into both connected problems."},"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":"1208.3313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-16T08:33:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1e60d261d110c381ab24259309c5e95de52b1911ba66f69f0bd2f7f1d65bf2b6","abstract_canon_sha256":"6e071de389c443804d240b23eb86bc903e18d66e6f19da81603a93b6ac25ac9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.098228Z","signature_b64":"/kJJcGgbX0PBkrybc78r6okcnICUcriuoDBkHh1xUKqW68g5Laxc7S0u2QLtUZ1BoHvEinThvswL4xTYnrcNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c956eadcba0c039e0cac143a8a1d9b317904711767ae4df5305e018b26d7671","last_reissued_at":"2026-05-18T02:21:01.097730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.097730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Efficient Computation of All Abelian Periods in a String","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Costas Iliopoulos, Jakub Pachocki, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter, Wojciech Tyczy\\'nski","submitted_at":"2012-08-16T08:33:36Z","abstract_excerpt":"We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for Abelian squares. We also obtain a linear time algorithm finding all `long' Abelian periods. The aim of the paper is a (new) reduction of the problem of all Abelian periods to that of (already solved) all Abelian squares which provides new insight into both connected problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3313","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":"1208.3313","created_at":"2026-05-18T02:21:01.097799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3313v1","created_at":"2026-05-18T02:21:01.097799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3313","created_at":"2026-05-18T02:21:01.097799+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSKW5LOLUDAD","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSKW5LOLUDADTYGK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSKW5LOL","created_at":"2026-05-18T12:27:18.751474+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/PSKW5LOLUDADTYGKYFB2RIOZWM","json":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM.json","graph_json":"https://pith.science/api/pith-number/PSKW5LOLUDADTYGKYFB2RIOZWM/graph.json","events_json":"https://pith.science/api/pith-number/PSKW5LOLUDADTYGKYFB2RIOZWM/events.json","paper":"https://pith.science/paper/PSKW5LOL"},"agent_actions":{"view_html":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM","download_json":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM.json","view_paper":"https://pith.science/paper/PSKW5LOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3313&json=true","fetch_graph":"https://pith.science/api/pith-number/PSKW5LOLUDADTYGKYFB2RIOZWM/graph.json","fetch_events":"https://pith.science/api/pith-number/PSKW5LOLUDADTYGKYFB2RIOZWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM/action/storage_attestation","attest_author":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM/action/author_attestation","sign_citation":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM/action/citation_signature","submit_replication":"https://pith.science/pith/PSKW5LOLUDADTYGKYFB2RIOZWM/action/replication_record"}},"created_at":"2026-05-18T02:21:01.097799+00:00","updated_at":"2026-05-18T02:21:01.097799+00:00"}