{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YALAOHE2BIDIK2Q3WTAJLR6MKZ","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":"893849bd9425d759cb22a466fbdbb5a2910321ff0a268be526acff6bcaaa9291","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T07:18:58Z","title_canon_sha256":"f1587385678f27a7133de62ec6c5fa6ba0b3897e12628445baddad7daf2bc4f7"},"schema_version":"1.0","source":{"id":"2605.23301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23301","created_at":"2026-05-25T02:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23301v1","created_at":"2026-05-25T02:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23301","created_at":"2026-05-25T02:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"YALAOHE2BIDI","created_at":"2026-05-25T02:01:47Z"},{"alias_kind":"pith_short_16","alias_value":"YALAOHE2BIDIK2Q3","created_at":"2026-05-25T02:01:47Z"},{"alias_kind":"pith_short_8","alias_value":"YALAOHE2","created_at":"2026-05-25T02:01:47Z"}],"graph_snapshots":[{"event_id":"sha256:587a469cba2878cda93fda2422c2ef0178c4b9be4a8fcaeee966b4ac2f8643c6","target":"graph","created_at":"2026-05-25T02:01:47Z","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/2605.23301/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An influential theorem of Nikiforov states that if an $N$-vertex graph $G$ contains at least $\\gamma N^h$ copies of some fixed $h$-vertex graph $H$, then $G$ contains an $H$-blowup of order $c_H(\\gamma)\\log N$. We provide a new proof of this theorem, which in particular improves the best known bound on the constant $c_H(\\gamma)$. In contrast to previous proofs, our proof is iterative, finding the blowup one vertex at a time.","authors_text":"Jacob Fox, Yunkun Zhou, Yuval Wigderson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T07:18:58Z","title":"Finding blowups one vertex at a time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23301","kind":"arxiv","version":1},"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:113f9b8b9e87068df164932e8d90f9f63c014f4aaf3f86ec4131cb52361705b1","target":"record","created_at":"2026-05-25T02:01:47Z","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":"893849bd9425d759cb22a466fbdbb5a2910321ff0a268be526acff6bcaaa9291","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T07:18:58Z","title_canon_sha256":"f1587385678f27a7133de62ec6c5fa6ba0b3897e12628445baddad7daf2bc4f7"},"schema_version":"1.0","source":{"id":"2605.23301","kind":"arxiv","version":1}},"canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","first_computed_at":"2026-05-25T02:01:47.966055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:47.966055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MIiVStjNwPvHczfB6TZDeiszG73tzfxs/mMeK6e1LVzJ0srczpWJy67NsKR9kdrGIKf8x7RU2b+BSWcbuJfTAQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:47.966743Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:113f9b8b9e87068df164932e8d90f9f63c014f4aaf3f86ec4131cb52361705b1","sha256:587a469cba2878cda93fda2422c2ef0178c4b9be4a8fcaeee966b4ac2f8643c6"],"state_sha256":"5c5d82dc6c24b6172d1e85e0485c657e4d7d34ae918af4b9fe6ea2e3652a0174"}