{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SYSTN462XA5FWR4HMLH5KLMHTL","short_pith_number":"pith:SYSTN462","schema_version":"1.0","canonical_sha256":"962536f3dab83a5b478762cfd52d879ac5b0ea55b1ba0af847cf701c5705544f","source":{"kind":"arxiv","id":"1904.07218","version":4},"attestation_state":"computed","paper":{"title":"From Hall's Marriage Theorem to Boolean Satisfiability and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Jonathan Lenchner","submitted_at":"2019-04-15T17:53:45Z","abstract_excerpt":"Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional Marriage Problem is NP-Complete by reduction from Boolean Satisfiability (SAT). We show that when we view the classical marriage problem (a.k.a. bipartite matching) as a sub-class of SAT we get a new class of polynomial-time satisfiable SAT instances that we call CMP-SAT, different from the classically known polynomial-time satisfiable SAT instances 2-SAT, Horn-SAT"},"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":"1904.07218","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-15T17:53:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"966ecdf7dbe6b3c975701635dc444007b1e12495fdfb779ac38bdc4ac927d462","abstract_canon_sha256":"3ea20e7333b20be9a8003cdd171cd9df074e6666ac6270bde4c01069fbf07da0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.615540Z","signature_b64":"rhfH+b2D1NvMDxPuSN2e09ZAkggg+tXLpm+gDoEAal1vjV8h0Yjpr3RdzpKnPwNEdIJ3l5LPL9pU+Y5PE2bvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962536f3dab83a5b478762cfd52d879ac5b0ea55b1ba0af847cf701c5705544f","last_reissued_at":"2026-05-17T23:46:45.614852Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.614852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Hall's Marriage Theorem to Boolean Satisfiability and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Jonathan Lenchner","submitted_at":"2019-04-15T17:53:45Z","abstract_excerpt":"Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional Marriage Problem is NP-Complete by reduction from Boolean Satisfiability (SAT). We show that when we view the classical marriage problem (a.k.a. bipartite matching) as a sub-class of SAT we get a new class of polynomial-time satisfiable SAT instances that we call CMP-SAT, different from the classically known polynomial-time satisfiable SAT instances 2-SAT, Horn-SAT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07218","kind":"arxiv","version":4},"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":"1904.07218","created_at":"2026-05-17T23:46:45.614958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07218v4","created_at":"2026-05-17T23:46:45.614958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07218","created_at":"2026-05-17T23:46:45.614958+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYSTN462XA5F","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYSTN462XA5FWR4H","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYSTN462","created_at":"2026-05-18T12:33:27.125529+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/SYSTN462XA5FWR4HMLH5KLMHTL","json":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL.json","graph_json":"https://pith.science/api/pith-number/SYSTN462XA5FWR4HMLH5KLMHTL/graph.json","events_json":"https://pith.science/api/pith-number/SYSTN462XA5FWR4HMLH5KLMHTL/events.json","paper":"https://pith.science/paper/SYSTN462"},"agent_actions":{"view_html":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL","download_json":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL.json","view_paper":"https://pith.science/paper/SYSTN462","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07218&json=true","fetch_graph":"https://pith.science/api/pith-number/SYSTN462XA5FWR4HMLH5KLMHTL/graph.json","fetch_events":"https://pith.science/api/pith-number/SYSTN462XA5FWR4HMLH5KLMHTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL/action/storage_attestation","attest_author":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL/action/author_attestation","sign_citation":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL/action/citation_signature","submit_replication":"https://pith.science/pith/SYSTN462XA5FWR4HMLH5KLMHTL/action/replication_record"}},"created_at":"2026-05-17T23:46:45.614958+00:00","updated_at":"2026-05-17T23:46:45.614958+00:00"}