{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CVMAHSKO2J5NWVOIG3FZV6QKWX","short_pith_number":"pith:CVMAHSKO","schema_version":"1.0","canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","source":{"kind":"arxiv","id":"1703.05412","version":2},"attestation_state":"computed","paper":{"title":"On Perfect Matchings in Matching Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dong Ye, Erling Wei, Jinghua He, Shaohui Zhai","submitted_at":"2017-03-15T22:48:46Z","abstract_excerpt":"Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2$ such that $|M_1\\cap X|\\not\\equiv |M_2\\cap X| \\pmod 2$. Lukot'ka and Rollov\\'a proved that an edge subset $X$ of a regular bipartite graph is not feasible if and only if $X$ is switching-equivalent to $\\emptyset$, and they further ask whether a non-feasible set of a regular graph of class 1 is always switching-equivalent to either $\\emptyset$ or $E(G)$? Two edges of $G$ are equivalent to each other if a perfect matc"},"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":"1703.05412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-15T22:48:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"347c29e96836597c9a7e35842a997550a5200b7fc0bd7d87e99d1f0dbabd36f1","abstract_canon_sha256":"416f9b2dfa66e2490782bfa969a98b7e67cf184ee50875731c7849c71cc9ec54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.195495Z","signature_b64":"HjeaXZvJOXknrl2zPltz1wONHkPlELfFKFsA7PmDwEb5ukawKKRXfbcKh5V4VExHQd9WB6l73ZJXrDsEESmmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","last_reissued_at":"2026-05-18T00:48:32.194874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.194874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Perfect Matchings in Matching Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dong Ye, Erling Wei, Jinghua He, Shaohui Zhai","submitted_at":"2017-03-15T22:48:46Z","abstract_excerpt":"Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2$ such that $|M_1\\cap X|\\not\\equiv |M_2\\cap X| \\pmod 2$. Lukot'ka and Rollov\\'a proved that an edge subset $X$ of a regular bipartite graph is not feasible if and only if $X$ is switching-equivalent to $\\emptyset$, and they further ask whether a non-feasible set of a regular graph of class 1 is always switching-equivalent to either $\\emptyset$ or $E(G)$? Two edges of $G$ are equivalent to each other if a perfect matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05412","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1703.05412","created_at":"2026-05-18T00:48:32.194986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05412v2","created_at":"2026-05-18T00:48:32.194986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05412","created_at":"2026-05-18T00:48:32.194986+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVMAHSKO2J5N","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVMAHSKO2J5NWVOI","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVMAHSKO","created_at":"2026-05-18T12:31:10.602751+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/CVMAHSKO2J5NWVOIG3FZV6QKWX","json":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX.json","graph_json":"https://pith.science/api/pith-number/CVMAHSKO2J5NWVOIG3FZV6QKWX/graph.json","events_json":"https://pith.science/api/pith-number/CVMAHSKO2J5NWVOIG3FZV6QKWX/events.json","paper":"https://pith.science/paper/CVMAHSKO"},"agent_actions":{"view_html":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX","download_json":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX.json","view_paper":"https://pith.science/paper/CVMAHSKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05412&json=true","fetch_graph":"https://pith.science/api/pith-number/CVMAHSKO2J5NWVOIG3FZV6QKWX/graph.json","fetch_events":"https://pith.science/api/pith-number/CVMAHSKO2J5NWVOIG3FZV6QKWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/action/storage_attestation","attest_author":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/action/author_attestation","sign_citation":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/action/citation_signature","submit_replication":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/action/replication_record"}},"created_at":"2026-05-18T00:48:32.194986+00:00","updated_at":"2026-05-18T00:48:32.194986+00:00"}