{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F7OBBB4P423GMLBXANDUI57GS5","short_pith_number":"pith:F7OBBB4P","schema_version":"1.0","canonical_sha256":"2fdc10878fe6b6662c3703474477e697536624e36277ed66be6b6346be32e12d","source":{"kind":"arxiv","id":"1908.01435","version":2},"attestation_state":"computed","paper":{"title":"Co-degrees resilience for perfect matchings in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Lior Hirschfeld","submitted_at":"2019-08-05T01:17:49Z","abstract_excerpt":"In this paper we prove an optimal co-degrees resilience property for the binomial $k$-uniform hypergraph model $H_{n,p}^k$ with respect to perfect matchings. That is, for a sufficiently large $n$ which is divisible by $k$, and $p\\geq C_k\\log_n/n$, we prove that with high probability every subgraph $H\\subseteq H^k_{n,p}$ with minimum co-degree (meaning, the number of supersets every set of size $k-1$ is contained in) at least $(1/2+o(1))np$ contains a perfect matching."},"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":"1908.01435","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-05T01:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"9481662f702df3b833ec8a94586eb225ffc20483e86cf9e7b50927574f2ead26","abstract_canon_sha256":"12ee5addc559cce2e9ecd47652af6f46f4aa4f39028b3143b7337de2e9fb37c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:13.202409Z","signature_b64":"2X4mI/vM8KMiiyiAVTVjb43i2qSUuAzDe7rHK1mqdDUTk8gPycxP+NIKZjcaX//6F/0/PL5A1yPfZB43YljRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fdc10878fe6b6662c3703474477e697536624e36277ed66be6b6346be32e12d","last_reissued_at":"2026-07-05T00:39:13.201934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:13.201934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-degrees resilience for perfect matchings in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Lior Hirschfeld","submitted_at":"2019-08-05T01:17:49Z","abstract_excerpt":"In this paper we prove an optimal co-degrees resilience property for the binomial $k$-uniform hypergraph model $H_{n,p}^k$ with respect to perfect matchings. That is, for a sufficiently large $n$ which is divisible by $k$, and $p\\geq C_k\\log_n/n$, we prove that with high probability every subgraph $H\\subseteq H^k_{n,p}$ with minimum co-degree (meaning, the number of supersets every set of size $k-1$ is contained in) at least $(1/2+o(1))np$ contains a perfect matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01435/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01435","created_at":"2026-07-05T00:39:13.201991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01435v2","created_at":"2026-07-05T00:39:13.201991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01435","created_at":"2026-07-05T00:39:13.201991+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7OBBB4P423G","created_at":"2026-07-05T00:39:13.201991+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7OBBB4P423GMLBX","created_at":"2026-07-05T00:39:13.201991+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7OBBB4P","created_at":"2026-07-05T00:39:13.201991+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/F7OBBB4P423GMLBXANDUI57GS5","json":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5.json","graph_json":"https://pith.science/api/pith-number/F7OBBB4P423GMLBXANDUI57GS5/graph.json","events_json":"https://pith.science/api/pith-number/F7OBBB4P423GMLBXANDUI57GS5/events.json","paper":"https://pith.science/paper/F7OBBB4P"},"agent_actions":{"view_html":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5","download_json":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5.json","view_paper":"https://pith.science/paper/F7OBBB4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01435&json=true","fetch_graph":"https://pith.science/api/pith-number/F7OBBB4P423GMLBXANDUI57GS5/graph.json","fetch_events":"https://pith.science/api/pith-number/F7OBBB4P423GMLBXANDUI57GS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5/action/storage_attestation","attest_author":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5/action/author_attestation","sign_citation":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5/action/citation_signature","submit_replication":"https://pith.science/pith/F7OBBB4P423GMLBXANDUI57GS5/action/replication_record"}},"created_at":"2026-07-05T00:39:13.201991+00:00","updated_at":"2026-07-05T00:39:13.201991+00:00"}