{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PVAGTO3JIQJNF3PMX6QB5XK2QW","short_pith_number":"pith:PVAGTO3J","schema_version":"1.0","canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","source":{"kind":"arxiv","id":"1411.3504","version":1},"attestation_state":"computed","paper":{"title":"An extension of Mantel's theorem to random 4-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","submitted_at":"2014-11-13T11:22:58Z","abstract_excerpt":"A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \\sqrt{\\log n/n}$ for some constant $K$, and apart from the value of the constant, this bound is the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\\{a,b,c,d,e\\}$ and edge set $\\{abc,ade,bde\\}$. Frankl and F\\\"uredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)"},"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":"1411.3504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"a3c1a128ff04c37e1b56d7ba14bcf3aae9c52b31cdaadda4353a4dde35a15471","abstract_canon_sha256":"2e64a4614fd9c8c038ac0643b5d3c29620a7f88784c08a42817c6b93c452ed10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.592901Z","signature_b64":"MgZu4ymaut0qsr8edAoaQBB0NhUqXEEcn7jhBIklYY/DjgsXBzWxkpnU+JyZNUJzc4gULIxy64xJr51KzRCcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","last_reissued_at":"2026-05-18T02:37:43.592524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.592524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extension of Mantel's theorem to random 4-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","submitted_at":"2014-11-13T11:22:58Z","abstract_excerpt":"A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \\sqrt{\\log n/n}$ for some constant $K$, and apart from the value of the constant, this bound is the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\\{a,b,c,d,e\\}$ and edge set $\\{abc,ade,bde\\}$. Frankl and F\\\"uredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3504","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":"1411.3504","created_at":"2026-05-18T02:37:43.592579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3504v1","created_at":"2026-05-18T02:37:43.592579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3504","created_at":"2026-05-18T02:37:43.592579+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVAGTO3JIQJN","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVAGTO3JIQJNF3PM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVAGTO3J","created_at":"2026-05-18T12:28:43.426989+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/PVAGTO3JIQJNF3PMX6QB5XK2QW","json":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW.json","graph_json":"https://pith.science/api/pith-number/PVAGTO3JIQJNF3PMX6QB5XK2QW/graph.json","events_json":"https://pith.science/api/pith-number/PVAGTO3JIQJNF3PMX6QB5XK2QW/events.json","paper":"https://pith.science/paper/PVAGTO3J"},"agent_actions":{"view_html":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW","download_json":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW.json","view_paper":"https://pith.science/paper/PVAGTO3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3504&json=true","fetch_graph":"https://pith.science/api/pith-number/PVAGTO3JIQJNF3PMX6QB5XK2QW/graph.json","fetch_events":"https://pith.science/api/pith-number/PVAGTO3JIQJNF3PMX6QB5XK2QW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/action/storage_attestation","attest_author":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/action/author_attestation","sign_citation":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/action/citation_signature","submit_replication":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/action/replication_record"}},"created_at":"2026-05-18T02:37:43.592579+00:00","updated_at":"2026-05-18T02:37:43.592579+00:00"}