{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RZ4EYDZNUUBMVFZFGAHUDZE53I","short_pith_number":"pith:RZ4EYDZN","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"},"canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","source":{"kind":"arxiv","id":"1602.02290","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02290","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02290v3","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02290","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"RZ4EYDZNUUBM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZ4EYDZNUUBMVFZF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZ4EYDZN","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RZ4EYDZNUUBMVFZFGAHUDZE53I","target":"record","payload":{"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"},"canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","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"},"source_kind":"arxiv","source_id":"1602.02290","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70cKkn8j9edIuxAorJIRnB+dnqP0OIkgk5wIYAkGUiU/Um/uxJZsLgPyqtThk9YwOtgq3tsJHuWNYu00ptUuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:53:27.603926Z"},"content_sha256":"81bd4de53cc9b3b209ab2d421fabff66516ac04430b90806fef38081514e4ad3","schema_version":"1.0","event_id":"sha256:81bd4de53cc9b3b209ab2d421fabff66516ac04430b90806fef38081514e4ad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RZ4EYDZNUUBMVFZFGAHUDZE53I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EEl2vBbjlYk1hBny7YMc3t4O8O2yvYzc30BF5rX4Bs3wv2biCo656M7KFMLcBVxOLYQWjZNOf7dEQJgKvJeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:53:27.604371Z"},"content_sha256":"762292862acfabffbd537b90f1e39c3d1f5a77a464b0e8830a8abfd9b757a97c","schema_version":"1.0","event_id":"sha256:762292862acfabffbd537b90f1e39c3d1f5a77a464b0e8830a8abfd9b757a97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/bundle.json","state_url":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:53:27Z","links":{"resolver":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I","bundle":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/bundle.json","state":"https://pith.science/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ4EYDZNUUBMVFZFGAHUDZE53I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RZ4EYDZNUUBMVFZFGAHUDZE53I","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":"08b405714ca8f114cb8cbb092ab0f83fe6904aea1173b9a496883094b0f7304c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T18:51:32Z","title_canon_sha256":"341990004395cd384d17e42025959dde4ab1a7383570fd87266df2ddeee9029d"},"schema_version":"1.0","source":{"id":"1602.02290","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02290","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02290v3","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02290","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"RZ4EYDZNUUBM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZ4EYDZNUUBMVFZF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZ4EYDZN","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:762292862acfabffbd537b90f1e39c3d1f5a77a464b0e8830a8abfd9b757a97c","target":"graph","created_at":"2026-05-18T00:14:57Z","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":"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","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T18:51:32Z","title":"On a Tur\\'an problem in weakly quasirandom 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02290","kind":"arxiv","version":3},"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:81bd4de53cc9b3b209ab2d421fabff66516ac04430b90806fef38081514e4ad3","target":"record","created_at":"2026-05-18T00:14:57Z","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":"08b405714ca8f114cb8cbb092ab0f83fe6904aea1173b9a496883094b0f7304c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T18:51:32Z","title_canon_sha256":"341990004395cd384d17e42025959dde4ab1a7383570fd87266df2ddeee9029d"},"schema_version":"1.0","source":{"id":"1602.02290","kind":"arxiv","version":3}},"canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e784c0f2da502ca9725300f41e49dda28f582926f989932453b40d0399e2b27","first_computed_at":"2026-05-18T00:14:57.487392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:57.487392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubo3OCbDakOt1zyo3RZX+PAB24NZOZE9pNd1RUQCJnE0BntOk5UAJwZoFe9s9+FwULKb4gmJZk36dgSZ9IOhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:57.488172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02290","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81bd4de53cc9b3b209ab2d421fabff66516ac04430b90806fef38081514e4ad3","sha256:762292862acfabffbd537b90f1e39c3d1f5a77a464b0e8830a8abfd9b757a97c"],"state_sha256":"8465edf3a51b4061d85f6c426e712e51e31e8ef7a30305788f90432fe04789aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7clJyeNJB44lKs771UVVUcMI7ge0aepFB/3LUh463guCmfUckVHftjL9lFHRG0V+E7UqJeIYxxxG7UEuPQgtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:53:27.606814Z","bundle_sha256":"b9da94fa211f339b46c3f9d97ebe0639281d08d1716a1bc5bb067cef06e4059c"}}