{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:63W52QF65KLS2NDOVGXTDFDWYI","short_pith_number":"pith:63W52QF6","schema_version":"1.0","canonical_sha256":"f6eddd40beea972d346ea9af319476c21eade2cc8ffcb8029e0b53496f48a626","source":{"kind":"arxiv","id":"1404.3395","version":3},"attestation_state":"computed","paper":{"title":"Nested sets, set partitions and Kirkman-Cayley dissection numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giovanni Gaiffi","submitted_at":"2014-04-13T15:53:20Z","abstract_excerpt":"In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \\(k\\) subsets of \\(\\{1,2,...,n\\}\\) with cardinality \\(\\geq 2\\) and the set of partitions of \\(\\{1,2,...,n+k-1\\}\\) into \\(k\\) parts with cardinality \\(\\geq 2\\)."},"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":"1404.3395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-13T15:53:20Z","cross_cats_sorted":[],"title_canon_sha256":"677d502cd0e69547b17f0bc692d9da7b53fdfc4b32c90acdd3bb943e0441589a","abstract_canon_sha256":"2ff07eddf927befa0872b088a436abcb7ff03ac74cdbd346cbdb4a991c548829"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:11.683773Z","signature_b64":"oPqWgEzzGu6je5cGhYyPY5DGVQKONLGwg0H91+vue2I6TotL0pRpBeZdxyXWcOgOmkduuoTuGNK92PC0YBAGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6eddd40beea972d346ea9af319476c21eade2cc8ffcb8029e0b53496f48a626","last_reissued_at":"2026-05-18T02:49:11.683344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:11.683344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested sets, set partitions and Kirkman-Cayley dissection numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giovanni Gaiffi","submitted_at":"2014-04-13T15:53:20Z","abstract_excerpt":"In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \\(k\\) subsets of \\(\\{1,2,...,n\\}\\) with cardinality \\(\\geq 2\\) and the set of partitions of \\(\\{1,2,...,n+k-1\\}\\) into \\(k\\) parts with cardinality \\(\\geq 2\\)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3395","kind":"arxiv","version":3},"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":"1404.3395","created_at":"2026-05-18T02:49:11.683406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3395v3","created_at":"2026-05-18T02:49:11.683406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3395","created_at":"2026-05-18T02:49:11.683406+00:00"},{"alias_kind":"pith_short_12","alias_value":"63W52QF65KLS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"63W52QF65KLS2NDO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"63W52QF6","created_at":"2026-05-18T12:28:16.859392+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/63W52QF65KLS2NDOVGXTDFDWYI","json":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI.json","graph_json":"https://pith.science/api/pith-number/63W52QF65KLS2NDOVGXTDFDWYI/graph.json","events_json":"https://pith.science/api/pith-number/63W52QF65KLS2NDOVGXTDFDWYI/events.json","paper":"https://pith.science/paper/63W52QF6"},"agent_actions":{"view_html":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI","download_json":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI.json","view_paper":"https://pith.science/paper/63W52QF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3395&json=true","fetch_graph":"https://pith.science/api/pith-number/63W52QF65KLS2NDOVGXTDFDWYI/graph.json","fetch_events":"https://pith.science/api/pith-number/63W52QF65KLS2NDOVGXTDFDWYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI/action/storage_attestation","attest_author":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI/action/author_attestation","sign_citation":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI/action/citation_signature","submit_replication":"https://pith.science/pith/63W52QF65KLS2NDOVGXTDFDWYI/action/replication_record"}},"created_at":"2026-05-18T02:49:11.683406+00:00","updated_at":"2026-05-18T02:49:11.683406+00:00"}