{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WY35VF5TUNFDIZBWXCHY5RNJ6Z","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":"2583603ad7743db31292d4cd92282101885e1d97049e6c39df3d80d3e09ee440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-10T15:15:16Z","title_canon_sha256":"a21c2370e66a0f94afc6d4cce834552af3c741c16c5eead158a9874f8a493c54"},"schema_version":"1.0","source":{"id":"1102.2141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2141","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2141v1","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2141","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"WY35VF5TUNFD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WY35VF5TUNFDIZBW","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WY35VF5T","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:125f13f503f24f1aec41f2c69ecd6f0ab910aa31ec5e08df9e98a9c1eac959ee","target":"graph","created_at":"2026-05-18T04:29:34Z","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":"Let $F_{3,3}$ be the 3-graph on 6 vertices, labelled abcxyz, and 10 edges, one of which is abc, and the other 9 of which are all triples that contain 1 vertex from abc and 2 vertices from xyz. We show that for all $n \\ge 6$, the maximum number of edges in an $F_{3,3}$-free 3-graph on $n$ vertices is $\\binom{n}{3} - \\binom{\\lfloor n/2 \\rfloor}{3} - \\binom{\\lceil n/2 \\rceil}{3}$. This sharpens results of Zhou and of the second author and R\\\"odl.","authors_text":"Dhruv Mubayi, Peter Keevash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-10T15:15:16Z","title":"The Tur\\'an number of $F_{3,3}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2141","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:6681cbda658d2b0070b87aee824c3add2767b279bf64262ad5d41017f5a5959a","target":"record","created_at":"2026-05-18T04:29:34Z","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":"2583603ad7743db31292d4cd92282101885e1d97049e6c39df3d80d3e09ee440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-10T15:15:16Z","title_canon_sha256":"a21c2370e66a0f94afc6d4cce834552af3c741c16c5eead158a9874f8a493c54"},"schema_version":"1.0","source":{"id":"1102.2141","kind":"arxiv","version":1}},"canonical_sha256":"b637da97b3a34a346436b88f8ec5a9f64026c8200d060d492279063d49259d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b637da97b3a34a346436b88f8ec5a9f64026c8200d060d492279063d49259d83","first_computed_at":"2026-05-18T04:29:34.166986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:34.166986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZ3+enJQZrtZe9z5e8O0bWDTiBXRVQUNQbOUNb5sDmZGxJF8mkD1sNKjJpA8ZC6p0UZv6VRwwskZIFnoPzPqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:34.167646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6681cbda658d2b0070b87aee824c3add2767b279bf64262ad5d41017f5a5959a","sha256:125f13f503f24f1aec41f2c69ecd6f0ab910aa31ec5e08df9e98a9c1eac959ee"],"state_sha256":"4252b462d4dc49a176d76c32c0db49157578d903536585579f9fe56aa922ec2b"}