{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PXSXA5YKB2MFLO5DO35EUV63TV","short_pith_number":"pith:PXSXA5YK","schema_version":"1.0","canonical_sha256":"7de570770a0e9855bba376fa4a57db9d52c837b1d4af4deaa78ce1ecc4cee8fb","source":{"kind":"arxiv","id":"1506.06157","version":1},"attestation_state":"computed","paper":{"title":"Complexity of a Disjoint Matching Problem on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo","submitted_at":"2015-06-19T21:04:31Z","abstract_excerpt":"We consider the following question: given an $(X,Y)$-bigraph $G$ and a set $S \\subset X$, does $G$ contain two disjoint matchings $M_1$ and $M_2$ such that $M_1$ saturates $X$ and $M_2$ saturates $S$? When $|S|\\geq |X|-1$, this question is solvable by finding an appropriate factor of the graph. In contrast, we show that when $S$ is allowed to be an arbitrary subset of $X$, the problem is NP-hard."},"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":"1506.06157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-19T21:04:31Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a7168a82da60e58f79eaa4479e73b0d3f750f9f153477f1eb41f872d40edcdbd","abstract_canon_sha256":"5f761d5db7f6c5e0e7406a37cc98961ad7cd78699e2acab30d3d15edda560072"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.613679Z","signature_b64":"e+WNK1kKxicib/bCkAlUZeAR1RI0690d6b+vCQ1DhBbL4ZWH3SoHx9PgQuGiMOkcedv/ZN8c7uCGE0Q3M9SyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7de570770a0e9855bba376fa4a57db9d52c837b1d4af4deaa78ce1ecc4cee8fb","last_reissued_at":"2026-05-18T01:41:58.613035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.613035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of a Disjoint Matching Problem on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo","submitted_at":"2015-06-19T21:04:31Z","abstract_excerpt":"We consider the following question: given an $(X,Y)$-bigraph $G$ and a set $S \\subset X$, does $G$ contain two disjoint matchings $M_1$ and $M_2$ such that $M_1$ saturates $X$ and $M_2$ saturates $S$? When $|S|\\geq |X|-1$, this question is solvable by finding an appropriate factor of the graph. In contrast, we show that when $S$ is allowed to be an arbitrary subset of $X$, the problem is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06157","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":""},"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":"1506.06157","created_at":"2026-05-18T01:41:58.613131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06157v1","created_at":"2026-05-18T01:41:58.613131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06157","created_at":"2026-05-18T01:41:58.613131+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXSXA5YKB2MF","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXSXA5YKB2MFLO5D","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXSXA5YK","created_at":"2026-05-18T12:29:37.295048+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/PXSXA5YKB2MFLO5DO35EUV63TV","json":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV.json","graph_json":"https://pith.science/api/pith-number/PXSXA5YKB2MFLO5DO35EUV63TV/graph.json","events_json":"https://pith.science/api/pith-number/PXSXA5YKB2MFLO5DO35EUV63TV/events.json","paper":"https://pith.science/paper/PXSXA5YK"},"agent_actions":{"view_html":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV","download_json":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV.json","view_paper":"https://pith.science/paper/PXSXA5YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06157&json=true","fetch_graph":"https://pith.science/api/pith-number/PXSXA5YKB2MFLO5DO35EUV63TV/graph.json","fetch_events":"https://pith.science/api/pith-number/PXSXA5YKB2MFLO5DO35EUV63TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV/action/storage_attestation","attest_author":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV/action/author_attestation","sign_citation":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV/action/citation_signature","submit_replication":"https://pith.science/pith/PXSXA5YKB2MFLO5DO35EUV63TV/action/replication_record"}},"created_at":"2026-05-18T01:41:58.613131+00:00","updated_at":"2026-05-18T01:41:58.613131+00:00"}