{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FD7GETZV77APZCFKVDY5OOICY2","short_pith_number":"pith:FD7GETZV","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"},"canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","source":{"kind":"arxiv","id":"1609.00530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00530","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00530v1","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00530","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"FD7GETZV77AP","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FD7GETZV77APZCFK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FD7GETZV","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FD7GETZV77APZCFKVDY5OOICY2","target":"record","payload":{"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"},"canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","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"},"source_kind":"arxiv","source_id":"1609.00530","source_version":1,"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5dQIt4oL6FBhaldGseVswbGR9eFd4+KMUwWc/sbvIZ6WGukHxCzE8JzANPmpCgA3BGIjmgXeR0xAI+1GZpuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:25:45.998446Z"},"content_sha256":"137ca0cb42bd7a86a61fc794fd6a9b51c4a6d0a5826a2633172903e8fe28a385","schema_version":"1.0","event_id":"sha256:137ca0cb42bd7a86a61fc794fd6a9b51c4a6d0a5826a2633172903e8fe28a385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FD7GETZV77APZCFKVDY5OOICY2","target":"graph","payload":{"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"},"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gES6NvhEnRET3M6LJ5MVBaV9KRCAvheKkUQYJ0QR9AasSCmxEqTgQdY7lxy9DQ9uLQ9q7u1wBU6ta+7RU92tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:25:45.999083Z"},"content_sha256":"6b09b879008ae33abc2ff4e86e526d20f660507e45ae3a04162b684b7215ca2a","schema_version":"1.0","event_id":"sha256:6b09b879008ae33abc2ff4e86e526d20f660507e45ae3a04162b684b7215ca2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/bundle.json","state_url":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FD7GETZV77APZCFKVDY5OOICY2/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-05-18T20:25:45Z","links":{"resolver":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2","bundle":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/bundle.json","state":"https://pith.science/pith/FD7GETZV77APZCFKVDY5OOICY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FD7GETZV77APZCFKVDY5OOICY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FD7GETZV77APZCFKVDY5OOICY2","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":"c278561815f03d0102fbea0b10ccce4ec3a5ddddd439ec7f3ac2cd69d82f1a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T10:12:46Z","title_canon_sha256":"0b31cc46e02b8c910405fcd9f6165a0b4167159bee1e9f3e4603c8f6dbd13515"},"schema_version":"1.0","source":{"id":"1609.00530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00530","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00530v1","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00530","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"FD7GETZV77AP","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FD7GETZV77APZCFK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FD7GETZV","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:6b09b879008ae33abc2ff4e86e526d20f660507e45ae3a04162b684b7215ca2a","target":"graph","created_at":"2026-05-18T01:06:23Z","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 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","authors_text":"Andrzej Ruci\\'nski, Peter Frankl, Vojtech R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T10:12:46Z","title":"Short Proof of Erd\\H os Conjecture for Triple Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00530","kind":"arxiv","version":1},"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:137ca0cb42bd7a86a61fc794fd6a9b51c4a6d0a5826a2633172903e8fe28a385","target":"record","created_at":"2026-05-18T01:06:23Z","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":"c278561815f03d0102fbea0b10ccce4ec3a5ddddd439ec7f3ac2cd69d82f1a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T10:12:46Z","title_canon_sha256":"0b31cc46e02b8c910405fcd9f6165a0b4167159bee1e9f3e4603c8f6dbd13515"},"schema_version":"1.0","source":{"id":"1609.00530","kind":"arxiv","version":1}},"canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28fe624f35ffc0fc88aaa8f1d73902c6ba9f575d33ceb085814206fbbcfe553d","first_computed_at":"2026-05-18T01:06:23.755883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:23.755883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Reo7N3YS8siHuUARmvxyFvtd15MbQSPYHttKw8sDVgNa/mHnrtPYJHaQERksIE590Ba/rEDjqtbt6vW/+RJ6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:23.756365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:137ca0cb42bd7a86a61fc794fd6a9b51c4a6d0a5826a2633172903e8fe28a385","sha256:6b09b879008ae33abc2ff4e86e526d20f660507e45ae3a04162b684b7215ca2a"],"state_sha256":"7f1837bec52633fa607ae41fffdd61621b408e3fcef085833e4cb230766a21ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCYzRA7hqLHsXsjqA8tlDFvVlrF3etDrka56rKiosj1SOA5DGdG2reFr7YLvzRG/c+sk+U7rNe3+rbV7CubACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:25:46.001038Z","bundle_sha256":"490a23ba65c0b8d98456d8682826182465ce99e131e754f67e3b2d0c403e2766"}}