{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6N3MXUXSEOM4R6MKCTOLWWZYND","short_pith_number":"pith:6N3MXUXS","schema_version":"1.0","canonical_sha256":"f376cbd2f22399c8f98a14dcbb5b3868cbc6cbb6ca54a0676679a311208f5b9b","source":{"kind":"arxiv","id":"1202.0681","version":2},"attestation_state":"computed","paper":{"title":"On maximum matchings in almost regular graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Petros A. Petrosyan","submitted_at":"2012-02-03T12:39:14Z","abstract_excerpt":"In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\\leq \\delta(G)\\leq \\Delta(G)\\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\\Delta(G)$ and $\\delta(G)$ denote the maximum and minimum degrees of vertices in $G$, respectively. In the same paper they suggested the following conjecture: every graph $G$ with $\\Delta(G)-\\delta(G)\\leq 1$ contains a maximum matching whose unsaturated vertices do not have a common neighbor. Recently, Picouleau disproved this conjecture by constructing a bipartite counterexample $G$ with "},"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":"1202.0681","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-02-03T12:39:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a5e59190325caa132d4aa2e2c11bbca5a1a52665e0b1ec96bb47fdcfec834fd6","abstract_canon_sha256":"410dc20e081a28ebd6df9b2873aa3d3d8e86c051f87b17497544958dcdcaaead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:00.962760Z","signature_b64":"pSqYSwl6W5KFb6hRbH+n2qi81XHtMxbpc6xiiiQJpkfxIlwgR9iKuQg2O4Scp0lrcZ/+IacntglS0fsoFTNmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f376cbd2f22399c8f98a14dcbb5b3868cbc6cbb6ca54a0676679a311208f5b9b","last_reissued_at":"2026-05-18T03:49:00.962117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:00.962117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximum matchings in almost regular graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Petros A. Petrosyan","submitted_at":"2012-02-03T12:39:14Z","abstract_excerpt":"In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\\leq \\delta(G)\\leq \\Delta(G)\\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\\Delta(G)$ and $\\delta(G)$ denote the maximum and minimum degrees of vertices in $G$, respectively. In the same paper they suggested the following conjecture: every graph $G$ with $\\Delta(G)-\\delta(G)\\leq 1$ contains a maximum matching whose unsaturated vertices do not have a common neighbor. Recently, Picouleau disproved this conjecture by constructing a bipartite counterexample $G$ with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0681","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":"1202.0681","created_at":"2026-05-18T03:49:00.962208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0681v2","created_at":"2026-05-18T03:49:00.962208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0681","created_at":"2026-05-18T03:49:00.962208+00:00"},{"alias_kind":"pith_short_12","alias_value":"6N3MXUXSEOM4","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6N3MXUXSEOM4R6MK","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6N3MXUXS","created_at":"2026-05-18T12:26:56.085431+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/6N3MXUXSEOM4R6MKCTOLWWZYND","json":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND.json","graph_json":"https://pith.science/api/pith-number/6N3MXUXSEOM4R6MKCTOLWWZYND/graph.json","events_json":"https://pith.science/api/pith-number/6N3MXUXSEOM4R6MKCTOLWWZYND/events.json","paper":"https://pith.science/paper/6N3MXUXS"},"agent_actions":{"view_html":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND","download_json":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND.json","view_paper":"https://pith.science/paper/6N3MXUXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0681&json=true","fetch_graph":"https://pith.science/api/pith-number/6N3MXUXSEOM4R6MKCTOLWWZYND/graph.json","fetch_events":"https://pith.science/api/pith-number/6N3MXUXSEOM4R6MKCTOLWWZYND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND/action/storage_attestation","attest_author":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND/action/author_attestation","sign_citation":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND/action/citation_signature","submit_replication":"https://pith.science/pith/6N3MXUXSEOM4R6MKCTOLWWZYND/action/replication_record"}},"created_at":"2026-05-18T03:49:00.962208+00:00","updated_at":"2026-05-18T03:49:00.962208+00:00"}