{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PEZGDMG3WRVTB6BFLEKZJTNZQZ","short_pith_number":"pith:PEZGDMG3","schema_version":"1.0","canonical_sha256":"793261b0dbb46b30f825591594cdb9864fe23b3a524ea5056058b302d0fd2236","source":{"kind":"arxiv","id":"1908.06789","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Proof of the Minimal Excludant Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Cristina Ballantine, Mircea Merca","submitted_at":"2019-08-19T13:23:21Z","abstract_excerpt":"The minimal excludant of a partition $\\lambda$, $\\rm{mex}(\\lambda)$, is the smallest positive integer that is not a part of $\\lambda$. For a positive integer $n$, $ \\sigma\\, \\rm{mex}(n)$ denotes the sum of the minimal excludants of all partitions of $n$. Recently, Andrews and Newman obtained a new combinatorial interpretations for $\\sigma\\, \\rm{mex}(n)$. They showed, using generating functions, that $\\sigma\\, \\rm{mex}(n)$ equals the number of partitions of $n$ into distinct parts using two colors.\n  In this paper, we provide a purely combinatorial proof of this result and new properties of the"},"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":"1908.06789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-19T13:23:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d653954a58b2e63d00f35a9b6d7432a2fddc61989729f8a04fe4922550a36cb6","abstract_canon_sha256":"831677202dd8f93da886f04beffd3b802e6dd469d5a63d66da5a1119f08a5890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:00.394822Z","signature_b64":"Ptjsi7dnUcNJn0scqhSxxHQ3FHtWugEQcebt3lhwdB3GRy5ashceLoGHnY+OQyY80jxwCFPFCQ9JqlCODbYzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"793261b0dbb46b30f825591594cdb9864fe23b3a524ea5056058b302d0fd2236","last_reissued_at":"2026-07-05T01:09:00.394358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:00.394358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Proof of the Minimal Excludant Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Cristina Ballantine, Mircea Merca","submitted_at":"2019-08-19T13:23:21Z","abstract_excerpt":"The minimal excludant of a partition $\\lambda$, $\\rm{mex}(\\lambda)$, is the smallest positive integer that is not a part of $\\lambda$. For a positive integer $n$, $ \\sigma\\, \\rm{mex}(n)$ denotes the sum of the minimal excludants of all partitions of $n$. Recently, Andrews and Newman obtained a new combinatorial interpretations for $\\sigma\\, \\rm{mex}(n)$. They showed, using generating functions, that $\\sigma\\, \\rm{mex}(n)$ equals the number of partitions of $n$ into distinct parts using two colors.\n  In this paper, we provide a purely combinatorial proof of this result and new properties of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06789","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/1908.06789/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":"1908.06789","created_at":"2026-07-05T01:09:00.394418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06789v2","created_at":"2026-07-05T01:09:00.394418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06789","created_at":"2026-07-05T01:09:00.394418+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEZGDMG3WRVT","created_at":"2026-07-05T01:09:00.394418+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEZGDMG3WRVTB6BF","created_at":"2026-07-05T01:09:00.394418+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEZGDMG3","created_at":"2026-07-05T01:09:00.394418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19696","citing_title":"Two-colored generalized Frobenius partitions and minimal-excludant sums over bipartitions","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ","json":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ.json","graph_json":"https://pith.science/api/pith-number/PEZGDMG3WRVTB6BFLEKZJTNZQZ/graph.json","events_json":"https://pith.science/api/pith-number/PEZGDMG3WRVTB6BFLEKZJTNZQZ/events.json","paper":"https://pith.science/paper/PEZGDMG3"},"agent_actions":{"view_html":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ","download_json":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ.json","view_paper":"https://pith.science/paper/PEZGDMG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06789&json=true","fetch_graph":"https://pith.science/api/pith-number/PEZGDMG3WRVTB6BFLEKZJTNZQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PEZGDMG3WRVTB6BFLEKZJTNZQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ/action/storage_attestation","attest_author":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ/action/author_attestation","sign_citation":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ/action/citation_signature","submit_replication":"https://pith.science/pith/PEZGDMG3WRVTB6BFLEKZJTNZQZ/action/replication_record"}},"created_at":"2026-07-05T01:09:00.394418+00:00","updated_at":"2026-07-05T01:09:00.394418+00:00"}