{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QMZCETQAMQPLLI5LPBXYRQGSYE","short_pith_number":"pith:QMZCETQA","schema_version":"1.0","canonical_sha256":"8332224e00641eb5a3ab786f88c0d2c11baa441f3ddd6ee1627f518a15feae75","source":{"kind":"arxiv","id":"1807.07339","version":2},"attestation_state":"computed","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)$"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.07339","created_at":"2026-05-17T23:42:14.038826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07339v2","created_at":"2026-05-17T23:42:14.038826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07339","created_at":"2026-05-17T23:42:14.038826+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMZCETQAMQPL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMZCETQAMQPLLI5L","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMZCETQA","created_at":"2026-05-18T12:32:46.962924+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/QMZCETQAMQPLLI5LPBXYRQGSYE","json":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE.json","graph_json":"https://pith.science/api/pith-number/QMZCETQAMQPLLI5LPBXYRQGSYE/graph.json","events_json":"https://pith.science/api/pith-number/QMZCETQAMQPLLI5LPBXYRQGSYE/events.json","paper":"https://pith.science/paper/QMZCETQA"},"agent_actions":{"view_html":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE","download_json":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE.json","view_paper":"https://pith.science/paper/QMZCETQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07339&json=true","fetch_graph":"https://pith.science/api/pith-number/QMZCETQAMQPLLI5LPBXYRQGSYE/graph.json","fetch_events":"https://pith.science/api/pith-number/QMZCETQAMQPLLI5LPBXYRQGSYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/action/storage_attestation","attest_author":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/action/author_attestation","sign_citation":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/action/citation_signature","submit_replication":"https://pith.science/pith/QMZCETQAMQPLLI5LPBXYRQGSYE/action/replication_record"}},"created_at":"2026-05-17T23:42:14.038826+00:00","updated_at":"2026-05-17T23:42:14.038826+00:00"}