{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:63NOKYXDOYFHJDXRE6HVSVDZ22","short_pith_number":"pith:63NOKYXD","schema_version":"1.0","canonical_sha256":"f6dae562e3760a748ef1278f595479d6969c6b3ae3cdccbf7662a0d60da19870","source":{"kind":"arxiv","id":"1602.02289","version":2},"attestation_state":"computed","paper":{"title":"Embedding tetrahedra into quasirandom hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-02-06T18:49:40Z","abstract_excerpt":"We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\\eta)$-quasirandom if for any subset $X\\subseteq V$ and every set of pairs $P\\subseteq V\\times V$ the number of pairs $(x,(y,z))\\in X\\times P$ with $\\{x,y,z\\}$ being a hyperedge of $H$ is in the interval $d|X||P|\\pm\\eta|V|^3$. We show that for any $\\varepsilon>0$ there exists $\\eta>0$ such that every sufficiently large $(1/2+\\varepsilon,\\eta)$-quasirandom hypergraph contains a tetrahedron, i.e., four vertices spanning all four hyperedges. A known random construction shows that th"},"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":"1602.02289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T18:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"d64db19d44eac088072dffb99feb6cc824ab5f95345ff31e029898ce988e69f1","abstract_canon_sha256":"1f849014122c51ea949dfe9f8002e912dd8953ec44336d9944a9ca5dfce97164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:28.106336Z","signature_b64":"DPcxxP5+ZHFlvv0PkNXlvWmm30nqlLxDVoql0y7CPpuQQHNw4wf8KnR6JfV8Kw6n3bt/sL6ppjuTTBJx2wkPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6dae562e3760a748ef1278f595479d6969c6b3ae3cdccbf7662a0d60da19870","last_reissued_at":"2026-05-18T01:04:28.105586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:28.105586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding tetrahedra into quasirandom hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-02-06T18:49:40Z","abstract_excerpt":"We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\\eta)$-quasirandom if for any subset $X\\subseteq V$ and every set of pairs $P\\subseteq V\\times V$ the number of pairs $(x,(y,z))\\in X\\times P$ with $\\{x,y,z\\}$ being a hyperedge of $H$ is in the interval $d|X||P|\\pm\\eta|V|^3$. We show that for any $\\varepsilon>0$ there exists $\\eta>0$ such that every sufficiently large $(1/2+\\varepsilon,\\eta)$-quasirandom hypergraph contains a tetrahedron, i.e., four vertices spanning all four hyperedges. A known random construction shows that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02289","kind":"arxiv","version":2},"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":"1602.02289","created_at":"2026-05-18T01:04:28.105718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02289v2","created_at":"2026-05-18T01:04:28.105718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02289","created_at":"2026-05-18T01:04:28.105718+00:00"},{"alias_kind":"pith_short_12","alias_value":"63NOKYXDOYFH","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"63NOKYXDOYFHJDXR","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"63NOKYXD","created_at":"2026-05-18T12:30:01.593930+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/63NOKYXDOYFHJDXRE6HVSVDZ22","json":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22.json","graph_json":"https://pith.science/api/pith-number/63NOKYXDOYFHJDXRE6HVSVDZ22/graph.json","events_json":"https://pith.science/api/pith-number/63NOKYXDOYFHJDXRE6HVSVDZ22/events.json","paper":"https://pith.science/paper/63NOKYXD"},"agent_actions":{"view_html":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22","download_json":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22.json","view_paper":"https://pith.science/paper/63NOKYXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02289&json=true","fetch_graph":"https://pith.science/api/pith-number/63NOKYXDOYFHJDXRE6HVSVDZ22/graph.json","fetch_events":"https://pith.science/api/pith-number/63NOKYXDOYFHJDXRE6HVSVDZ22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22/action/storage_attestation","attest_author":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22/action/author_attestation","sign_citation":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22/action/citation_signature","submit_replication":"https://pith.science/pith/63NOKYXDOYFHJDXRE6HVSVDZ22/action/replication_record"}},"created_at":"2026-05-18T01:04:28.105718+00:00","updated_at":"2026-05-18T01:04:28.105718+00:00"}