{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J4F2SL6TG6KSCUE6JI6COT3UYS","short_pith_number":"pith:J4F2SL6T","schema_version":"1.0","canonical_sha256":"4f0ba92fd3379521509e4a3c274f74c494f7e61f74d52eaf8f0f139fef125ad7","source":{"kind":"arxiv","id":"2009.04567","version":1},"attestation_state":"computed","paper":{"title":"Diverse Pairs of Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Geevarghese Philip, Lars Jaffke, Petr A. Golovach","submitted_at":"2020-09-09T20:58:59Z","abstract_excerpt":"We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of Matchings (asking for two not necessarily maximum or perfect matchings) is NP-complete on general graphs if $k$ is part of the input, and we consider two restricted variants. First, we show that on bipartite graphs, the problem is polynomial-time solvable, and second we show that Diverse Pair of Maximum Matchings is FPT parameterized by $k$. We round off the "},"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":"2009.04567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-09T20:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"ca0fce1deb42cbdb7b2359c39851bd6c93ae90fa63ee43cbf7ee485fe5c65cdf","abstract_canon_sha256":"d15052c9a1da89f6c6d6b0a61eb7f0917f8a6288866ebedb61b40f13c96d5725"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:27.688871Z","signature_b64":"3ilKflMTEEhC3Z0h4Nr9yCZ6wUW3lCMsiq9y7HuBaO6ZZYPfCGyT7xtb9CrcbGiCzI1o6a9E8fdDvU7CAYZoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f0ba92fd3379521509e4a3c274f74c494f7e61f74d52eaf8f0f139fef125ad7","last_reissued_at":"2026-07-05T01:34:27.688415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:27.688415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diverse Pairs of Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Geevarghese Philip, Lars Jaffke, Petr A. Golovach","submitted_at":"2020-09-09T20:58:59Z","abstract_excerpt":"We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of Matchings (asking for two not necessarily maximum or perfect matchings) is NP-complete on general graphs if $k$ is part of the input, and we consider two restricted variants. First, we show that on bipartite graphs, the problem is polynomial-time solvable, and second we show that Diverse Pair of Maximum Matchings is FPT parameterized by $k$. We round off the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.04567","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/2009.04567/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":"2009.04567","created_at":"2026-07-05T01:34:27.688476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.04567v1","created_at":"2026-07-05T01:34:27.688476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.04567","created_at":"2026-07-05T01:34:27.688476+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4F2SL6TG6KS","created_at":"2026-07-05T01:34:27.688476+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4F2SL6TG6KSCUE6","created_at":"2026-07-05T01:34:27.688476+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4F2SL6T","created_at":"2026-07-05T01:34:27.688476+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/J4F2SL6TG6KSCUE6JI6COT3UYS","json":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS.json","graph_json":"https://pith.science/api/pith-number/J4F2SL6TG6KSCUE6JI6COT3UYS/graph.json","events_json":"https://pith.science/api/pith-number/J4F2SL6TG6KSCUE6JI6COT3UYS/events.json","paper":"https://pith.science/paper/J4F2SL6T"},"agent_actions":{"view_html":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS","download_json":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS.json","view_paper":"https://pith.science/paper/J4F2SL6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.04567&json=true","fetch_graph":"https://pith.science/api/pith-number/J4F2SL6TG6KSCUE6JI6COT3UYS/graph.json","fetch_events":"https://pith.science/api/pith-number/J4F2SL6TG6KSCUE6JI6COT3UYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS/action/storage_attestation","attest_author":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS/action/author_attestation","sign_citation":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS/action/citation_signature","submit_replication":"https://pith.science/pith/J4F2SL6TG6KSCUE6JI6COT3UYS/action/replication_record"}},"created_at":"2026-07-05T01:34:27.688476+00:00","updated_at":"2026-07-05T01:34:27.688476+00:00"}