{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YALAOHE2BIDIK2Q3WTAJLR6MKZ","short_pith_number":"pith:YALAOHE2","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"},"canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","source":{"kind":"arxiv","id":"2605.23301","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YALAOHE2BIDIK2Q3WTAJLR6MKZ","target":"record","payload":{"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"},"canonical_sha256":"c016071c9a0a06856a1bb4c095c7cc5640b85a8580149098c6edd7d1bf4ecb7e","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"},"source_kind":"arxiv","source_id":"2605.23301","source_version":1,"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-25T02:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ie4cP7FMgcd/k6v2vRujAAz0Gz6WzRepdy83LFbcu+VcUJMEPAcsQFHvHQUXo83FwaMSMKW4djLFjNBPTmwSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:29.411378Z"},"content_sha256":"113f9b8b9e87068df164932e8d90f9f63c014f4aaf3f86ec4131cb52361705b1","schema_version":"1.0","event_id":"sha256:113f9b8b9e87068df164932e8d90f9f63c014f4aaf3f86ec4131cb52361705b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YALAOHE2BIDIK2Q3WTAJLR6MKZ","target":"graph","payload":{"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"},"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-25T02:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu7gcrbDGev1YUHJ9F8pVtPF24zYt3zR+6f8bULzz3q425ir1bcAvYnsUYlDiPVCak15oDJEj4X1mKqQv5oUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:29.412095Z"},"content_sha256":"587a469cba2878cda93fda2422c2ef0178c4b9be4a8fcaeee966b4ac2f8643c6","schema_version":"1.0","event_id":"sha256:587a469cba2878cda93fda2422c2ef0178c4b9be4a8fcaeee966b4ac2f8643c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/bundle.json","state_url":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/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-25T23:42:29Z","links":{"resolver":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ","bundle":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/bundle.json","state":"https://pith.science/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YALAOHE2BIDIK2Q3WTAJLR6MKZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcpP9bLAU59erG1lvFO9eqm+K3KCRSlndPMaHJun1w6p0V/0ombRGsZtNx5v1dm1d2ptoygMyUEF5h2a9TQKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:42:29.415787Z","bundle_sha256":"b7020680753122b882b22d110c2593d457c3a235e0b560fcc6db7759cfe6f851"}}