{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YPZKBOPOFDXQWSYOPYZ4N4KQ6P","short_pith_number":"pith:YPZKBOPO","schema_version":"1.0","canonical_sha256":"c3f2a0b9ee28ef0b4b0e7e33c6f150f3df081a723445b101c23043d176b579fd","source":{"kind":"arxiv","id":"2409.09133","version":1},"attestation_state":"computed","paper":{"title":"Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Coleson Weir, Federico Ardila-Mantilla, Naya Banerjee","submitted_at":"2024-09-13T18:16:10Z","abstract_excerpt":"We prove that two natural Markov chains on the set of monotone paths in a strip mix slowly. To do so, we make novel use of the theory of non-positively curved (CAT(0)) cubical complexes to detect small bottlenecks in many graphs of combinatorial interest. Along the way, we give a formula for the number c_m(n) of monotone paths of length n in a strip of height m. In particular we compute the exponential growth constant of c_m(n) for arbitrary m, generalizing results of Williams for m=2, 3."},"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":"2409.09133","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-13T18:16:10Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8d0a63b0a21f47c9981f29b188638dc62d2f4d7e954232c70f0da14d84734357","abstract_canon_sha256":"06e853ece70fa6c894e03dbd8de0afef0d68f7028b11efc00c2135621d054b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:05.570028Z","signature_b64":"FNU7CzM77qEqftkMuZ6zqybQKQSzSUcdMIzdKHExVJxaU969j8DPq1o8csgjK061xZOn6Jedpy4HDMb5bz4WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f2a0b9ee28ef0b4b0e7e33c6f150f3df081a723445b101c23043d176b579fd","last_reissued_at":"2026-07-05T09:07:05.569535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:05.569535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Coleson Weir, Federico Ardila-Mantilla, Naya Banerjee","submitted_at":"2024-09-13T18:16:10Z","abstract_excerpt":"We prove that two natural Markov chains on the set of monotone paths in a strip mix slowly. To do so, we make novel use of the theory of non-positively curved (CAT(0)) cubical complexes to detect small bottlenecks in many graphs of combinatorial interest. Along the way, we give a formula for the number c_m(n) of monotone paths of length n in a strip of height m. In particular we compute the exponential growth constant of c_m(n) for arbitrary m, generalizing results of Williams for m=2, 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09133","kind":"arxiv","version":1},"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/2409.09133/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":"2409.09133","created_at":"2026-07-05T09:07:05.569593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09133v1","created_at":"2026-07-05T09:07:05.569593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09133","created_at":"2026-07-05T09:07:05.569593+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPZKBOPOFDXQ","created_at":"2026-07-05T09:07:05.569593+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPZKBOPOFDXQWSYO","created_at":"2026-07-05T09:07:05.569593+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPZKBOPO","created_at":"2026-07-05T09:07:05.569593+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/YPZKBOPOFDXQWSYOPYZ4N4KQ6P","json":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P.json","graph_json":"https://pith.science/api/pith-number/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/graph.json","events_json":"https://pith.science/api/pith-number/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/events.json","paper":"https://pith.science/paper/YPZKBOPO"},"agent_actions":{"view_html":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P","download_json":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P.json","view_paper":"https://pith.science/paper/YPZKBOPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09133&json=true","fetch_graph":"https://pith.science/api/pith-number/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/graph.json","fetch_events":"https://pith.science/api/pith-number/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/action/storage_attestation","attest_author":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/action/author_attestation","sign_citation":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/action/citation_signature","submit_replication":"https://pith.science/pith/YPZKBOPOFDXQWSYOPYZ4N4KQ6P/action/replication_record"}},"created_at":"2026-07-05T09:07:05.569593+00:00","updated_at":"2026-07-05T09:07:05.569593+00:00"}