{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B2NOSLHNKQWGML6QAMD7DNPV6X","short_pith_number":"pith:B2NOSLHN","schema_version":"1.0","canonical_sha256":"0e9ae92ced542c662fd00307f1b5f5f5d92ce1995d1d05b8cf1d42647bbb272e","source":{"kind":"arxiv","id":"1506.03562","version":1},"attestation_state":"computed","paper":{"title":"Words with the Maximum Number of Abelian Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Filippo Mignosi, Gabriele Fici","submitted_at":"2015-06-11T06:42:19Z","abstract_excerpt":"An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length $n$ grows quadratically with $n$."},"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":"1506.03562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-11T06:42:19Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"b90ca4abc990cb1c74aa7d5ad3b45ad864adb9472965cf0d9ff1631f2a936983","abstract_canon_sha256":"7c7293fbcf83297153f6330e5103ccf7de492d3d56097cf8392822e6f2f737e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:03.824598Z","signature_b64":"pYc6AWgdQEN/PNJ1BIdxilCcUSdwssIVwxG5LpRvv8e4idv1inWw7l+IZaHLc4kX24+yye5IVi217sIzzyPtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9ae92ced542c662fd00307f1b5f5f5d92ce1995d1d05b8cf1d42647bbb272e","last_reissued_at":"2026-05-18T01:53:03.824171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:03.824171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Words with the Maximum Number of Abelian Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Filippo Mignosi, Gabriele Fici","submitted_at":"2015-06-11T06:42:19Z","abstract_excerpt":"An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length $n$ grows quadratically with $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03562","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":"1506.03562","created_at":"2026-05-18T01:53:03.824240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03562v1","created_at":"2026-05-18T01:53:03.824240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03562","created_at":"2026-05-18T01:53:03.824240+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2NOSLHNKQWG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2NOSLHNKQWGML6Q","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2NOSLHN","created_at":"2026-05-18T12:29:14.074870+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/B2NOSLHNKQWGML6QAMD7DNPV6X","json":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X.json","graph_json":"https://pith.science/api/pith-number/B2NOSLHNKQWGML6QAMD7DNPV6X/graph.json","events_json":"https://pith.science/api/pith-number/B2NOSLHNKQWGML6QAMD7DNPV6X/events.json","paper":"https://pith.science/paper/B2NOSLHN"},"agent_actions":{"view_html":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X","download_json":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X.json","view_paper":"https://pith.science/paper/B2NOSLHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03562&json=true","fetch_graph":"https://pith.science/api/pith-number/B2NOSLHNKQWGML6QAMD7DNPV6X/graph.json","fetch_events":"https://pith.science/api/pith-number/B2NOSLHNKQWGML6QAMD7DNPV6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X/action/storage_attestation","attest_author":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X/action/author_attestation","sign_citation":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X/action/citation_signature","submit_replication":"https://pith.science/pith/B2NOSLHNKQWGML6QAMD7DNPV6X/action/replication_record"}},"created_at":"2026-05-18T01:53:03.824240+00:00","updated_at":"2026-05-18T01:53:03.824240+00:00"}