{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SV4VEU2C57OEVHWFKZO2LZ32EC","short_pith_number":"pith:SV4VEU2C","schema_version":"1.0","canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","source":{"kind":"arxiv","id":"1407.5409","version":2},"attestation_state":"computed","paper":{"title":"Matchings in vertex-transitive bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari","submitted_at":"2014-07-21T08:15:17Z","abstract_excerpt":"A theorem of A. Schrijver asserts that a $d$-regular bipartite graph on $2n$ vertices has at least $$\\left(\\frac{(d-1)^{d-1}}{d^{d-2}}\\right)^n$$ perfect matchings. L. Gurvits gave an extension of Schrijver's theorem for matchings of density $p$. In this paper we give a stronger version of Gurvits's theorem in the case of vertex-transitive bipartite graphs. This stronger version in particular implies that for every positive integer $k$, there exists a positive constant $c(k)$ such that if a $d$-regular vertex-transitive bipartite graph on $2n$ vertices contains a cycle of length at most $k$, t"},"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":"1407.5409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-21T08:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"4687de00c88b650086de97b830ae35644c7bc791b4619ba253b3c2714b5b2d38","abstract_canon_sha256":"53b3b9cfbeabcddcd04081e1ca16fb5d5ac488e638c4b95ace0f25e8abbb0020"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:24.042596Z","signature_b64":"wgGVRxHeFSwNxvbRU2J2TTZbCmBUCWHw4LVw40p9VHH5ezc5DAquyLrrL7BHrCRT8L3Z5ryOubfjNYWd0MkADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","last_reissued_at":"2026-05-18T02:46:24.042150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:24.042150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matchings in vertex-transitive bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari","submitted_at":"2014-07-21T08:15:17Z","abstract_excerpt":"A theorem of A. Schrijver asserts that a $d$-regular bipartite graph on $2n$ vertices has at least $$\\left(\\frac{(d-1)^{d-1}}{d^{d-2}}\\right)^n$$ perfect matchings. L. Gurvits gave an extension of Schrijver's theorem for matchings of density $p$. In this paper we give a stronger version of Gurvits's theorem in the case of vertex-transitive bipartite graphs. This stronger version in particular implies that for every positive integer $k$, there exists a positive constant $c(k)$ such that if a $d$-regular vertex-transitive bipartite graph on $2n$ vertices contains a cycle of length at most $k$, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5409","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":"1407.5409","created_at":"2026-05-18T02:46:24.042216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5409v2","created_at":"2026-05-18T02:46:24.042216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5409","created_at":"2026-05-18T02:46:24.042216+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV4VEU2C57OE","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV4VEU2C57OEVHWF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV4VEU2C","created_at":"2026-05-18T12:28:49.207871+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/SV4VEU2C57OEVHWFKZO2LZ32EC","json":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC.json","graph_json":"https://pith.science/api/pith-number/SV4VEU2C57OEVHWFKZO2LZ32EC/graph.json","events_json":"https://pith.science/api/pith-number/SV4VEU2C57OEVHWFKZO2LZ32EC/events.json","paper":"https://pith.science/paper/SV4VEU2C"},"agent_actions":{"view_html":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC","download_json":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC.json","view_paper":"https://pith.science/paper/SV4VEU2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5409&json=true","fetch_graph":"https://pith.science/api/pith-number/SV4VEU2C57OEVHWFKZO2LZ32EC/graph.json","fetch_events":"https://pith.science/api/pith-number/SV4VEU2C57OEVHWFKZO2LZ32EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/action/storage_attestation","attest_author":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/action/author_attestation","sign_citation":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/action/citation_signature","submit_replication":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/action/replication_record"}},"created_at":"2026-05-18T02:46:24.042216+00:00","updated_at":"2026-05-18T02:46:24.042216+00:00"}