{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:K3TCMURXEELDBBBZTTRCGRB4V5","short_pith_number":"pith:K3TCMURX","schema_version":"1.0","canonical_sha256":"56e626523721163084399ce223443caf66a2359fcfe24e4091de5a2008a121f1","source":{"kind":"arxiv","id":"0912.4983","version":1},"attestation_state":"computed","paper":{"title":"Square Partitions and Catalan Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RT","authors_text":"Matthew Bennett, Nathan Manning, R.J. Dolbin, Vyjayanthi Chari","submitted_at":"2009-12-25T20:52:35Z","abstract_excerpt":"For each integer $k\\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\\lambda$ which is square, i.e $\\lambda=\\lambda_1\\ge...\\ge\\lambda_k>0$, and $\\lambda_1=k,\\lambda_k=1$, then applying the algorithm $\\ell$ times gives rise to a set whose cardinality is either the Catalan number $c_{\\ell-k+1}$ (the self dual case) or twice the Catalan number. The algorithm defines a tree and we study the propagation of the tree, which is not in the isomorphism class of the usual Catala"},"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":"0912.4983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2009-12-25T20:52:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db5acccb8588ddd43018c3db0b95406b97a0327260e4738ee8defd9fd4176310","abstract_canon_sha256":"444b9e50fac86a3b6a4ac177c1f77ecec8baaeffa70ccc1c34f5abf4370a5a2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:46.754974Z","signature_b64":"mgtWpq3Zv5oyx/9vFixNzVtkgKwnJIPJlECBZ0HNkrnDcnfZdW5ugJzKk0LnD+/KnTet9Lsd2GLIjuBojWKwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56e626523721163084399ce223443caf66a2359fcfe24e4091de5a2008a121f1","last_reissued_at":"2026-05-18T03:48:46.754208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:46.754208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square Partitions and Catalan Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RT","authors_text":"Matthew Bennett, Nathan Manning, R.J. Dolbin, Vyjayanthi Chari","submitted_at":"2009-12-25T20:52:35Z","abstract_excerpt":"For each integer $k\\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\\lambda$ which is square, i.e $\\lambda=\\lambda_1\\ge...\\ge\\lambda_k>0$, and $\\lambda_1=k,\\lambda_k=1$, then applying the algorithm $\\ell$ times gives rise to a set whose cardinality is either the Catalan number $c_{\\ell-k+1}$ (the self dual case) or twice the Catalan number. The algorithm defines a tree and we study the propagation of the tree, which is not in the isomorphism class of the usual Catala"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.4983","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":""},"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":"0912.4983","created_at":"2026-05-18T03:48:46.754372+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.4983v1","created_at":"2026-05-18T03:48:46.754372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.4983","created_at":"2026-05-18T03:48:46.754372+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3TCMURXEELD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3TCMURXEELDBBBZ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3TCMURX","created_at":"2026-05-18T12:26:00.592388+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/K3TCMURXEELDBBBZTTRCGRB4V5","json":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5.json","graph_json":"https://pith.science/api/pith-number/K3TCMURXEELDBBBZTTRCGRB4V5/graph.json","events_json":"https://pith.science/api/pith-number/K3TCMURXEELDBBBZTTRCGRB4V5/events.json","paper":"https://pith.science/paper/K3TCMURX"},"agent_actions":{"view_html":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5","download_json":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5.json","view_paper":"https://pith.science/paper/K3TCMURX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.4983&json=true","fetch_graph":"https://pith.science/api/pith-number/K3TCMURXEELDBBBZTTRCGRB4V5/graph.json","fetch_events":"https://pith.science/api/pith-number/K3TCMURXEELDBBBZTTRCGRB4V5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5/action/storage_attestation","attest_author":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5/action/author_attestation","sign_citation":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5/action/citation_signature","submit_replication":"https://pith.science/pith/K3TCMURXEELDBBBZTTRCGRB4V5/action/replication_record"}},"created_at":"2026-05-18T03:48:46.754372+00:00","updated_at":"2026-05-18T03:48:46.754372+00:00"}