{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EEPUPNZ6YF56ZP47F4CQSLRI5K","short_pith_number":"pith:EEPUPNZ6","canonical_record":{"source":{"id":"2203.02826","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-05T22:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"9b4e6a9ea5a2a5ceb8e81136ef3e3c2a96f2ffbcddb6f710da2b2579a0ca5f6f","abstract_canon_sha256":"bf117e032be2835ff846292967ec0129d6d9d15f6dd97aa704f825af5d477d7c"},"schema_version":"1.0"},"canonical_sha256":"211f47b73ec17becbf9f2f05092e28ea9f8c3aa37fd83b74b3bd9489e0ca1059","source":{"kind":"arxiv","id":"2203.02826","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02826","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02826v4","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02826","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"EEPUPNZ6YF56","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"EEPUPNZ6YF56ZP47","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"EEPUPNZ6","created_at":"2026-07-05T06:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EEPUPNZ6YF56ZP47F4CQSLRI5K","target":"record","payload":{"canonical_record":{"source":{"id":"2203.02826","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-05T22:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"9b4e6a9ea5a2a5ceb8e81136ef3e3c2a96f2ffbcddb6f710da2b2579a0ca5f6f","abstract_canon_sha256":"bf117e032be2835ff846292967ec0129d6d9d15f6dd97aa704f825af5d477d7c"},"schema_version":"1.0"},"canonical_sha256":"211f47b73ec17becbf9f2f05092e28ea9f8c3aa37fd83b74b3bd9489e0ca1059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:41.672360Z","signature_b64":"kA9rH6hHzAWJ8vl/GmqxmQvT364BmUiGRBzWihU6iKlGrw/4L5Uw/5zYDhX3b+USxOfdS5pdiMuqSpDgpyb0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211f47b73ec17becbf9f2f05092e28ea9f8c3aa37fd83b74b3bd9489e0ca1059","last_reissued_at":"2026-07-05T06:30:41.671912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:41.671912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.02826","source_version":4,"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-05T06:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LvQdjP6b1TyIDk/XgbgKunNKRNVeBlrsAIieUmOzasPH8fiYzlrfZ37lE1pRhD5qOUA+t8PAiz3kAEGl6MvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:43:49.162675Z"},"content_sha256":"63df003589828424a9f7eb606817d3600556d9d2e6696cf3515b2e4ef2857e7a","schema_version":"1.0","event_id":"sha256:63df003589828424a9f7eb606817d3600556d9d2e6696cf3515b2e4ef2857e7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EEPUPNZ6YF56ZP47F4CQSLRI5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haoran Luo, Igor Araujo, J\\'ozsef Balogh","submitted_at":"2022-03-05T22:51:26Z","abstract_excerpt":"Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\\{1,2,3,4,5\\}$ with hyperedges $\\{123,124,345\\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \\log n / n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\\sqrt{\\log n} / n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \\sqrt{\\log n} / n $ for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02826","kind":"arxiv","version":4},"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/2203.02826/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-05T06:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jka5vbgId6r7+t2veDHocPe6iEhHjNW8sUbG/DOJAJCVqG1mXdtodK+8xnOycm4LjKO3T8YsmU200iiMp3D8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:43:49.163058Z"},"content_sha256":"d6106b7629dccdcc758e0d8fab7adcebffacd9fdd87bf399b0349368ffd14c01","schema_version":"1.0","event_id":"sha256:d6106b7629dccdcc758e0d8fab7adcebffacd9fdd87bf399b0349368ffd14c01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/bundle.json","state_url":"https://pith.science/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/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-07-06T17:43:49Z","links":{"resolver":"https://pith.science/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K","bundle":"https://pith.science/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/bundle.json","state":"https://pith.science/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEPUPNZ6YF56ZP47F4CQSLRI5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EEPUPNZ6YF56ZP47F4CQSLRI5K","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":"bf117e032be2835ff846292967ec0129d6d9d15f6dd97aa704f825af5d477d7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-05T22:51:26Z","title_canon_sha256":"9b4e6a9ea5a2a5ceb8e81136ef3e3c2a96f2ffbcddb6f710da2b2579a0ca5f6f"},"schema_version":"1.0","source":{"id":"2203.02826","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02826","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02826v4","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02826","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"EEPUPNZ6YF56","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"EEPUPNZ6YF56ZP47","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"EEPUPNZ6","created_at":"2026-07-05T06:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:d6106b7629dccdcc758e0d8fab7adcebffacd9fdd87bf399b0349368ffd14c01","target":"graph","created_at":"2026-07-05T06:30:41Z","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/2203.02826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\\{1,2,3,4,5\\}$ with hyperedges $\\{123,124,345\\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \\log n / n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\\sqrt{\\log n} / n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \\sqrt{\\log n} / n $ for s","authors_text":"Haoran Luo, Igor Araujo, J\\'ozsef Balogh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-05T22:51:26Z","title":"On the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02826","kind":"arxiv","version":4},"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:63df003589828424a9f7eb606817d3600556d9d2e6696cf3515b2e4ef2857e7a","target":"record","created_at":"2026-07-05T06:30:41Z","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":"bf117e032be2835ff846292967ec0129d6d9d15f6dd97aa704f825af5d477d7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-05T22:51:26Z","title_canon_sha256":"9b4e6a9ea5a2a5ceb8e81136ef3e3c2a96f2ffbcddb6f710da2b2579a0ca5f6f"},"schema_version":"1.0","source":{"id":"2203.02826","kind":"arxiv","version":4}},"canonical_sha256":"211f47b73ec17becbf9f2f05092e28ea9f8c3aa37fd83b74b3bd9489e0ca1059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"211f47b73ec17becbf9f2f05092e28ea9f8c3aa37fd83b74b3bd9489e0ca1059","first_computed_at":"2026-07-05T06:30:41.671912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:41.671912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kA9rH6hHzAWJ8vl/GmqxmQvT364BmUiGRBzWihU6iKlGrw/4L5Uw/5zYDhX3b+USxOfdS5pdiMuqSpDgpyb0DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:41.672360Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.02826","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63df003589828424a9f7eb606817d3600556d9d2e6696cf3515b2e4ef2857e7a","sha256:d6106b7629dccdcc758e0d8fab7adcebffacd9fdd87bf399b0349368ffd14c01"],"state_sha256":"ddc5a7af915125bfda4df404d2622339cfdecb612f5069a02717edba458220eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzaUe+075zPMFm9Tj4pQg/ew1ISbC4lwTZ1DfyvuGZnochFgg//rlBabBiEdXRIt2doBhojqSFaw1gIz3f1fCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:43:49.164989Z","bundle_sha256":"7c9eec7312a271f828c7ae04fc71ce871fe8ea32b139a44b6c15c9b87a00a3ff"}}