{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U4K72FHUPVPACQC4EBHFWIMI5R","short_pith_number":"pith:U4K72FHU","schema_version":"1.0","canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","source":{"kind":"arxiv","id":"1603.07056","version":1},"attestation_state":"computed","paper":{"title":"On the number of cliques in graphs with a forbidden minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fan Wei, Jacob Fox","submitted_at":"2016-03-23T02:56:56Z","abstract_excerpt":"Reed and Wood and independently Norine, Seymour, Thomas, and Wollan proved that for each positive integer $t$ there is a constant $c(t)$ such that every graph on $n$ vertices with no $K_t$-minor has at most $c(t)n$ cliques. Wood asked in 2007 if we can take $c(t) = c^t$ for some absolute constant $c$. This question was recently answered affirmatively by Lee and Oum. In this paper, we determine the exponential constant. We prove that every graph on $n$ vertices with no $K_t$-minor has at most $3^{2t/3+o(t)}n$ cliques. This bound is tight for $n \\geq 4t/3$. More generally, let $H$ be a connected"},"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":"1603.07056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-23T02:56:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bc5eb96265bda0e954f6dd4d5a6e9021f3d5bf975f5ff643815d412d9ef36eda","abstract_canon_sha256":"616ce24fcf4dcc93d0b2e42ddcb318910de359f68ef04e35f35e3b45b3eea3d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.596284Z","signature_b64":"H8pkrasc0evh1HmBO2a3qpnETXZdGObG3FwpRJJt9TGMur1xZ64NE3nyT/1KTWz1dZHsrbky1W1vvML40WD9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","last_reissued_at":"2026-05-18T01:18:24.595773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.595773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of cliques in graphs with a forbidden minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fan Wei, Jacob Fox","submitted_at":"2016-03-23T02:56:56Z","abstract_excerpt":"Reed and Wood and independently Norine, Seymour, Thomas, and Wollan proved that for each positive integer $t$ there is a constant $c(t)$ such that every graph on $n$ vertices with no $K_t$-minor has at most $c(t)n$ cliques. Wood asked in 2007 if we can take $c(t) = c^t$ for some absolute constant $c$. This question was recently answered affirmatively by Lee and Oum. In this paper, we determine the exponential constant. We prove that every graph on $n$ vertices with no $K_t$-minor has at most $3^{2t/3+o(t)}n$ cliques. This bound is tight for $n \\geq 4t/3$. More generally, let $H$ be a connected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07056","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":""},"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":"1603.07056","created_at":"2026-05-18T01:18:24.595859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07056v1","created_at":"2026-05-18T01:18:24.595859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07056","created_at":"2026-05-18T01:18:24.595859+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4K72FHUPVPA","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4K72FHUPVPACQC4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4K72FHU","created_at":"2026-05-18T12:30:46.583412+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/U4K72FHUPVPACQC4EBHFWIMI5R","json":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R.json","graph_json":"https://pith.science/api/pith-number/U4K72FHUPVPACQC4EBHFWIMI5R/graph.json","events_json":"https://pith.science/api/pith-number/U4K72FHUPVPACQC4EBHFWIMI5R/events.json","paper":"https://pith.science/paper/U4K72FHU"},"agent_actions":{"view_html":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R","download_json":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R.json","view_paper":"https://pith.science/paper/U4K72FHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07056&json=true","fetch_graph":"https://pith.science/api/pith-number/U4K72FHUPVPACQC4EBHFWIMI5R/graph.json","fetch_events":"https://pith.science/api/pith-number/U4K72FHUPVPACQC4EBHFWIMI5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/action/storage_attestation","attest_author":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/action/author_attestation","sign_citation":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/action/citation_signature","submit_replication":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/action/replication_record"}},"created_at":"2026-05-18T01:18:24.595859+00:00","updated_at":"2026-05-18T01:18:24.595859+00:00"}