{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J4F2SL6TG6KSCUE6JI6COT3UYS","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":"d15052c9a1da89f6c6d6b0a61eb7f0917f8a6288866ebedb61b40f13c96d5725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-09T20:58:59Z","title_canon_sha256":"ca0fce1deb42cbdb7b2359c39851bd6c93ae90fa63ee43cbf7ee485fe5c65cdf"},"schema_version":"1.0","source":{"id":"2009.04567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.04567","created_at":"2026-07-05T01:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"2009.04567v1","created_at":"2026-07-05T01:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.04567","created_at":"2026-07-05T01:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"J4F2SL6TG6KS","created_at":"2026-07-05T01:34:27Z"},{"alias_kind":"pith_short_16","alias_value":"J4F2SL6TG6KSCUE6","created_at":"2026-07-05T01:34:27Z"},{"alias_kind":"pith_short_8","alias_value":"J4F2SL6T","created_at":"2026-07-05T01:34:27Z"}],"graph_snapshots":[{"event_id":"sha256:82b4f19c01c58cbd651e97eef86d388c5f023d2b771825be14aadd5e5b02d78c","target":"graph","created_at":"2026-07-05T01:34:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.04567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Danil Sagunov, Fedor V. Fomin, Geevarghese Philip, Lars Jaffke, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-09T20:58:59Z","title":"Diverse Pairs of Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.04567","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:a7f9e42b748706bae530032b6613400cd89ed62125e8383004a8109c9b2c4fdb","target":"record","created_at":"2026-07-05T01:34:27Z","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":"d15052c9a1da89f6c6d6b0a61eb7f0917f8a6288866ebedb61b40f13c96d5725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-09T20:58:59Z","title_canon_sha256":"ca0fce1deb42cbdb7b2359c39851bd6c93ae90fa63ee43cbf7ee485fe5c65cdf"},"schema_version":"1.0","source":{"id":"2009.04567","kind":"arxiv","version":1}},"canonical_sha256":"4f0ba92fd3379521509e4a3c274f74c494f7e61f74d52eaf8f0f139fef125ad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f0ba92fd3379521509e4a3c274f74c494f7e61f74d52eaf8f0f139fef125ad7","first_computed_at":"2026-07-05T01:34:27.688415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:34:27.688415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ilKflMTEEhC3Z0h4Nr9yCZ6wUW3lCMsiq9y7HuBaO6ZZYPfCGyT7xtb9CrcbGiCzI1o6a9E8fdDvU7CAYZoAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:34:27.688871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.04567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7f9e42b748706bae530032b6613400cd89ed62125e8383004a8109c9b2c4fdb","sha256:82b4f19c01c58cbd651e97eef86d388c5f023d2b771825be14aadd5e5b02d78c"],"state_sha256":"cec3eb1d47fc8744b7c80485a6153f639c8fc9997119ddfe213859c2d7d4ace5"}