{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RZ4EYDZNUUBMVFZFGAHUDZE53I","short_pith_number":"pith:RZ4EYDZN","schema_version":"1.0","canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","source":{"kind":"arxiv","id":"1602.02290","version":3},"attestation_state":"computed","paper":{"title":"On a Tur\\'an problem in weakly quasirandom 3-uniform 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:51:32Z","abstract_excerpt":"Extremal problems for $3$-uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extremal problems in the context of quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is weakly $(d,\\eta)$-quasirandom if for any subset $U\\subseteq V$ the number of hyperedges of $H$ contained in $U$ is in the interval $d\\binom{|U|}{3}\\pm\\eta|V|^3$. We show that for any $\\varepsilon>0$ there exists $\\eta>0$ such that every sufficiently large weakly $(1/4+\\varepsilon,\\eta)$-quasirandom hypergraph con"},"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.02290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T18:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"341990004395cd384d17e42025959dde4ab1a7383570fd87266df2ddeee9029d","abstract_canon_sha256":"08b405714ca8f114cb8cbb092ab0f83fe6904aea1173b9a496883094b0f7304c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.488172Z","signature_b64":"ubo3OCbDakOt1zyo3RZX+PAB24NZOZE9pNd1RUQCJnE0BntOk5UAJwZoFe9s9+FwULKb4gmJZk36dgSZ9IOhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","last_reissued_at":"2026-05-18T00:14:57.487392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.487392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Tur\\'an problem in weakly quasirandom 3-uniform 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:51:32Z","abstract_excerpt":"Extremal problems for $3$-uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extremal problems in the context of quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is weakly $(d,\\eta)$-quasirandom if for any subset $U\\subseteq V$ the number of hyperedges of $H$ contained in $U$ is in the interval $d\\binom{|U|}{3}\\pm\\eta|V|^3$. We show that for any $\\varepsilon>0$ there exists $\\eta>0$ such that every sufficiently large weakly $(1/4+\\varepsilon,\\eta)$-quasirandom hypergraph con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02290","kind":"arxiv","version":3},"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.02290","created_at":"2026-05-18T00:14:57.487530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02290v3","created_at":"2026-05-18T00:14:57.487530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02290","created_at":"2026-05-18T00:14:57.487530+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ4EYDZNUUBM","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ4EYDZNUUBMVFZF","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ4EYDZN","created_at":"2026-05-18T12:30:41.710351+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/RZ4EYDZNUUBMVFZFGAHUDZE53I","json":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I.json","graph_json":"https://pith.science/api/pith-number/RZ4EYDZNUUBMVFZFGAHUDZE53I/graph.json","events_json":"https://pith.science/api/pith-number/RZ4EYDZNUUBMVFZFGAHUDZE53I/events.json","paper":"https://pith.science/paper/RZ4EYDZN"},"agent_actions":{"view_html":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I","download_json":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I.json","view_paper":"https://pith.science/paper/RZ4EYDZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02290&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ4EYDZNUUBMVFZFGAHUDZE53I/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ4EYDZNUUBMVFZFGAHUDZE53I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/action/storage_attestation","attest_author":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/action/author_attestation","sign_citation":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/action/citation_signature","submit_replication":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/action/replication_record"}},"created_at":"2026-05-18T00:14:57.487530+00:00","updated_at":"2026-05-18T00:14:57.487530+00:00"}