{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4UFT3PV5ENASFL5PYHYP2F6VZB","short_pith_number":"pith:4UFT3PV5","schema_version":"1.0","canonical_sha256":"e50b3dbebd234122afafc1f0fd17d5c87fa999ed32897ce6c486973b9d327ec9","source":{"kind":"arxiv","id":"1606.06810","version":2},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.06810","created_at":"2026-05-18T00:08:36.779794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06810v2","created_at":"2026-05-18T00:08:36.779794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06810","created_at":"2026-05-18T00:08:36.779794+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UFT3PV5ENAS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UFT3PV5ENASFL5P","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UFT3PV5","created_at":"2026-05-18T12:29:58.707656+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/4UFT3PV5ENASFL5PYHYP2F6VZB","json":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB.json","graph_json":"https://pith.science/api/pith-number/4UFT3PV5ENASFL5PYHYP2F6VZB/graph.json","events_json":"https://pith.science/api/pith-number/4UFT3PV5ENASFL5PYHYP2F6VZB/events.json","paper":"https://pith.science/paper/4UFT3PV5"},"agent_actions":{"view_html":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB","download_json":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB.json","view_paper":"https://pith.science/paper/4UFT3PV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06810&json=true","fetch_graph":"https://pith.science/api/pith-number/4UFT3PV5ENASFL5PYHYP2F6VZB/graph.json","fetch_events":"https://pith.science/api/pith-number/4UFT3PV5ENASFL5PYHYP2F6VZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/action/storage_attestation","attest_author":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/action/author_attestation","sign_citation":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/action/citation_signature","submit_replication":"https://pith.science/pith/4UFT3PV5ENASFL5PYHYP2F6VZB/action/replication_record"}},"created_at":"2026-05-18T00:08:36.779794+00:00","updated_at":"2026-05-18T00:08:36.779794+00:00"}