{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2FHH5LDIEZHLTQFJYFRIK4PM66","short_pith_number":"pith:2FHH5LDI","schema_version":"1.0","canonical_sha256":"d14e7eac68264eb9c0a9c1628571ecf79ab88c16117a835f5eb7c2b4203fa43a","source":{"kind":"arxiv","id":"2209.13063","version":3},"attestation_state":"computed","paper":{"title":"Quantum-Inspired Perfect Matching under Vertex-Color Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math-ph","math.CO","math.MP","quant-ph"],"primary_cat":"cs.CC","authors_text":"Moshe Y. Vardi, Zhiwei Zhang","submitted_at":"2022-09-26T22:55:25Z","abstract_excerpt":"We propose and study the graph-theoretical problem EXISTS-PMVC: the existence of perfect matching under vertex-color constraints on graphs with bi-colored edges. EXISTS-PMVC is of special interest because of its motivation from quantum-state identification and quantum-experiment design, as well as its rich expressiveness, i.e., EXISTS-PMVC naturally subsumes important constrained matching problems, such as exact perfect matching. We give complexity and algorithmic results for EXISTS-PMVC under two types of vertex color constraints: (1) decision-diagram constraints (EXISTS-PMVC-DD) and (2) symm"},"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":"2209.13063","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-09-26T22:55:25Z","cross_cats_sorted":["cs.DS","math-ph","math.CO","math.MP","quant-ph"],"title_canon_sha256":"38cf605484397691aa5fd5d6ed9665a3d29b282b482c93f6bd2472a700a66de5","abstract_canon_sha256":"d7dfcef25978e41bc7121a9e6521b11e48fdf0ef630977a75256f2b821983cb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:29.411208Z","signature_b64":"RQhtrwlcmPld+1eCMRSBOls5SKZ3XJAKX/q2Sg13YfRfCkUk9bBpDI1GUxjAHiB7gxglfcVYq8WL+XhptTIbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d14e7eac68264eb9c0a9c1628571ecf79ab88c16117a835f5eb7c2b4203fa43a","last_reissued_at":"2026-07-05T06:05:29.410778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:29.410778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Inspired Perfect Matching under Vertex-Color Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math-ph","math.CO","math.MP","quant-ph"],"primary_cat":"cs.CC","authors_text":"Moshe Y. Vardi, Zhiwei Zhang","submitted_at":"2022-09-26T22:55:25Z","abstract_excerpt":"We propose and study the graph-theoretical problem EXISTS-PMVC: the existence of perfect matching under vertex-color constraints on graphs with bi-colored edges. EXISTS-PMVC is of special interest because of its motivation from quantum-state identification and quantum-experiment design, as well as its rich expressiveness, i.e., EXISTS-PMVC naturally subsumes important constrained matching problems, such as exact perfect matching. We give complexity and algorithmic results for EXISTS-PMVC under two types of vertex color constraints: (1) decision-diagram constraints (EXISTS-PMVC-DD) and (2) symm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13063","kind":"arxiv","version":3},"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/2209.13063/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":"2209.13063","created_at":"2026-07-05T06:05:29.410833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13063v3","created_at":"2026-07-05T06:05:29.410833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13063","created_at":"2026-07-05T06:05:29.410833+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FHH5LDIEZHL","created_at":"2026-07-05T06:05:29.410833+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FHH5LDIEZHLTQFJ","created_at":"2026-07-05T06:05:29.410833+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FHH5LDI","created_at":"2026-07-05T06:05:29.410833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04855","citing_title":"W-state graphs: Structure and Algorithms","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66","json":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66.json","graph_json":"https://pith.science/api/pith-number/2FHH5LDIEZHLTQFJYFRIK4PM66/graph.json","events_json":"https://pith.science/api/pith-number/2FHH5LDIEZHLTQFJYFRIK4PM66/events.json","paper":"https://pith.science/paper/2FHH5LDI"},"agent_actions":{"view_html":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66","download_json":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66.json","view_paper":"https://pith.science/paper/2FHH5LDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13063&json=true","fetch_graph":"https://pith.science/api/pith-number/2FHH5LDIEZHLTQFJYFRIK4PM66/graph.json","fetch_events":"https://pith.science/api/pith-number/2FHH5LDIEZHLTQFJYFRIK4PM66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66/action/storage_attestation","attest_author":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66/action/author_attestation","sign_citation":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66/action/citation_signature","submit_replication":"https://pith.science/pith/2FHH5LDIEZHLTQFJYFRIK4PM66/action/replication_record"}},"created_at":"2026-07-05T06:05:29.410833+00:00","updated_at":"2026-07-05T06:05:29.410833+00:00"}