{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PXSXA5YKB2MFLO5DO35EUV63TV","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":"5f761d5db7f6c5e0e7406a37cc98961ad7cd78699e2acab30d3d15edda560072","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-19T21:04:31Z","title_canon_sha256":"a7168a82da60e58f79eaa4479e73b0d3f750f9f153477f1eb41f872d40edcdbd"},"schema_version":"1.0","source":{"id":"1506.06157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06157","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06157v1","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06157","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"PXSXA5YKB2MF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXSXA5YKB2MFLO5D","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXSXA5YK","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:3bd74e996e832f2a410dfab92947a930bcd75a601caeac5b945faa83775f18ee","target":"graph","created_at":"2026-05-18T01:41:58Z","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"},"paper":{"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.","authors_text":"Gregory J. Puleo","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-19T21:04:31Z","title":"Complexity of a Disjoint Matching Problem on Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06157","kind":"arxiv","version":1},"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:b4cfef85189ea40917eb24676a8fd4eda66e91915f3a5a439b79a762902637d2","target":"record","created_at":"2026-05-18T01:41:58Z","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":"5f761d5db7f6c5e0e7406a37cc98961ad7cd78699e2acab30d3d15edda560072","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-19T21:04:31Z","title_canon_sha256":"a7168a82da60e58f79eaa4479e73b0d3f750f9f153477f1eb41f872d40edcdbd"},"schema_version":"1.0","source":{"id":"1506.06157","kind":"arxiv","version":1}},"canonical_sha256":"7de570770a0e9855bba376fa4a57db9d52c837b1d4af4deaa78ce1ecc4cee8fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7de570770a0e9855bba376fa4a57db9d52c837b1d4af4deaa78ce1ecc4cee8fb","first_computed_at":"2026-05-18T01:41:58.613035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:58.613035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e+WNK1kKxicib/bCkAlUZeAR1RI0690d6b+vCQ1DhBbL4ZWH3SoHx9PgQuGiMOkcedv/ZN8c7uCGE0Q3M9SyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:58.613679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cfef85189ea40917eb24676a8fd4eda66e91915f3a5a439b79a762902637d2","sha256:3bd74e996e832f2a410dfab92947a930bcd75a601caeac5b945faa83775f18ee"],"state_sha256":"fe0506cef7cf152cd083661b1e9600e252f0b40de91d564fd990c06c0a40a713"}