{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4UFT3PV5ENASFL5PYHYP2F6VZB","short_pith_number":"pith:4UFT3PV5","canonical_record":{"source":{"id":"1606.06810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-22T03:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"bf40629e62b2c12f5f35b7ff765701fc81231ac00370ff1066a56a60c5888a6f","abstract_canon_sha256":"16bd1de9a82f0e7dd9e01627e73e109e88903bf4e8ddf6a596132dfe6046ffb9"},"schema_version":"1.0"},"canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","source":{"kind":"arxiv","id":"1606.06810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06810","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06810v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06810","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"4UFT3PV5ENAS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4UFT3PV5ENASFL5P","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4UFT3PV5","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4UFT3PV5ENASFL5PYHYP2F6VZB","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-22T03:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"bf40629e62b2c12f5f35b7ff765701fc81231ac00370ff1066a56a60c5888a6f","abstract_canon_sha256":"16bd1de9a82f0e7dd9e01627e73e109e88903bf4e8ddf6a596132dfe6046ffb9"},"schema_version":"1.0"},"canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.780372Z","signature_b64":"SzWaNOCuRidPfNzFJ1DEchi71r0n3Pl8Q3reX+72ZMlA8wM9u/R8la0tx6+XEywAayM3IZF6wnrXl0Aops0SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","last_reissued_at":"2026-05-18T00:08:36.779697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.779697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06810","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-05-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3WZlStvmVsGo+MxkdcxqmC6jNYNkMjF0KCTdih9H8qwPHPue2yLYuT7cXW1AbPyjFhC1WY9ClDK8v1eLvBnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:09:30.133295Z"},"content_sha256":"cd601e88ab28942ee5edc87d906745abdc1f5e5af48fae4510b8a6e565983a23","schema_version":"1.0","event_id":"sha256:cd601e88ab28942ee5edc87d906745abdc1f5e5af48fae4510b8a6e565983a23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4UFT3PV5ENASFL5PYHYP2F6VZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of cliques in graphs with a forbidden subdivision or immersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Wei, Jacob Fox","submitted_at":"2016-06-22T03:25:17Z","abstract_excerpt":"How many cliques can a graph on $n$ vertices have with a forbidden substructure? Extremal problems of this sort have been studied for a long time. This paper studies the maximum possible number of cliques in a graph on $n$ vertices with a forbidden clique subdivision or immersion. We prove for $t$ sufficiently large that every graph on $n \\geq t$ vertices with no $K_t$-immersion has at most $2^{t+\\log^2 t}n$ cliques, which is sharp apart from the $2^{O(\\log^2 t)}$ factor. We also prove that the maximum number of cliques in an $n$-vertex graph with no $K_t$-subdivision is at most $2^{1.817t}n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06810","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":""},"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-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6df5Yaef8uYorjaxmtV/Td4H7sblbM/dg74s0Qpf8/Appq2vAd5q0qKq9xqb5NfFH57TF5LneoaBdAS8FAKhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:09:30.133658Z"},"content_sha256":"6483d59a65dbb8895c52f09cd21770fb8b66f9e283eac07c3eef63868f77301c","schema_version":"1.0","event_id":"sha256:6483d59a65dbb8895c52f09cd21770fb8b66f9e283eac07c3eef63868f77301c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/bundle.json","state_url":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/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-19T21:09:30Z","links":{"resolver":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB","bundle":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/bundle.json","state":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4UFT3PV5ENASFL5PYHYP2F6VZB","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":"16bd1de9a82f0e7dd9e01627e73e109e88903bf4e8ddf6a596132dfe6046ffb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-22T03:25:17Z","title_canon_sha256":"bf40629e62b2c12f5f35b7ff765701fc81231ac00370ff1066a56a60c5888a6f"},"schema_version":"1.0","source":{"id":"1606.06810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06810","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06810v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06810","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"4UFT3PV5ENAS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4UFT3PV5ENASFL5P","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4UFT3PV5","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:6483d59a65dbb8895c52f09cd21770fb8b66f9e283eac07c3eef63868f77301c","target":"graph","created_at":"2026-05-18T00:08:36Z","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"},"paper":{"abstract_excerpt":"How many cliques can a graph on $n$ vertices have with a forbidden substructure? Extremal problems of this sort have been studied for a long time. This paper studies the maximum possible number of cliques in a graph on $n$ vertices with a forbidden clique subdivision or immersion. We prove for $t$ sufficiently large that every graph on $n \\geq t$ vertices with no $K_t$-immersion has at most $2^{t+\\log^2 t}n$ cliques, which is sharp apart from the $2^{O(\\log^2 t)}$ factor. We also prove that the maximum number of cliques in an $n$-vertex graph with no $K_t$-subdivision is at most $2^{1.817t}n$.","authors_text":"Fan Wei, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-22T03:25:17Z","title":"On the number of cliques in graphs with a forbidden subdivision or immersion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06810","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:cd601e88ab28942ee5edc87d906745abdc1f5e5af48fae4510b8a6e565983a23","target":"record","created_at":"2026-05-18T00:08:36Z","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":"16bd1de9a82f0e7dd9e01627e73e109e88903bf4e8ddf6a596132dfe6046ffb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-22T03:25:17Z","title_canon_sha256":"bf40629e62b2c12f5f35b7ff765701fc81231ac00370ff1066a56a60c5888a6f"},"schema_version":"1.0","source":{"id":"1606.06810","kind":"arxiv","version":2}},"canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","first_computed_at":"2026-05-18T00:08:36.779697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:36.779697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SzWaNOCuRidPfNzFJ1DEchi71r0n3Pl8Q3reX+72ZMlA8wM9u/R8la0tx6+XEywAayM3IZF6wnrXl0Aops0SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:36.780372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd601e88ab28942ee5edc87d906745abdc1f5e5af48fae4510b8a6e565983a23","sha256:6483d59a65dbb8895c52f09cd21770fb8b66f9e283eac07c3eef63868f77301c"],"state_sha256":"e8c52b701c11e0b573280262e993a51880f8cacc47627ffe55d94b8e0b3f8552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWIlbYgof3iboEAsH4/+hxc8KNJKrUbBHkoRG7Hl6BPRHnaBTM1VEPqFUwvtdRYuaVYoHRjU/U7oDwJJdLLJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:09:30.135699Z","bundle_sha256":"0ae31b609daf8d8623d76a4959c8e870ec0d29e7ff0028a6c9ed9a7d3f15d7f0"}}