{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BKJ3YT6AGLSTBW25LBNIDNA5KC","short_pith_number":"pith:BKJ3YT6A","schema_version":"1.0","canonical_sha256":"0a93bc4fc032e530db5d585a81b41d50bbcbbf0faaed1f5b42f321eb1baf0d33","source":{"kind":"arxiv","id":"2101.00127","version":1},"attestation_state":"computed","paper":{"title":"Formalizing Hall's Marriage Theorem in Lean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CO","authors_text":"Alena Gusakov, Bhavik Mehta, Kyle A. Miller","submitted_at":"2021-01-01T01:10:31Z","abstract_excerpt":"We formalize Hall's Marriage Theorem in the Lean theorem prover for inclusion in mathlib, which is a community-driven effort to build a unified mathematics library for Lean. One goal of the mathlib project is to contain all of the topics of a complete undergraduate mathematics education.\n  We provide three presentations of the main theorem statement: in terms of indexed families of finite sets, of relations on types, and of matchings in bipartite graphs. We also formalize a version of K\\H{o}nig's lemma (in terms of inverse limits) to boost the theorem to the case of countably infinite index se"},"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":"2101.00127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-01-01T01:10:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6ffa57279ea754913b8a7ad8c1f91ab635c971827d2a31370f803e6bc9a37990","abstract_canon_sha256":"9a81bbfa9821bdeb40ce30d12c65d082acd7d5d827fbe52949bdecd36e90d473"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:15.696181Z","signature_b64":"8MhnwHFVFplieMtWdE21+IWY4LABOmFG51ILTcrTd0DN8ykuIj8qfQCBH+RNyALZS3YNcEMWZYALA8i0/RzPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a93bc4fc032e530db5d585a81b41d50bbcbbf0faaed1f5b42f321eb1baf0d33","last_reissued_at":"2026-07-05T02:04:15.695782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:15.695782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formalizing Hall's Marriage Theorem in Lean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CO","authors_text":"Alena Gusakov, Bhavik Mehta, Kyle A. Miller","submitted_at":"2021-01-01T01:10:31Z","abstract_excerpt":"We formalize Hall's Marriage Theorem in the Lean theorem prover for inclusion in mathlib, which is a community-driven effort to build a unified mathematics library for Lean. One goal of the mathlib project is to contain all of the topics of a complete undergraduate mathematics education.\n  We provide three presentations of the main theorem statement: in terms of indexed families of finite sets, of relations on types, and of matchings in bipartite graphs. We also formalize a version of K\\H{o}nig's lemma (in terms of inverse limits) to boost the theorem to the case of countably infinite index se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00127","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.00127/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":"2101.00127","created_at":"2026-07-05T02:04:15.695840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.00127v1","created_at":"2026-07-05T02:04:15.695840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00127","created_at":"2026-07-05T02:04:15.695840+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKJ3YT6AGLST","created_at":"2026-07-05T02:04:15.695840+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKJ3YT6AGLSTBW25","created_at":"2026-07-05T02:04:15.695840+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKJ3YT6A","created_at":"2026-07-05T02:04:15.695840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18146","citing_title":"Tutte's theorem as an educational formalization project","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC","json":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC.json","graph_json":"https://pith.science/api/pith-number/BKJ3YT6AGLSTBW25LBNIDNA5KC/graph.json","events_json":"https://pith.science/api/pith-number/BKJ3YT6AGLSTBW25LBNIDNA5KC/events.json","paper":"https://pith.science/paper/BKJ3YT6A"},"agent_actions":{"view_html":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC","download_json":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC.json","view_paper":"https://pith.science/paper/BKJ3YT6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.00127&json=true","fetch_graph":"https://pith.science/api/pith-number/BKJ3YT6AGLSTBW25LBNIDNA5KC/graph.json","fetch_events":"https://pith.science/api/pith-number/BKJ3YT6AGLSTBW25LBNIDNA5KC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC/action/storage_attestation","attest_author":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC/action/author_attestation","sign_citation":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC/action/citation_signature","submit_replication":"https://pith.science/pith/BKJ3YT6AGLSTBW25LBNIDNA5KC/action/replication_record"}},"created_at":"2026-07-05T02:04:15.695840+00:00","updated_at":"2026-07-05T02:04:15.695840+00:00"}