{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CVMAHSKO2J5NWVOIG3FZV6QKWX","short_pith_number":"pith:CVMAHSKO","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"},"canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","source":{"kind":"arxiv","id":"1703.05412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05412","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05412v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05412","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"CVMAHSKO2J5N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CVMAHSKO2J5NWVOI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CVMAHSKO","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CVMAHSKO2J5NWVOIG3FZV6QKWX","target":"record","payload":{"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"},"canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","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"},"source_kind":"arxiv","source_id":"1703.05412","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9ezzwvCQ63f+bEHQF9VQ2x8jhO9ku+mMwQ50BcxR8O7holDRdUjzK9rgu1k+sax673ZaSGO1aSOi8pHHBNmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:48:20.367794Z"},"content_sha256":"2e2d62a28b097aa3a7f81f5b1934676f31cb053b0b238375f1b5ba8f8f6fd59d","schema_version":"1.0","event_id":"sha256:2e2d62a28b097aa3a7f81f5b1934676f31cb053b0b238375f1b5ba8f8f6fd59d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CVMAHSKO2J5NWVOIG3FZV6QKWX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+6B9fTeenZJCstCqT4t4UijHXb+IgQaRXMNyDBqOCtEqUj11Mv3hMyMYkOfUoMyj6MAwdW0/+EUZjNSa/lPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:48:20.368147Z"},"content_sha256":"584af03b403e1e123b81e01d6dc4cf80bde22053a392f3a232597d08bc049695","schema_version":"1.0","event_id":"sha256:584af03b403e1e123b81e01d6dc4cf80bde22053a392f3a232597d08bc049695"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/bundle.json","state_url":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T16:48:20Z","links":{"resolver":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX","bundle":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/bundle.json","state":"https://pith.science/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVMAHSKO2J5NWVOIG3FZV6QKWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CVMAHSKO2J5NWVOIG3FZV6QKWX","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":"416f9b2dfa66e2490782bfa969a98b7e67cf184ee50875731c7849c71cc9ec54","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-15T22:48:46Z","title_canon_sha256":"347c29e96836597c9a7e35842a997550a5200b7fc0bd7d87e99d1f0dbabd36f1"},"schema_version":"1.0","source":{"id":"1703.05412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05412","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05412v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05412","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"CVMAHSKO2J5N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CVMAHSKO2J5NWVOI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CVMAHSKO","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:584af03b403e1e123b81e01d6dc4cf80bde22053a392f3a232597d08bc049695","target":"graph","created_at":"2026-05-18T00:48:32Z","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"},"paper":{"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","authors_text":"Dong Ye, Erling Wei, Jinghua He, Shaohui Zhai","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-15T22:48:46Z","title":"On Perfect Matchings in Matching Covered Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05412","kind":"arxiv","version":2},"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:2e2d62a28b097aa3a7f81f5b1934676f31cb053b0b238375f1b5ba8f8f6fd59d","target":"record","created_at":"2026-05-18T00:48:32Z","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":"416f9b2dfa66e2490782bfa969a98b7e67cf184ee50875731c7849c71cc9ec54","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-15T22:48:46Z","title_canon_sha256":"347c29e96836597c9a7e35842a997550a5200b7fc0bd7d87e99d1f0dbabd36f1"},"schema_version":"1.0","source":{"id":"1703.05412","kind":"arxiv","version":2}},"canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"155803c94ed27adb55c836cb9afa0ab5ea8abbd9a8329e4454097982e91a4aa3","first_computed_at":"2026-05-18T00:48:32.194874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:32.194874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HjeaXZvJOXknrl2zPltz1wONHkPlELfFKFsA7PmDwEb5ukawKKRXfbcKh5V4VExHQd9WB6l73ZJXrDsEESmmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:32.195495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2d62a28b097aa3a7f81f5b1934676f31cb053b0b238375f1b5ba8f8f6fd59d","sha256:584af03b403e1e123b81e01d6dc4cf80bde22053a392f3a232597d08bc049695"],"state_sha256":"846b3139e0b17440692ad7ec79f4b32c22140b2776a59a2476391eeb3a58a810"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T23opImFmq1ulhJFh7tDsHpnCMqeprHdMHmVLuT+W/3byztEjGQSYGtfXtdTYTgERwlcCMFP6sVozqbfL+qfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:48:20.370164Z","bundle_sha256":"21905c666dab5aa841334c79c33c5785442d12b320a62b122f87fa552b6d1401"}}