{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FXMO5DLVWMQ67XY6QIPYR3GEJK","short_pith_number":"pith:FXMO5DLV","schema_version":"1.0","canonical_sha256":"2dd8ee8d75b321efdf1e821f88ecc44a85c71fa66cb94cccb4b17a0d51247f2e","source":{"kind":"arxiv","id":"1508.01688","version":5},"attestation_state":"computed","paper":{"title":"Modular Catalan Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Huang, Nickolas Hein","submitted_at":"2015-08-07T13:39:06Z","abstract_excerpt":"The Catalan number $C_n$ enumerates parenthesizations of $x_0*\\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\\dotsb*x_n$ when $*$ satisfies a $k$-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by $C_{k,n}$ with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for $C_{k,n}$ with two different proofs. For each $n\\ge0$ we compute the largest size of $"},"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":"1508.01688","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T13:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"dc87237ec54c57756367d58be79c84d5c2a492d531192a6d685d1cd426e91466","abstract_canon_sha256":"816efcec8342634d760e727a4073251adeea11c33e46b5c75ff37cbeed55c8fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.543019Z","signature_b64":"0N+Pqg89uVBMUlqAmvFKND+95ake5Ss2VNlQ2HOsc1UA3//+Tm4P21D6wnzey//96gWKBhu6Re9LQTsQJOL2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd8ee8d75b321efdf1e821f88ecc44a85c71fa66cb94cccb4b17a0d51247f2e","last_reissued_at":"2026-05-18T00:59:35.542371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.542371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Catalan Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Huang, Nickolas Hein","submitted_at":"2015-08-07T13:39:06Z","abstract_excerpt":"The Catalan number $C_n$ enumerates parenthesizations of $x_0*\\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\\dotsb*x_n$ when $*$ satisfies a $k$-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by $C_{k,n}$ with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for $C_{k,n}$ with two different proofs. For each $n\\ge0$ we compute the largest size of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01688","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.01688","created_at":"2026-05-18T00:59:35.542473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01688v5","created_at":"2026-05-18T00:59:35.542473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01688","created_at":"2026-05-18T00:59:35.542473+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXMO5DLVWMQ6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXMO5DLVWMQ67XY6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXMO5DLV","created_at":"2026-05-18T12:29:22.688609+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/FXMO5DLVWMQ67XY6QIPYR3GEJK","json":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK.json","graph_json":"https://pith.science/api/pith-number/FXMO5DLVWMQ67XY6QIPYR3GEJK/graph.json","events_json":"https://pith.science/api/pith-number/FXMO5DLVWMQ67XY6QIPYR3GEJK/events.json","paper":"https://pith.science/paper/FXMO5DLV"},"agent_actions":{"view_html":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK","download_json":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK.json","view_paper":"https://pith.science/paper/FXMO5DLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01688&json=true","fetch_graph":"https://pith.science/api/pith-number/FXMO5DLVWMQ67XY6QIPYR3GEJK/graph.json","fetch_events":"https://pith.science/api/pith-number/FXMO5DLVWMQ67XY6QIPYR3GEJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK/action/storage_attestation","attest_author":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK/action/author_attestation","sign_citation":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK/action/citation_signature","submit_replication":"https://pith.science/pith/FXMO5DLVWMQ67XY6QIPYR3GEJK/action/replication_record"}},"created_at":"2026-05-18T00:59:35.542473+00:00","updated_at":"2026-05-18T00:59:35.542473+00:00"}