{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M4LXH7C74J34M7J4WPRKHK3OTC","short_pith_number":"pith:M4LXH7C7","schema_version":"1.0","canonical_sha256":"671773fc5fe277c67d3cb3e2a3ab6e98b387193572832c035924c06e3d2ff093","source":{"kind":"arxiv","id":"1205.4342","version":1},"attestation_state":"computed","paper":{"title":"Asymptotics of the Upper Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Liviu Ilinca","submitted_at":"2012-05-19T16:03:05Z","abstract_excerpt":"We give upper bounds for the number $\\Phi_\\ell(G)$ of matchings of size $\\ell$ in (i) bipartite graphs $G=(X\\cup Y, E)$ with specified degrees $d_x$ ($x\\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular, for $d$-regular, $N$-vertex graphs, our bound is best possible up to an error factor of the form $\\exp[o_d(1)N]$, where $o_d(1) \\rightarrow 0$ as $d \\rightarrow \\infty$. This represents the best progress to date on the \"Upper Matching Conjecture\" of Friedland, Krop, Lundow and Markstr\\\"om. Some further possibilities are also suggested."},"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":"1205.4342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T16:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"9e51ecda7863948be5fa128865ead68d7332c30e612b284ca8a6142495cd2fe2","abstract_canon_sha256":"16d57f39050ace3e9fa14cd49b98dccf4f7a4295fcd3b70eaabd78012a9daa51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:13.406402Z","signature_b64":"uTac2UeJy2Wb6FqIcsGfKyg6uCMShJUYdYvDUSaSxJCqHHr2QcYGM4IOWEHpwKUNCaWT60Scnnb6rkSK5F0/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"671773fc5fe277c67d3cb3e2a3ab6e98b387193572832c035924c06e3d2ff093","last_reissued_at":"2026-05-18T03:55:13.405866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:13.405866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotics of the Upper Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Liviu Ilinca","submitted_at":"2012-05-19T16:03:05Z","abstract_excerpt":"We give upper bounds for the number $\\Phi_\\ell(G)$ of matchings of size $\\ell$ in (i) bipartite graphs $G=(X\\cup Y, E)$ with specified degrees $d_x$ ($x\\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular, for $d$-regular, $N$-vertex graphs, our bound is best possible up to an error factor of the form $\\exp[o_d(1)N]$, where $o_d(1) \\rightarrow 0$ as $d \\rightarrow \\infty$. This represents the best progress to date on the \"Upper Matching Conjecture\" of Friedland, Krop, Lundow and Markstr\\\"om. Some further possibilities are also suggested."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4342","kind":"arxiv","version":1},"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":"1205.4342","created_at":"2026-05-18T03:55:13.405950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4342v1","created_at":"2026-05-18T03:55:13.405950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4342","created_at":"2026-05-18T03:55:13.405950+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4LXH7C74J34","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4LXH7C74J34M7J4","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4LXH7C7","created_at":"2026-05-18T12:27:14.488303+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/M4LXH7C74J34M7J4WPRKHK3OTC","json":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC.json","graph_json":"https://pith.science/api/pith-number/M4LXH7C74J34M7J4WPRKHK3OTC/graph.json","events_json":"https://pith.science/api/pith-number/M4LXH7C74J34M7J4WPRKHK3OTC/events.json","paper":"https://pith.science/paper/M4LXH7C7"},"agent_actions":{"view_html":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC","download_json":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC.json","view_paper":"https://pith.science/paper/M4LXH7C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4342&json=true","fetch_graph":"https://pith.science/api/pith-number/M4LXH7C74J34M7J4WPRKHK3OTC/graph.json","fetch_events":"https://pith.science/api/pith-number/M4LXH7C74J34M7J4WPRKHK3OTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC/action/storage_attestation","attest_author":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC/action/author_attestation","sign_citation":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC/action/citation_signature","submit_replication":"https://pith.science/pith/M4LXH7C74J34M7J4WPRKHK3OTC/action/replication_record"}},"created_at":"2026-05-18T03:55:13.405950+00:00","updated_at":"2026-05-18T03:55:13.405950+00:00"}