{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:55FILH3ID64IOU2JMRFU7T47HD","short_pith_number":"pith:55FILH3I","schema_version":"1.0","canonical_sha256":"ef4a859f681fb8875349644b4fcf9f38f28600d607ea6426df182f0a658c170e","source":{"kind":"arxiv","id":"2401.06228","version":3},"attestation_state":"computed","paper":{"title":"The Combinatorics of Motzkin Polyominoes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Diego Villamizar, Jean-Luc Baril, Jos\\'e L. Ram\\'irez, Sergey Kirgizov","submitted_at":"2024-01-11T19:11:19Z","abstract_excerpt":"A word $w=w_1\\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\\texttt{1}$, $1\\leq w_k\\leq w_{k-1}+1$, and $w_{k-1}\\neq w_{k}$ for $k=2, \\dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column contains $w_i$ cells, and all columns are bottom-justified. We reveal bijective connections between Motzkin paths, restricted Catalan words, primitive \\L{}ukasiewicz paths, and Motzkin polyominoes. Using the aforementioned bijections together with classical one-to-one correspondence with Dyck paths avoiding $UDU$s, we provide generating functions "},"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":"2401.06228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-11T19:11:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0c05069b91fcd03605c2bfd0898c3de890078f173237c499c1b2b7fd8ebb372","abstract_canon_sha256":"2bf953d861764b36b8415ef08c82c64ed51fc9d5187e6a7b2bf11d23358b92d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:40.707344Z","signature_b64":"oWhQvjMuf7bL09wglWJ/YuZIzx4/7Aj/7mE6CpoxxVolA2m9a87CPhy1Xvn4qMOQhULZAyLZRx2cbuKikc4yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4a859f681fb8875349644b4fcf9f38f28600d607ea6426df182f0a658c170e","last_reissued_at":"2026-07-05T08:35:40.706903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:40.706903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Combinatorics of Motzkin Polyominoes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Diego Villamizar, Jean-Luc Baril, Jos\\'e L. Ram\\'irez, Sergey Kirgizov","submitted_at":"2024-01-11T19:11:19Z","abstract_excerpt":"A word $w=w_1\\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\\texttt{1}$, $1\\leq w_k\\leq w_{k-1}+1$, and $w_{k-1}\\neq w_{k}$ for $k=2, \\dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column contains $w_i$ cells, and all columns are bottom-justified. We reveal bijective connections between Motzkin paths, restricted Catalan words, primitive \\L{}ukasiewicz paths, and Motzkin polyominoes. Using the aforementioned bijections together with classical one-to-one correspondence with Dyck paths avoiding $UDU$s, we provide generating functions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06228","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.06228/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.06228","created_at":"2026-07-05T08:35:40.706959+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.06228v3","created_at":"2026-07-05T08:35:40.706959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06228","created_at":"2026-07-05T08:35:40.706959+00:00"},{"alias_kind":"pith_short_12","alias_value":"55FILH3ID64I","created_at":"2026-07-05T08:35:40.706959+00:00"},{"alias_kind":"pith_short_16","alias_value":"55FILH3ID64IOU2J","created_at":"2026-07-05T08:35:40.706959+00:00"},{"alias_kind":"pith_short_8","alias_value":"55FILH3I","created_at":"2026-07-05T08:35:40.706959+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17812","citing_title":"Generating Trees and Fibonacci Polyominoes","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD","json":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD.json","graph_json":"https://pith.science/api/pith-number/55FILH3ID64IOU2JMRFU7T47HD/graph.json","events_json":"https://pith.science/api/pith-number/55FILH3ID64IOU2JMRFU7T47HD/events.json","paper":"https://pith.science/paper/55FILH3I"},"agent_actions":{"view_html":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD","download_json":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD.json","view_paper":"https://pith.science/paper/55FILH3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.06228&json=true","fetch_graph":"https://pith.science/api/pith-number/55FILH3ID64IOU2JMRFU7T47HD/graph.json","fetch_events":"https://pith.science/api/pith-number/55FILH3ID64IOU2JMRFU7T47HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD/action/storage_attestation","attest_author":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD/action/author_attestation","sign_citation":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD/action/citation_signature","submit_replication":"https://pith.science/pith/55FILH3ID64IOU2JMRFU7T47HD/action/replication_record"}},"created_at":"2026-07-05T08:35:40.706959+00:00","updated_at":"2026-07-05T08:35:40.706959+00:00"}