{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WOKAIWNO3PCJNAU5OGPRD3ZKCB","short_pith_number":"pith:WOKAIWNO","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"},"canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","source":{"kind":"arxiv","id":"1203.1203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1203","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1203v2","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1203","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"WOKAIWNO3PCJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WOKAIWNO3PCJNAU5","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WOKAIWNO","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WOKAIWNO3PCJNAU5OGPRD3ZKCB","target":"record","payload":{"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"},"canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","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"},"source_kind":"arxiv","source_id":"1203.1203","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Aif3nOqzIZWPXD+FPacjLEK5rcNbgryUgga+o6H8Vk8lIYG8XCKgPsgDRthvf0L9wNA28VBcUSeAHYgbnAUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:34.552576Z"},"content_sha256":"ab71693f8dabeda2eac7b0934e3f66c72159780c58d7547e515953dc820ed18e","schema_version":"1.0","event_id":"sha256:ab71693f8dabeda2eac7b0934e3f66c72159780c58d7547e515953dc820ed18e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WOKAIWNO3PCJNAU5OGPRD3ZKCB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INFc5yNDSm4BgQwk4IkAJUDeCFGGW6FRO60+QLHPkT8EGQ/8VoMGH2inJI8pRKurrAL9qbpGSKd+a4uYo/+lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:34.553278Z"},"content_sha256":"49558369230e70a23d8ca386af5b058b415a999719b409c1dbe72d4e76daf50e","schema_version":"1.0","event_id":"sha256:49558369230e70a23d8ca386af5b058b415a999719b409c1dbe72d4e76daf50e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/bundle.json","state_url":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T10:23:34Z","links":{"resolver":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB","bundle":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/bundle.json","state":"https://pith.science/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOKAIWNO3PCJNAU5OGPRD3ZKCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WOKAIWNO3PCJNAU5OGPRD3ZKCB","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":"5d2ac2013f05b7d95ed9508d103b84ea40c1b8c2f9104e9144905f0bcb8c27ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-06T14:04:29Z","title_canon_sha256":"4cdbaced6bc5b06eb3fdf8cddbd6396bb1f9e0c0ec9e09ae7d7fdcb8160ed665"},"schema_version":"1.0","source":{"id":"1203.1203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1203","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1203v2","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1203","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"WOKAIWNO3PCJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WOKAIWNO3PCJNAU5","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WOKAIWNO","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:49558369230e70a23d8ca386af5b058b415a999719b409c1dbe72d4e76daf50e","target":"graph","created_at":"2026-05-18T03:36:04Z","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":"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","authors_text":"Alessandro De Luca, Gabriele Fici, Michelangelo Bucci","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-06T14:04:29Z","title":"Enumeration and Structure of Trapezoidal Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1203","kind":"arxiv","version":2},"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:ab71693f8dabeda2eac7b0934e3f66c72159780c58d7547e515953dc820ed18e","target":"record","created_at":"2026-05-18T03:36:04Z","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":"5d2ac2013f05b7d95ed9508d103b84ea40c1b8c2f9104e9144905f0bcb8c27ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-06T14:04:29Z","title_canon_sha256":"4cdbaced6bc5b06eb3fdf8cddbd6396bb1f9e0c0ec9e09ae7d7fdcb8160ed665"},"schema_version":"1.0","source":{"id":"1203.1203","kind":"arxiv","version":2}},"canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3940459aedbc496829d719f11ef2a105e9cd9ece26dfff87ed65ecbf7889aa0","first_computed_at":"2026-05-18T03:36:04.649099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:04.649099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C+HHHevaj7QSXUnJfJkSyIPK4NZhoWpgZGvr1GD9x4nJYl38sYSOIX+B0TeKPDfyGpV4DND1P5D3C7clPAWFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:04.649680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab71693f8dabeda2eac7b0934e3f66c72159780c58d7547e515953dc820ed18e","sha256:49558369230e70a23d8ca386af5b058b415a999719b409c1dbe72d4e76daf50e"],"state_sha256":"7dd9b51310def4938c997c216d8c9ebd412d9c973de340d45b6857e9dd75797e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0oGCJLSuc44IYForuNCtBGWhEfK0yDFWo3EexosxmWolQH+AS8JJO5lpVz7xtmskpExGkdSRYps8FrhtQkUsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:23:34.557777Z","bundle_sha256":"7576640cf44f86c0941f15d199e86d5a67c6d1aae65d6c3e46160c27faf1effd"}}