{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SV4VEU2C57OEVHWFKZO2LZ32EC","short_pith_number":"pith:SV4VEU2C","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"},"canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","source":{"kind":"arxiv","id":"1407.5409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5409","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5409v2","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5409","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"SV4VEU2C57OE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SV4VEU2C57OEVHWF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SV4VEU2C","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SV4VEU2C57OEVHWFKZO2LZ32EC","target":"record","payload":{"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"},"canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","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"},"source_kind":"arxiv","source_id":"1407.5409","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-18T02:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBhbOKzF/nR9X2kW1JwJnfHS5ffKGI0yr0WjO+kL1pA1bXFUrqHs8wXecHplhQJ8S+7P34503Khk5olMm+POCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:11:19.415534Z"},"content_sha256":"f53d0acb5265683268fb48ee6d6764f78f581b50ea6e0e19c407eb79f8ab706d","schema_version":"1.0","event_id":"sha256:f53d0acb5265683268fb48ee6d6764f78f581b50ea6e0e19c407eb79f8ab706d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SV4VEU2C57OEVHWFKZO2LZ32EC","target":"graph","payload":{"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"},"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-18T02:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nCPtvmyPl+aTU8voktvj6+5HJT8kOH3tfOT4i7wlow5zk5RJQzIG280M4PjFTg68guj5HfJo9lNmZjRfX5syAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:11:19.415894Z"},"content_sha256":"411ec881ffbb9d03d52c2cdd2b85226ddccb3af2b928dabb361de3f29556a14e","schema_version":"1.0","event_id":"sha256:411ec881ffbb9d03d52c2cdd2b85226ddccb3af2b928dabb361de3f29556a14e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/bundle.json","state_url":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/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-06-02T07:11:19Z","links":{"resolver":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC","bundle":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/bundle.json","state":"https://pith.science/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SV4VEU2C57OEVHWFKZO2LZ32EC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SV4VEU2C57OEVHWFKZO2LZ32EC","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":"53b3b9cfbeabcddcd04081e1ca16fb5d5ac488e638c4b95ace0f25e8abbb0020","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-21T08:15:17Z","title_canon_sha256":"4687de00c88b650086de97b830ae35644c7bc791b4619ba253b3c2714b5b2d38"},"schema_version":"1.0","source":{"id":"1407.5409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5409","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5409v2","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5409","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"SV4VEU2C57OE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SV4VEU2C57OEVHWF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SV4VEU2C","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:411ec881ffbb9d03d52c2cdd2b85226ddccb3af2b928dabb361de3f29556a14e","target":"graph","created_at":"2026-05-18T02:46:24Z","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 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","authors_text":"P\\'eter Csikv\\'ari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-21T08:15:17Z","title":"Matchings in vertex-transitive bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5409","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:f53d0acb5265683268fb48ee6d6764f78f581b50ea6e0e19c407eb79f8ab706d","target":"record","created_at":"2026-05-18T02:46:24Z","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":"53b3b9cfbeabcddcd04081e1ca16fb5d5ac488e638c4b95ace0f25e8abbb0020","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-21T08:15:17Z","title_canon_sha256":"4687de00c88b650086de97b830ae35644c7bc791b4619ba253b3c2714b5b2d38"},"schema_version":"1.0","source":{"id":"1407.5409","kind":"arxiv","version":2}},"canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9579525342efdc4a9ec5565da5e77a20b1128bf6cd63ce768009545d32384014","first_computed_at":"2026-05-18T02:46:24.042150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:24.042150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wgGVRxHeFSwNxvbRU2J2TTZbCmBUCWHw4LVw40p9VHH5ezc5DAquyLrrL7BHrCRT8L3Z5ryOubfjNYWd0MkADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:24.042596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f53d0acb5265683268fb48ee6d6764f78f581b50ea6e0e19c407eb79f8ab706d","sha256:411ec881ffbb9d03d52c2cdd2b85226ddccb3af2b928dabb361de3f29556a14e"],"state_sha256":"ac5303f4e77e34f93a6bf56a100eab5ec7c62663cbe7d6f3609b1f5957cb84ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThpdXRHjcP2Pr9DetLLLjVDjHC3Vv1q5eZgu9ZEXnVP5yFJLP8jLJi3yyZunu+w3N/F0OCzGvr44iG7yHPHEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:11:19.417853Z","bundle_sha256":"74b16a41a3387734a8432e7ce49d9a5526f45876777ef2794486c981cf205093"}}