{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UZCA753UPXOR5HEKJE4SHAJABE","short_pith_number":"pith:UZCA753U","schema_version":"1.0","canonical_sha256":"a6440ff7747ddd1e9c8a49392381200938512046f6bc22ea4a56544df9056d32","source":{"kind":"arxiv","id":"2203.13899","version":4},"attestation_state":"computed","paper":{"title":"Exact Matching: Algorithms and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicolas El Maalouly","submitted_at":"2022-03-25T20:34:08Z","abstract_excerpt":"In 1982, Papadimitriou and Yannakakis introduced the Exact Matching (EM) problem where given an edge colored graph, with colors red and blue, and an integer $k$, the goal is to decide whether or not the graph contains a perfect matching with exactly $k$ red edges. Although they conjectured it to be $\\textbf{NP}$-complete, soon after it was shown to be solvable in randomized polynomial time in the seminal work of Mulmuley et al., placing it in the complexity class $\\textbf{RP}$. Since then, all attempts at finding a deterministic algorithm for EM have failed, thus leaving it as one of the few n"},"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":"2203.13899","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-25T20:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"eb9538547745ff1137e3eadef716b8de075cb2f4a6992aa9e458b4cbac14776b","abstract_canon_sha256":"c6451d6cdc6e4374e5566bdf8c6bb3c7fdeb558ce13908660ce3a741fa425bea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:44.238769Z","signature_b64":"uHZ5p4l46A7jVfSy/4bdLQW9nNFDmf3h2ULPsuxWraIT+TSrceEXUrKpmHWqECWcu6uIxJhIuc3St+CmTVYjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6440ff7747ddd1e9c8a49392381200938512046f6bc22ea4a56544df9056d32","last_reissued_at":"2026-07-05T05:28:44.238335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:44.238335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Matching: Algorithms and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicolas El Maalouly","submitted_at":"2022-03-25T20:34:08Z","abstract_excerpt":"In 1982, Papadimitriou and Yannakakis introduced the Exact Matching (EM) problem where given an edge colored graph, with colors red and blue, and an integer $k$, the goal is to decide whether or not the graph contains a perfect matching with exactly $k$ red edges. Although they conjectured it to be $\\textbf{NP}$-complete, soon after it was shown to be solvable in randomized polynomial time in the seminal work of Mulmuley et al., placing it in the complexity class $\\textbf{RP}$. Since then, all attempts at finding a deterministic algorithm for EM have failed, thus leaving it as one of the few n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.13899","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.13899/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":"2203.13899","created_at":"2026-07-05T05:28:44.238389+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.13899v4","created_at":"2026-07-05T05:28:44.238389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13899","created_at":"2026-07-05T05:28:44.238389+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZCA753UPXOR","created_at":"2026-07-05T05:28:44.238389+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZCA753UPXOR5HEK","created_at":"2026-07-05T05:28:44.238389+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZCA753U","created_at":"2026-07-05T05:28:44.238389+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/UZCA753UPXOR5HEKJE4SHAJABE","json":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE.json","graph_json":"https://pith.science/api/pith-number/UZCA753UPXOR5HEKJE4SHAJABE/graph.json","events_json":"https://pith.science/api/pith-number/UZCA753UPXOR5HEKJE4SHAJABE/events.json","paper":"https://pith.science/paper/UZCA753U"},"agent_actions":{"view_html":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE","download_json":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE.json","view_paper":"https://pith.science/paper/UZCA753U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.13899&json=true","fetch_graph":"https://pith.science/api/pith-number/UZCA753UPXOR5HEKJE4SHAJABE/graph.json","fetch_events":"https://pith.science/api/pith-number/UZCA753UPXOR5HEKJE4SHAJABE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE/action/storage_attestation","attest_author":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE/action/author_attestation","sign_citation":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE/action/citation_signature","submit_replication":"https://pith.science/pith/UZCA753UPXOR5HEKJE4SHAJABE/action/replication_record"}},"created_at":"2026-07-05T05:28:44.238389+00:00","updated_at":"2026-07-05T05:28:44.238389+00:00"}