{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QMZCETQAMQPLLI5LPBXYRQGSYE","short_pith_number":"pith:QMZCETQA","canonical_record":{"source":{"id":"1807.07339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T10:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"2ee37b0a8324afafd161980cc2c591fe95642900c87ceb9e2311cef34c39fa6c","abstract_canon_sha256":"d65faec7b0d9ac480dc2bb76cca54cb3ea5e0b7d22173eac2005a66145460b20"},"schema_version":"1.0"},"canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","source":{"kind":"arxiv","id":"1807.07339","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07339","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07339v2","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07339","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"QMZCETQAMQPL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMZCETQAMQPLLI5L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMZCETQA","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QMZCETQAMQPLLI5LPBXYRQGSYE","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T10:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"2ee37b0a8324afafd161980cc2c591fe95642900c87ceb9e2311cef34c39fa6c","abstract_canon_sha256":"d65faec7b0d9ac480dc2bb76cca54cb3ea5e0b7d22173eac2005a66145460b20"},"schema_version":"1.0"},"canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:14.039245Z","signature_b64":"IKjMZ1rocQFZLuA4c9ZBQx9jBhxCBWqps1q/DJbHKzwuIatMkVvewHXmZI3KKsHgvc+sloSjDlmOS42tvm9wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","last_reissued_at":"2026-05-17T23:42:14.038729Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:14.038729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07339","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-17T23:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDKqGoCUw7y8g9KRFAiBT9k89fFs5btKgw/tNvG8AG3X8lCXD0rR6OZNcyxiVzQ7itbO5Ar7khg2z0pWamJJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:29.622023Z"},"content_sha256":"036960c1443017d47c2a8c4aa23d5558d01ba9eab23b87141977fb5da928466c","schema_version":"1.0","event_id":"sha256:036960c1443017d47c2a8c4aa23d5558d01ba9eab23b87141977fb5da928466c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QMZCETQAMQPLLI5LPBXYRQGSYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Birkhoff-von Neumann Graphs that are PM-compact","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcelo H. de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin","submitted_at":"2018-07-19T10:50:16Z","abstract_excerpt":"A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a connected graph (of order at least two) and each edge lies in some perfect matching.\n  A graph $G$ is Birkhoff-von Neumann (BvN) if its perfect matching polytope is characterized solely by non-negativity and degree constraints. A result of Balas (1981) implies that $G$ is BvN if and only if $G$ does not contain a pair of vertex-disjoint odd cycles $(C_1,C_2)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07339","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-17T23:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJOuEQRGm6TIKvDEK1S195vXybf/PN0eW9BgpZPVOh9Yu1KbOHP6Ma+Z0UTbbjvEKvje7J/dTKZ7fYgUNJxcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:29.622379Z"},"content_sha256":"38eee52a42de3d29cb9f3f3c134edc664b87c1811cb6592d1926db5ef1ae3b5b","schema_version":"1.0","event_id":"sha256:38eee52a42de3d29cb9f3f3c134edc664b87c1811cb6592d1926db5ef1ae3b5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/bundle.json","state_url":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/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-05-31T05:38:29Z","links":{"resolver":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE","bundle":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/bundle.json","state":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QMZCETQAMQPLLI5LPBXYRQGSYE","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":"d65faec7b0d9ac480dc2bb76cca54cb3ea5e0b7d22173eac2005a66145460b20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T10:50:16Z","title_canon_sha256":"2ee37b0a8324afafd161980cc2c591fe95642900c87ceb9e2311cef34c39fa6c"},"schema_version":"1.0","source":{"id":"1807.07339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07339","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07339v2","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07339","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"QMZCETQAMQPL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMZCETQAMQPLLI5L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMZCETQA","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:38eee52a42de3d29cb9f3f3c134edc664b87c1811cb6592d1926db5ef1ae3b5b","target":"graph","created_at":"2026-05-17T23:42:14Z","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":"A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a connected graph (of order at least two) and each edge lies in some perfect matching.\n  A graph $G$ is Birkhoff-von Neumann (BvN) if its perfect matching polytope is characterized solely by non-negativity and degree constraints. A result of Balas (1981) implies that $G$ is BvN if and only if $G$ does not contain a pair of vertex-disjoint odd cycles $(C_1,C_2)$","authors_text":"Marcelo H. de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T10:50:16Z","title":"Birkhoff-von Neumann Graphs that are PM-compact"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07339","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:036960c1443017d47c2a8c4aa23d5558d01ba9eab23b87141977fb5da928466c","target":"record","created_at":"2026-05-17T23:42:14Z","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":"d65faec7b0d9ac480dc2bb76cca54cb3ea5e0b7d22173eac2005a66145460b20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T10:50:16Z","title_canon_sha256":"2ee37b0a8324afafd161980cc2c591fe95642900c87ceb9e2311cef34c39fa6c"},"schema_version":"1.0","source":{"id":"1807.07339","kind":"arxiv","version":2}},"canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","first_computed_at":"2026-05-17T23:42:14.038729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:14.038729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKjMZ1rocQFZLuA4c9ZBQx9jBhxCBWqps1q/DJbHKzwuIatMkVvewHXmZI3KKsHgvc+sloSjDlmOS42tvm9wAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:14.039245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:036960c1443017d47c2a8c4aa23d5558d01ba9eab23b87141977fb5da928466c","sha256:38eee52a42de3d29cb9f3f3c134edc664b87c1811cb6592d1926db5ef1ae3b5b"],"state_sha256":"74842bc68c2db5526093f90eaa6671889a0bfdd3a1a4d26984184d3353bee70b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDLbgvKVhy0iXrMx29CjfwyFJffrMSW7CX3XyvYFVZsHz7Qq0bWkCZPso2y9F284MbTm9tTRQOzjdCXxaSC+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:38:29.624259Z","bundle_sha256":"2d65ffcddcbfba7c83106013a918bfa4a9e91d6d13aa642a782fa438796a031e"}}