{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HBSAKJGACP3OCBSNPO7K2GSSCC","short_pith_number":"pith:HBSAKJGA","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"},"canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","source":{"kind":"arxiv","id":"2511.09480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.09480","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"2511.09480v2","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.09480","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"HBSAKJGACP3O","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_16","alias_value":"HBSAKJGACP3OCBSN","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_8","alias_value":"HBSAKJGA","created_at":"2026-06-19T16:12:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HBSAKJGACP3OCBSNPO7K2GSSCC","target":"record","payload":{"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"},"canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","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"},"source_kind":"arxiv","source_id":"2511.09480","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-06-19T16:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGXbJdZeGmdd24+LLatn0fg3JzIPawKmR/yZK2KLLXbPXv8qsx0BDqJpJ7pzt6lwXtbH/QWzuyQpYnveLPKQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:35:38.465444Z"},"content_sha256":"7e4af0656fc32f76c73112b2bc9178e19d955501ef71f2b70d97611d96e3ecc3","schema_version":"1.0","event_id":"sha256:7e4af0656fc32f76c73112b2bc9178e19d955501ef71f2b70d97611d96e3ecc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HBSAKJGACP3OCBSNPO7K2GSSCC","target":"graph","payload":{"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"},"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-06-19T16:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCOrJZy/4ez3uCIp76KVWOGSfBFMXhyrv7ms26OsxE8t/EEBDN/Fe3wloXgSOCd59vboiT/YOWXuUupwNqX2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:35:38.465831Z"},"content_sha256":"8d7a8ac7031382771287a162d7a6801365cbe744f53333201eeb2bce62e648ac","schema_version":"1.0","event_id":"sha256:8d7a8ac7031382771287a162d7a6801365cbe744f53333201eeb2bce62e648ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/bundle.json","state_url":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/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-06-20T22:35:38Z","links":{"resolver":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC","bundle":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/bundle.json","state":"https://pith.science/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBSAKJGACP3OCBSNPO7K2GSSCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HBSAKJGACP3OCBSNPO7K2GSSCC","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":"fa4db3e9e674cd98d6ecb1d028e1382796cbaf9cad61ff873f2faa55d682dfb2","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-12T16:51:44Z","title_canon_sha256":"90b81b85db8cd478e82e0442e7f613c2bb7eac9f1e3bb2f156143f6a1c5be2c6"},"schema_version":"1.0","source":{"id":"2511.09480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.09480","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"2511.09480v2","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.09480","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"HBSAKJGACP3O","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_16","alias_value":"HBSAKJGACP3OCBSN","created_at":"2026-06-19T16:12:16Z"},{"alias_kind":"pith_short_8","alias_value":"HBSAKJGA","created_at":"2026-06-19T16:12:16Z"}],"graph_snapshots":[{"event_id":"sha256:8d7a8ac7031382771287a162d7a6801365cbe744f53333201eeb2bce62e648ac","target":"graph","created_at":"2026-06-19T16:12:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.09480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jean-Luc Baril, Nathana\\\"el Hassler, Sergey Kirgizov","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-12T16:51:44Z","title":"Enumeration in the lattice of $q$-decreasing words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.09480","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:7e4af0656fc32f76c73112b2bc9178e19d955501ef71f2b70d97611d96e3ecc3","target":"record","created_at":"2026-06-19T16:12:16Z","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":"fa4db3e9e674cd98d6ecb1d028e1382796cbaf9cad61ff873f2faa55d682dfb2","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-12T16:51:44Z","title_canon_sha256":"90b81b85db8cd478e82e0442e7f613c2bb7eac9f1e3bb2f156143f6a1c5be2c6"},"schema_version":"1.0","source":{"id":"2511.09480","kind":"arxiv","version":2}},"canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38640524c013f6e1064d7bbead1a5210913df0eab5f786eecb2369382d5fc2a2","first_computed_at":"2026-06-19T16:12:16.206339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:16.206339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utL5b7ZWpr7B7DKX5IzoD02nvk+0+sYH1QGA13i8uYefmQ2Xg3JcoUKoLLA2lJpEmypQZh+xF5DpiNl8uU7wBg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:16.206764Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.09480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e4af0656fc32f76c73112b2bc9178e19d955501ef71f2b70d97611d96e3ecc3","sha256:8d7a8ac7031382771287a162d7a6801365cbe744f53333201eeb2bce62e648ac"],"state_sha256":"ed35b76f0ce9dac609f6f0212799027aa33ea9be77ca024a7e57ab34d9ddb5eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fhvnxdOXxSSJzI1FczrA2XHoi1tSWg/9kCq2QgTDoEpuTNum9UCXGmArugYs42bJDXd1ebR/NNgRoSfvNSxgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:35:38.467874Z","bundle_sha256":"0a8f506db84d2d75b8cfcd1860bf2da211857d90190a6eebb63a21e89039ff47"}}