{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WOKAIWNO3PCJNAU5OGPRD3ZKCB","short_pith_number":"pith:WOKAIWNO","schema_version":"1.0","canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","source":{"kind":"arxiv","id":"1203.1203","version":2},"attestation_state":"computed","paper":{"title":"Enumeration and Structure of Trapezoidal Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Alessandro De Luca, Gabriele Fici, Michelangelo Bucci","submitted_at":"2012-03-06T14:04:29Z","abstract_excerpt":"Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal wor"},"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":"1203.1203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-06T14:04:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4cdbaced6bc5b06eb3fdf8cddbd6396bb1f9e0c0ec9e09ae7d7fdcb8160ed665","abstract_canon_sha256":"5d2ac2013f05b7d95ed9508d103b84ea40c1b8c2f9104e9144905f0bcb8c27ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:04.649680Z","signature_b64":"C+HHHevaj7QSXUnJfJkSyIPK4NZhoWpgZGvr1GD9x4nJYl38sYSOIX+B0TeKPDfyGpV4DND1P5D3C7clPAWFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","last_reissued_at":"2026-05-18T03:36:04.649099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:04.649099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration and Structure of Trapezoidal Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Alessandro De Luca, Gabriele Fici, Michelangelo Bucci","submitted_at":"2012-03-06T14:04:29Z","abstract_excerpt":"Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1203","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":"1203.1203","created_at":"2026-05-18T03:36:04.649187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1203v2","created_at":"2026-05-18T03:36:04.649187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1203","created_at":"2026-05-18T03:36:04.649187+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOKAIWNO3PCJ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOKAIWNO3PCJNAU5","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOKAIWNO","created_at":"2026-05-18T12:27:25.539911+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/WOKAIWNO3PCJNAU5OGPRD3ZKCB","json":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB.json","graph_json":"https://pith.science/api/pith-number/WOKAIWNO3PCJNAU5OGPRD3ZKCB/graph.json","events_json":"https://pith.science/api/pith-number/WOKAIWNO3PCJNAU5OGPRD3ZKCB/events.json","paper":"https://pith.science/paper/WOKAIWNO"},"agent_actions":{"view_html":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB","download_json":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB.json","view_paper":"https://pith.science/paper/WOKAIWNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1203&json=true","fetch_graph":"https://pith.science/api/pith-number/WOKAIWNO3PCJNAU5OGPRD3ZKCB/graph.json","fetch_events":"https://pith.science/api/pith-number/WOKAIWNO3PCJNAU5OGPRD3ZKCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/action/storage_attestation","attest_author":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/action/author_attestation","sign_citation":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/action/citation_signature","submit_replication":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/action/replication_record"}},"created_at":"2026-05-18T03:36:04.649187+00:00","updated_at":"2026-05-18T03:36:04.649187+00:00"}