{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FD7GETZV77APZCFKVDY5OOICY2","short_pith_number":"pith:FD7GETZV","schema_version":"1.0","canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","source":{"kind":"arxiv","id":"1609.00530","version":1},"attestation_state":"computed","paper":{"title":"Short Proof of Erd\\H os Conjecture for Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Ruci\\'nski, Peter Frankl, Vojtech R\\\"odl","submitted_at":"2016-09-02T10:12:46Z","abstract_excerpt":"In 1965 Erd\\H os conjectured that for all $k\\ge2$, $s\\ge1$ and $n\\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\\F$ with $\\nu(\\F)=s$ cannot have more than \\newline $\\max\\{\\binom{sk+k-1}k,\\;\\binom nk-\\binom{n-s}k\\}$ edges. It took almost fifty years to prove it for triple systems. In 2012 we proved the conjecture for all $s$ and all $n\\ge4(s+1)$. Then {\\L}uczak and Mieczkowska (2013) proved the conjecture for sufficiently large $s$ and all $n$. Soon after, Frankl proved it for all $s$. Here we present a simpler version of that proof which yields Erd\\H os's conjecture for $s\\ge33$. Our motiv"},"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":"1609.00530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T10:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"0b31cc46e02b8c910405fcd9f6165a0b4167159bee1e9f3e4603c8f6dbd13515","abstract_canon_sha256":"c278561815f03d0102fbea0b10ccce4ec3a5ddddd439ec7f3ac2cd69d82f1a52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.756365Z","signature_b64":"Reo7N3YS8siHuUARmvxyFvtd15MbQSPYHttKw8sDVgNa/mHnrtPYJHaQERksIE590Ba/rEDjqtbt6vW/+RJ6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","last_reissued_at":"2026-05-18T01:06:23.755883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.755883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Proof of Erd\\H os Conjecture for Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Ruci\\'nski, Peter Frankl, Vojtech R\\\"odl","submitted_at":"2016-09-02T10:12:46Z","abstract_excerpt":"In 1965 Erd\\H os conjectured that for all $k\\ge2$, $s\\ge1$ and $n\\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\\F$ with $\\nu(\\F)=s$ cannot have more than \\newline $\\max\\{\\binom{sk+k-1}k,\\;\\binom nk-\\binom{n-s}k\\}$ edges. It took almost fifty years to prove it for triple systems. In 2012 we proved the conjecture for all $s$ and all $n\\ge4(s+1)$. Then {\\L}uczak and Mieczkowska (2013) proved the conjecture for sufficiently large $s$ and all $n$. Soon after, Frankl proved it for all $s$. Here we present a simpler version of that proof which yields Erd\\H os's conjecture for $s\\ge33$. Our motiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00530","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":"1609.00530","created_at":"2026-05-18T01:06:23.755957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00530v1","created_at":"2026-05-18T01:06:23.755957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00530","created_at":"2026-05-18T01:06:23.755957+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD7GETZV77AP","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD7GETZV77APZCFK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD7GETZV","created_at":"2026-05-18T12:30:15.759754+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/FD7GETZV77APZCFKVDY5OOICY2","json":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2.json","graph_json":"https://pith.science/api/pith-number/FD7GETZV77APZCFKVDY5OOICY2/graph.json","events_json":"https://pith.science/api/pith-number/FD7GETZV77APZCFKVDY5OOICY2/events.json","paper":"https://pith.science/paper/FD7GETZV"},"agent_actions":{"view_html":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2","download_json":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2.json","view_paper":"https://pith.science/paper/FD7GETZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00530&json=true","fetch_graph":"https://pith.science/api/pith-number/FD7GETZV77APZCFKVDY5OOICY2/graph.json","fetch_events":"https://pith.science/api/pith-number/FD7GETZV77APZCFKVDY5OOICY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/action/storage_attestation","attest_author":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/action/author_attestation","sign_citation":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/action/citation_signature","submit_replication":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/action/replication_record"}},"created_at":"2026-05-18T01:06:23.755957+00:00","updated_at":"2026-05-18T01:06:23.755957+00:00"}