{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HBSAKJGACP3OCBSNPO7K2GSSCC","short_pith_number":"pith:HBSAKJGA","schema_version":"1.0","canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","source":{"kind":"arxiv","id":"2511.09480","version":2},"attestation_state":"computed","paper":{"title":"Enumeration in the lattice of $q$-decreasing words","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Luc Baril, Nathana\\\"el Hassler, Sergey Kirgizov","submitted_at":"2025-11-12T16:51:44Z","abstract_excerpt":"We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of coverings, intervals and meet-irreducible elements. The latter present the same structure as words over an alphabet of $2\\lceil q\\rceil+1$ letters avoiding $\\lceil q\\rceil^2+2\\lceil q\\rceil-1$ consecutive patterns of length 2. Furthermore, we analyze the asymptotic behavior of several of these quantities."},"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":"2511.09480","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-12T16:51:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"90b81b85db8cd478e82e0442e7f613c2bb7eac9f1e3bb2f156143f6a1c5be2c6","abstract_canon_sha256":"fa4db3e9e674cd98d6ecb1d028e1382796cbaf9cad61ff873f2faa55d682dfb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:16.206764Z","signature_b64":"utL5b7ZWpr7B7DKX5IzoD02nvk+0+sYH1QGA13i8uYefmQ2Xg3JcoUKoLLA2lJpEmypQZh+xF5DpiNl8uU7wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","last_reissued_at":"2026-06-19T16:12:16.206339Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:16.206339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration in the lattice of $q$-decreasing words","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Luc Baril, Nathana\\\"el Hassler, Sergey Kirgizov","submitted_at":"2025-11-12T16:51:44Z","abstract_excerpt":"We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of coverings, intervals and meet-irreducible elements. The latter present the same structure as words over an alphabet of $2\\lceil q\\rceil+1$ letters avoiding $\\lceil q\\rceil^2+2\\lceil q\\rceil-1$ consecutive patterns of length 2. Furthermore, we analyze the asymptotic behavior of several of these quantities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.09480","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.09480/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":"2511.09480","created_at":"2026-06-19T16:12:16.206398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.09480v2","created_at":"2026-06-19T16:12:16.206398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.09480","created_at":"2026-06-19T16:12:16.206398+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBSAKJGACP3O","created_at":"2026-06-19T16:12:16.206398+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBSAKJGACP3OCBSN","created_at":"2026-06-19T16:12:16.206398+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBSAKJGA","created_at":"2026-06-19T16:12:16.206398+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/HBSAKJGACP3OCBSNPO7K2GSSCC","json":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC.json","graph_json":"https://pith.science/api/pith-number/HBSAKJGACP3OCBSNPO7K2GSSCC/graph.json","events_json":"https://pith.science/api/pith-number/HBSAKJGACP3OCBSNPO7K2GSSCC/events.json","paper":"https://pith.science/paper/HBSAKJGA"},"agent_actions":{"view_html":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC","download_json":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC.json","view_paper":"https://pith.science/paper/HBSAKJGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.09480&json=true","fetch_graph":"https://pith.science/api/pith-number/HBSAKJGACP3OCBSNPO7K2GSSCC/graph.json","fetch_events":"https://pith.science/api/pith-number/HBSAKJGACP3OCBSNPO7K2GSSCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/action/storage_attestation","attest_author":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/action/author_attestation","sign_citation":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/action/citation_signature","submit_replication":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/action/replication_record"}},"created_at":"2026-06-19T16:12:16.206398+00:00","updated_at":"2026-06-19T16:12:16.206398+00:00"}