{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YALAOHE2BIDIK2Q3WTAJLR6MKZ","short_pith_number":"pith:YALAOHE2","schema_version":"1.0","canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","source":{"kind":"arxiv","id":"2605.23301","version":1},"attestation_state":"computed","paper":{"title":"Finding blowups one vertex at a time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Yunkun Zhou, Yuval Wigderson","submitted_at":"2026-05-22T07:18:58Z","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."},"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":"2605.23301","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T07:18:58Z","cross_cats_sorted":[],"title_canon_sha256":"f1587385678f27a7133de62ec6c5fa6ba0b3897e12628445baddad7daf2bc4f7","abstract_canon_sha256":"893849bd9425d759cb22a466fbdbb5a2910321ff0a268be526acff6bcaaa9291"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:47.966743Z","signature_b64":"MIiVStjNwPvHczfB6TZDeiszG73tzfxs/mMeK6e1LVzJ0srczpWJy67NsKR9kdrGIKf8x7RU2b+BSWcbuJfTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","last_reissued_at":"2026-05-25T02:01:47.966055Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:47.966055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding blowups one vertex at a time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Yunkun Zhou, Yuval Wigderson","submitted_at":"2026-05-22T07:18:58Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23301","kind":"arxiv","version":1},"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/2605.23301/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.23301","created_at":"2026-05-25T02:01:47.966155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23301v1","created_at":"2026-05-25T02:01:47.966155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23301","created_at":"2026-05-25T02:01:47.966155+00:00"},{"alias_kind":"pith_short_12","alias_value":"YALAOHE2BIDI","created_at":"2026-05-25T02:01:47.966155+00:00"},{"alias_kind":"pith_short_16","alias_value":"YALAOHE2BIDIK2Q3","created_at":"2026-05-25T02:01:47.966155+00:00"},{"alias_kind":"pith_short_8","alias_value":"YALAOHE2","created_at":"2026-05-25T02:01:47.966155+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/YALAOHE2BIDIK2Q3WTAJLR6MKZ","json":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ.json","graph_json":"https://pith.science/api/pith-number/YALAOHE2BIDIK2Q3WTAJLR6MKZ/graph.json","events_json":"https://pith.science/api/pith-number/YALAOHE2BIDIK2Q3WTAJLR6MKZ/events.json","paper":"https://pith.science/paper/YALAOHE2"},"agent_actions":{"view_html":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ","download_json":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ.json","view_paper":"https://pith.science/paper/YALAOHE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23301&json=true","fetch_graph":"https://pith.science/api/pith-number/YALAOHE2BIDIK2Q3WTAJLR6MKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YALAOHE2BIDIK2Q3WTAJLR6MKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/action/storage_attestation","attest_author":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/action/author_attestation","sign_citation":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/action/citation_signature","submit_replication":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/action/replication_record"}},"created_at":"2026-05-25T02:01:47.966155+00:00","updated_at":"2026-05-25T02:01:47.966155+00:00"}