{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3QNBGIQTBWTOBLIRG3YZTQEPDQ","short_pith_number":"pith:3QNBGIQT","canonical_record":{"source":{"id":"2004.08734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-19T00:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"f6ef59cd848ff35e1ccba9136cef276a017f6bfa9a4b13278a4428e244f47ecf","abstract_canon_sha256":"8270448e96528f4a35f4d74e35ed1399f3e7e8124753cf1a6698666714d04dda"},"schema_version":"1.0"},"canonical_sha256":"dc1a1322130da6e0ad1136f199c08f1c132ef19fda08cb5319c73aaa98a25377","source":{"kind":"arxiv","id":"2004.08734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08734","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08734v2","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08734","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"3QNBGIQTBWTO","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_16","alias_value":"3QNBGIQTBWTOBLIR","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_8","alias_value":"3QNBGIQT","created_at":"2026-07-05T00:57:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3QNBGIQTBWTOBLIRG3YZTQEPDQ","target":"record","payload":{"canonical_record":{"source":{"id":"2004.08734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-19T00:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"f6ef59cd848ff35e1ccba9136cef276a017f6bfa9a4b13278a4428e244f47ecf","abstract_canon_sha256":"8270448e96528f4a35f4d74e35ed1399f3e7e8124753cf1a6698666714d04dda"},"schema_version":"1.0"},"canonical_sha256":"dc1a1322130da6e0ad1136f199c08f1c132ef19fda08cb5319c73aaa98a25377","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:35.845228Z","signature_b64":"4BITjWtDSW8d9i6oAv4cm+Uf2QvOnHEnUhQeowE7oze8fkJM68URZSVZDBP84u966A56vHRLjjrw77BjEwqbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc1a1322130da6e0ad1136f199c08f1c132ef19fda08cb5319c73aaa98a25377","last_reissued_at":"2026-07-05T00:57:35.844866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:35.844866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.08734","source_version":2,"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-07-05T00:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGN4ZMkXiPwylNrshDaDFMJvbp08+ISzcQ4xwcRnfA3hUN0kM1EyXiVgYLvYexBb1ntvTBMUUTsFK/XeSc07AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:24.245667Z"},"content_sha256":"8febc05c3395971caa6d33310b1ac4ce0a8663ea2485e39c32eba8ae7808d871","schema_version":"1.0","event_id":"sha256:8febc05c3395971caa6d33310b1ac4ce0a8663ea2485e39c32eba8ae7808d871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3QNBGIQTBWTOBLIRG3YZTQEPDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On local Tur\\'an problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Peter Frankl, Vojt\\v{e}ch R\\\"odl","submitted_at":"2020-04-19T00:36:55Z","abstract_excerpt":"Since its formulation, Tur\\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\\mathcal{F}$ on $n$ vertices in which any five vertices span at least one edge, prove that $|\\mathcal{F}| \\ge (1/4 -o(1))\\binom{n}{3}$. The construction showing that this bound would be best possible is simply $\\binom{X}{3} \\cup \\binom{Y}{3}$ where $X$ and $Y$ evenly partition the vertex set. This construction has the following more general $(2p+1, p+1)$-property: any set of $2p+1$ vertices spans a compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.08734/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"},"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-07-05T00:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8GnuWlygbTnVKK9N3itRwLMHXV7/y3BwrrBb8hHBT+78YqCwABMnUwgOSJiv0KxLvlciGTtFXuGJ/AcXeWlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:24.246221Z"},"content_sha256":"bc1c594d5f53455d142e91a9288db7462501f0a3bf38564237f0243b996a781a","schema_version":"1.0","event_id":"sha256:bc1c594d5f53455d142e91a9288db7462501f0a3bf38564237f0243b996a781a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/bundle.json","state_url":"https://pith.science/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/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-08-03T18:33:24Z","links":{"resolver":"https://pith.science/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ","bundle":"https://pith.science/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/bundle.json","state":"https://pith.science/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QNBGIQTBWTOBLIRG3YZTQEPDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3QNBGIQTBWTOBLIRG3YZTQEPDQ","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":"8270448e96528f4a35f4d74e35ed1399f3e7e8124753cf1a6698666714d04dda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-19T00:36:55Z","title_canon_sha256":"f6ef59cd848ff35e1ccba9136cef276a017f6bfa9a4b13278a4428e244f47ecf"},"schema_version":"1.0","source":{"id":"2004.08734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08734","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08734v2","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08734","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"3QNBGIQTBWTO","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_16","alias_value":"3QNBGIQTBWTOBLIR","created_at":"2026-07-05T00:57:35Z"},{"alias_kind":"pith_short_8","alias_value":"3QNBGIQT","created_at":"2026-07-05T00:57:35Z"}],"graph_snapshots":[{"event_id":"sha256:bc1c594d5f53455d142e91a9288db7462501f0a3bf38564237f0243b996a781a","target":"graph","created_at":"2026-07-05T00:57:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.08734/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Since its formulation, Tur\\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\\mathcal{F}$ on $n$ vertices in which any five vertices span at least one edge, prove that $|\\mathcal{F}| \\ge (1/4 -o(1))\\binom{n}{3}$. The construction showing that this bound would be best possible is simply $\\binom{X}{3} \\cup \\binom{Y}{3}$ where $X$ and $Y$ evenly partition the vertex set. This construction has the following more general $(2p+1, p+1)$-property: any set of $2p+1$ vertices spans a compl","authors_text":"Hao Huang, Peter Frankl, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-19T00:36:55Z","title":"On local Tur\\'an problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08734","kind":"arxiv","version":2},"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:8febc05c3395971caa6d33310b1ac4ce0a8663ea2485e39c32eba8ae7808d871","target":"record","created_at":"2026-07-05T00:57:35Z","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":"8270448e96528f4a35f4d74e35ed1399f3e7e8124753cf1a6698666714d04dda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-19T00:36:55Z","title_canon_sha256":"f6ef59cd848ff35e1ccba9136cef276a017f6bfa9a4b13278a4428e244f47ecf"},"schema_version":"1.0","source":{"id":"2004.08734","kind":"arxiv","version":2}},"canonical_sha256":"dc1a1322130da6e0ad1136f199c08f1c132ef19fda08cb5319c73aaa98a25377","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc1a1322130da6e0ad1136f199c08f1c132ef19fda08cb5319c73aaa98a25377","first_computed_at":"2026-07-05T00:57:35.844866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:57:35.844866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BITjWtDSW8d9i6oAv4cm+Uf2QvOnHEnUhQeowE7oze8fkJM68URZSVZDBP84u966A56vHRLjjrw77BjEwqbDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:57:35.845228Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8febc05c3395971caa6d33310b1ac4ce0a8663ea2485e39c32eba8ae7808d871","sha256:bc1c594d5f53455d142e91a9288db7462501f0a3bf38564237f0243b996a781a"],"state_sha256":"2f153c30f8640bc7234503ff426615d2d1b71f78fe4d933d068f6afe9318f798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdsgbKfrFrIJucByyZMfaSWEMdd4ykXgEzlYItaksMpYaWYxoI0zSUr7TrYzqzKFweXd4L136hnLUm3/RLMTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:33:24.252355Z","bundle_sha256":"fd60ccbabaf4ee1d2adffbf04cc8be48a08315c7c3f8e81940b8014519d22d63"}}