{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BFPGGGVJR5FJKQ3QN2AL3G74UA","short_pith_number":"pith:BFPGGGVJ","schema_version":"1.0","canonical_sha256":"095e631aa98f4a9543706e80bd9bfca030e61daae52903a5d0bdad28aab2d501","source":{"kind":"arxiv","id":"1703.03513","version":1},"attestation_state":"computed","paper":{"title":"Perfect fractional matchings in k-out hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Pat Devlin","submitted_at":"2017-03-10T01:54:01Z","abstract_excerpt":"Extending the notion of (random) $k$-out graphs, we consider when the $k$-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each $r$ there is a $k=k(r)$ such that the $k$-out $r$-uniform hypergraph on $n$ vertices has a perfect fractional matching with high probability (i.e., with probability tending to $1$ as $n\\to \\infty$) and prove an analogous result for $r$-uniform $r$-partite hypergraphs. This is based on a new notion of hypergraph expansion and the observation that sufficiently expansive hypergraphs admit perfect fractional matchings. As a f"},"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":"1703.03513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T01:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"307511a7bf9d54b470445c0ac2321a91ddd0220beca2f3f1e2b725909328c58a","abstract_canon_sha256":"712d66842c40ec18bc18bfeac8e954bab73af26a51ccd70b9fc902113f4525db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:58.925557Z","signature_b64":"jRzzb3EDp/Gon0MUB1oTKS8oTKnIp6B6NpAGgb+l3RUWEMi7FyItFvZUpBmwXrzhETrp/KR99ClqwEkL/EDWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"095e631aa98f4a9543706e80bd9bfca030e61daae52903a5d0bdad28aab2d501","last_reissued_at":"2026-05-18T00:48:58.925006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:58.925006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect fractional matchings in k-out hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Pat Devlin","submitted_at":"2017-03-10T01:54:01Z","abstract_excerpt":"Extending the notion of (random) $k$-out graphs, we consider when the $k$-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each $r$ there is a $k=k(r)$ such that the $k$-out $r$-uniform hypergraph on $n$ vertices has a perfect fractional matching with high probability (i.e., with probability tending to $1$ as $n\\to \\infty$) and prove an analogous result for $r$-uniform $r$-partite hypergraphs. This is based on a new notion of hypergraph expansion and the observation that sufficiently expansive hypergraphs admit perfect fractional matchings. As a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03513","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":"1703.03513","created_at":"2026-05-18T00:48:58.925092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03513v1","created_at":"2026-05-18T00:48:58.925092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03513","created_at":"2026-05-18T00:48:58.925092+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFPGGGVJR5FJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFPGGGVJR5FJKQ3Q","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFPGGGVJ","created_at":"2026-05-18T12:31:08.081275+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/BFPGGGVJR5FJKQ3QN2AL3G74UA","json":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA.json","graph_json":"https://pith.science/api/pith-number/BFPGGGVJR5FJKQ3QN2AL3G74UA/graph.json","events_json":"https://pith.science/api/pith-number/BFPGGGVJR5FJKQ3QN2AL3G74UA/events.json","paper":"https://pith.science/paper/BFPGGGVJ"},"agent_actions":{"view_html":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA","download_json":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA.json","view_paper":"https://pith.science/paper/BFPGGGVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03513&json=true","fetch_graph":"https://pith.science/api/pith-number/BFPGGGVJR5FJKQ3QN2AL3G74UA/graph.json","fetch_events":"https://pith.science/api/pith-number/BFPGGGVJR5FJKQ3QN2AL3G74UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA/action/storage_attestation","attest_author":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA/action/author_attestation","sign_citation":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA/action/citation_signature","submit_replication":"https://pith.science/pith/BFPGGGVJR5FJKQ3QN2AL3G74UA/action/replication_record"}},"created_at":"2026-05-18T00:48:58.925092+00:00","updated_at":"2026-05-18T00:48:58.925092+00:00"}