{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QSHCHK4QCQWI7D3HUP5CCLKDQP","short_pith_number":"pith:QSHCHK4Q","schema_version":"1.0","canonical_sha256":"848e23ab90142c8f8f67a3fa212d4383f2e0db7b5bbfc0a68b9de58a1df68f6b","source":{"kind":"arxiv","id":"2607.28071","version":1},"attestation_state":"computed","paper":{"title":"Random Tur\\'an Theorem for the Fano Plane","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen","submitted_at":"2026-07-30T11:45:43Z","abstract_excerpt":"Let $F$ denote the Fano plane, the $3$-uniform hypergraph with $7$ vertices and $7$ edges. Frankl and F\\\"uredi, and independently Keevash and Sudakov, proved that the largest $F$-free subhypergraph of $K_n^{(3)}$ is bipartite. In this paper, we determine the sharp threshold for this property in the random setting. We show that for $\\hat{p} = \\Theta_F \\cdot n^{-2/3} \\left(\\log n\\right)^{1/6}$, where $\\Theta_F$ is an explicit constant depending on $F$, we have: (i) if $(1+\\epsilon) \\hat{p} \\le p = o(1)$, then with high probability every largest $F$-free subhypergraph of $G_{n,p}^{(3)}$ is bipart"},"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":"2607.28071","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T11:45:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b574e0e49090d1e5610d8a5a2789e114efc6d0af905d0977bb7f6b1733482a42","abstract_canon_sha256":"23ea2a6f15524814ed3a6e3cd32d705bc2979d80a320ccf26eda304b8493f5ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848e23ab90142c8f8f67a3fa212d4383f2e0db7b5bbfc0a68b9de58a1df68f6b","last_reissued_at":"2026-07-31T01:35:32.965962Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:32.965962Z"},"graph_snapshot":{"paper":{"title":"Random Tur\\'an Theorem for the Fano Plane","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen","submitted_at":"2026-07-30T11:45:43Z","abstract_excerpt":"Let $F$ denote the Fano plane, the $3$-uniform hypergraph with $7$ vertices and $7$ edges. Frankl and F\\\"uredi, and independently Keevash and Sudakov, proved that the largest $F$-free subhypergraph of $K_n^{(3)}$ is bipartite. In this paper, we determine the sharp threshold for this property in the random setting. We show that for $\\hat{p} = \\Theta_F \\cdot n^{-2/3} \\left(\\log n\\right)^{1/6}$, where $\\Theta_F$ is an explicit constant depending on $F$, we have: (i) if $(1+\\epsilon) \\hat{p} \\le p = o(1)$, then with high probability every largest $F$-free subhypergraph of $G_{n,p}^{(3)}$ is bipart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28071","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28071/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":"2607.28071","created_at":"2026-07-31T01:35:32.969077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28071v1","created_at":"2026-07-31T01:35:32.969077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28071","created_at":"2026-07-31T01:35:32.969077+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSHCHK4QCQWI","created_at":"2026-07-31T01:35:32.969077+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSHCHK4QCQWI7D3H","created_at":"2026-07-31T01:35:32.969077+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSHCHK4Q","created_at":"2026-07-31T01:35:32.969077+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/QSHCHK4QCQWI7D3HUP5CCLKDQP","json":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP.json","graph_json":"https://pith.science/api/pith-number/QSHCHK4QCQWI7D3HUP5CCLKDQP/graph.json","events_json":"https://pith.science/api/pith-number/QSHCHK4QCQWI7D3HUP5CCLKDQP/events.json","paper":"https://pith.science/paper/QSHCHK4Q"},"agent_actions":{"view_html":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP","download_json":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP.json","view_paper":"https://pith.science/paper/QSHCHK4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28071&json=true","fetch_graph":"https://pith.science/api/pith-number/QSHCHK4QCQWI7D3HUP5CCLKDQP/graph.json","fetch_events":"https://pith.science/api/pith-number/QSHCHK4QCQWI7D3HUP5CCLKDQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP/action/storage_attestation","attest_author":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP/action/author_attestation","sign_citation":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP/action/citation_signature","submit_replication":"https://pith.science/pith/QSHCHK4QCQWI7D3HUP5CCLKDQP/action/replication_record"}},"created_at":"2026-07-31T01:35:32.969077+00:00","updated_at":"2026-07-31T01:35:32.969077+00:00"}