{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ECMCVQO63YWENYXW6D34J4X7K4","short_pith_number":"pith:ECMCVQO6","canonical_record":{"source":{"id":"1903.12207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","cross_cats_sorted":[],"title_canon_sha256":"f3bb9083ddfb7ecb2c1b7633500a20e5bc8e708458c2931207ae32a9c66aafe4","abstract_canon_sha256":"e1a6b8f9af6eb649d21aba851130c408d2770a76a3781cd1d9c347ae868eb1fd"},"schema_version":"1.0"},"canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","source":{"kind":"arxiv","id":"1903.12207","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12207","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12207v2","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12207","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"ECMCVQO63YWE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ECMCVQO63YWENYXW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ECMCVQO6","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ECMCVQO63YWENYXW6D34J4X7K4","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","cross_cats_sorted":[],"title_canon_sha256":"f3bb9083ddfb7ecb2c1b7633500a20e5bc8e708458c2931207ae32a9c66aafe4","abstract_canon_sha256":"e1a6b8f9af6eb649d21aba851130c408d2770a76a3781cd1d9c347ae868eb1fd"},"schema_version":"1.0"},"canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.654013Z","signature_b64":"8j3cokQMlnoKiMGrqGOjYLgm3eNWrqqQ5rUUwQOnxxOdPC1Dc82lHzMEtSIWUgb5KtcU1RvUKjWPiyyJ6LZmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","last_reissued_at":"2026-05-17T23:49:08.653475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.653475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12207","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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzXucFbcYbcTEjgeBh6VrPoFOuvUot2tXutj58UChSNYmzSG7rQq8/njND20jTouFf2X8jDfIuqlae/eQz1hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:08:27.405681Z"},"content_sha256":"8947adcc8db4bd8541d92af9f4fe880e0ea5d31b71d584548eb99e8fb9ef7d19","schema_version":"1.0","event_id":"sha256:8947adcc8db4bd8541d92af9f4fe880e0ea5d31b71d584548eb99e8fb9ef7d19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ECMCVQO63YWENYXW6D34J4X7K4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Vishesh Jain","submitted_at":"2019-03-28T18:17:03Z","abstract_excerpt":"In this note, we prove that there exists a universal constant $c=\\frac{43}{50}$ such that for every $k\\in \\mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least $(c+o_n(1))\\binom{n-d}{k-d}$ contains a perfect matching. This is the first such bound which is independent of $k$, and therefore, improves all previously known bounds when $k$ is large. Our approach is based on combining the seminal work of Alon et al. with known bounds on a conjectured probabilistic inequality due to Feige."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12207","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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+7tfqdYMW5Wxua1ppQ4h+5BsleNNlf6YiF2K9VeukQceKSPtG1WydWxm8wQQlVd7u9jaHFgL7UGXBhC2+ocBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:08:27.406458Z"},"content_sha256":"eb48bc2374f4f03119f5f92f7a75118c895d25d5453807531fec731ca996220b","schema_version":"1.0","event_id":"sha256:eb48bc2374f4f03119f5f92f7a75118c895d25d5453807531fec731ca996220b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/bundle.json","state_url":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECMCVQO63YWENYXW6D34J4X7K4/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-08-04T00:08:27Z","links":{"resolver":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4","bundle":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/bundle.json","state":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECMCVQO63YWENYXW6D34J4X7K4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ECMCVQO63YWENYXW6D34J4X7K4","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":"e1a6b8f9af6eb649d21aba851130c408d2770a76a3781cd1d9c347ae868eb1fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","title_canon_sha256":"f3bb9083ddfb7ecb2c1b7633500a20e5bc8e708458c2931207ae32a9c66aafe4"},"schema_version":"1.0","source":{"id":"1903.12207","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12207","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12207v2","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12207","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"ECMCVQO63YWE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ECMCVQO63YWENYXW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ECMCVQO6","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:eb48bc2374f4f03119f5f92f7a75118c895d25d5453807531fec731ca996220b","target":"graph","created_at":"2026-05-17T23:49:08Z","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":"In this note, we prove that there exists a universal constant $c=\\frac{43}{50}$ such that for every $k\\in \\mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least $(c+o_n(1))\\binom{n-d}{k-d}$ contains a perfect matching. This is the first such bound which is independent of $k$, and therefore, improves all previously known bounds when $k$ is large. Our approach is based on combining the seminal work of Alon et al. with known bounds on a conjectured probabilistic inequality due to Feige.","authors_text":"Asaf Ferber, Vishesh Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","title":"Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12207","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:8947adcc8db4bd8541d92af9f4fe880e0ea5d31b71d584548eb99e8fb9ef7d19","target":"record","created_at":"2026-05-17T23:49:08Z","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":"e1a6b8f9af6eb649d21aba851130c408d2770a76a3781cd1d9c347ae868eb1fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","title_canon_sha256":"f3bb9083ddfb7ecb2c1b7633500a20e5bc8e708458c2931207ae32a9c66aafe4"},"schema_version":"1.0","source":{"id":"1903.12207","kind":"arxiv","version":2}},"canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","first_computed_at":"2026-05-17T23:49:08.653475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.653475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8j3cokQMlnoKiMGrqGOjYLgm3eNWrqqQ5rUUwQOnxxOdPC1Dc82lHzMEtSIWUgb5KtcU1RvUKjWPiyyJ6LZmBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.654013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12207","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8947adcc8db4bd8541d92af9f4fe880e0ea5d31b71d584548eb99e8fb9ef7d19","sha256:eb48bc2374f4f03119f5f92f7a75118c895d25d5453807531fec731ca996220b"],"state_sha256":"dfd9704b41eca8e9ddeb23800384d1bf7bf4ae93354f4576fa11d31cf3497385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0kZG+wgWk1nSgovzSRMiRzUYdyBhytW0OBiIjMtE4u4x/0Yrvws3jA34YsG+JGKs+LS8SWtpnv0m0QbNZLDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T00:08:27.413035Z","bundle_sha256":"ebe74f4612dee0c4cdbaad306b1db0ad2e73f8aa937ba2c94e10c59ce15c10d2"}}