{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PEZGDMG3WRVTB6BFLEKZJTNZQZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"831677202dd8f93da886f04beffd3b802e6dd469d5a63d66da5a1119f08a5890","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-19T13:23:21Z","title_canon_sha256":"d653954a58b2e63d00f35a9b6d7432a2fddc61989729f8a04fe4922550a36cb6"},"schema_version":"1.0","source":{"id":"1908.06789","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06789","created_at":"2026-07-05T01:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06789v2","created_at":"2026-07-05T01:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06789","created_at":"2026-07-05T01:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"PEZGDMG3WRVT","created_at":"2026-07-05T01:09:00Z"},{"alias_kind":"pith_short_16","alias_value":"PEZGDMG3WRVTB6BF","created_at":"2026-07-05T01:09:00Z"},{"alias_kind":"pith_short_8","alias_value":"PEZGDMG3","created_at":"2026-07-05T01:09:00Z"}],"graph_snapshots":[{"event_id":"sha256:40e25fcf02c8121a4a8bcea43549fb3d306a285cde52b9e151f6485f64dc052c","target":"graph","created_at":"2026-07-05T01:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06789/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cristina Ballantine, Mircea Merca","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-19T13:23:21Z","title":"Combinatorial Proof of the Minimal Excludant Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06789","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:328cdb940f9dc5df13a127728291ea064319578ed7fb484411857344f9001731","target":"record","created_at":"2026-07-05T01:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"831677202dd8f93da886f04beffd3b802e6dd469d5a63d66da5a1119f08a5890","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-19T13:23:21Z","title_canon_sha256":"d653954a58b2e63d00f35a9b6d7432a2fddc61989729f8a04fe4922550a36cb6"},"schema_version":"1.0","source":{"id":"1908.06789","kind":"arxiv","version":2}},"canonical_sha256":"793261b0dbb46b30f825591594cdb9864fe23b3a524ea5056058b302d0fd2236","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"793261b0dbb46b30f825591594cdb9864fe23b3a524ea5056058b302d0fd2236","first_computed_at":"2026-07-05T01:09:00.394358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:09:00.394358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ptjsi7dnUcNJn0scqhSxxHQ3FHtWugEQcebt3lhwdB3GRy5ashceLoGHnY+OQyY80jxwCFPFCQ9JqlCODbYzCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:09:00.394822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06789","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:328cdb940f9dc5df13a127728291ea064319578ed7fb484411857344f9001731","sha256:40e25fcf02c8121a4a8bcea43549fb3d306a285cde52b9e151f6485f64dc052c"],"state_sha256":"b481a4d6005c9669b63998db96193dfb7577999c0737ec791bed4a3e8ddb8982"}