{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U4K72FHUPVPACQC4EBHFWIMI5R","short_pith_number":"pith:U4K72FHU","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"},"canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","source":{"kind":"arxiv","id":"1603.07056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07056","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07056v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07056","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"U4K72FHUPVPA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4K72FHUPVPACQC4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4K72FHU","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U4K72FHUPVPACQC4EBHFWIMI5R","target":"record","payload":{"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"},"canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","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"},"source_kind":"arxiv","source_id":"1603.07056","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2s7z/iTiDh5SpkUvNQ7aTzEC1qn8yWLET8AfCO99AHrnPdXwRKkX0l2A5mt6nmMsCFmEECZUC48+a/F/oAl2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:17:05.940091Z"},"content_sha256":"cf3be7e87695420a23ba8ec0f28c5d1dcb0980fe5d44c624f8d16d88ed5a4275","schema_version":"1.0","event_id":"sha256:cf3be7e87695420a23ba8ec0f28c5d1dcb0980fe5d44c624f8d16d88ed5a4275"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U4K72FHUPVPACQC4EBHFWIMI5R","target":"graph","payload":{"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"},"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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdZDs9DkbRyyhJszLet9MvNc+yIC+wfZVDz0zJl/LbcuLyMyfS4MC577eFA7CsQ2RoLKncLjWhLk86g1FXR6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:17:05.940456Z"},"content_sha256":"27226cd2ff4a82745a9c14c23ac53d1d1725a775bbe47cb8467142c93196e9d8","schema_version":"1.0","event_id":"sha256:27226cd2ff4a82745a9c14c23ac53d1d1725a775bbe47cb8467142c93196e9d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/bundle.json","state_url":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4K72FHUPVPACQC4EBHFWIMI5R/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-19T22:17:05Z","links":{"resolver":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R","bundle":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/bundle.json","state":"https://pith.science/pith/U4K72FHUPVPACQC4EBHFWIMI5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4K72FHUPVPACQC4EBHFWIMI5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U4K72FHUPVPACQC4EBHFWIMI5R","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":"616ce24fcf4dcc93d0b2e42ddcb318910de359f68ef04e35f35e3b45b3eea3d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-23T02:56:56Z","title_canon_sha256":"bc5eb96265bda0e954f6dd4d5a6e9021f3d5bf975f5ff643815d412d9ef36eda"},"schema_version":"1.0","source":{"id":"1603.07056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07056","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07056v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07056","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"U4K72FHUPVPA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4K72FHUPVPACQC4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4K72FHU","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:27226cd2ff4a82745a9c14c23ac53d1d1725a775bbe47cb8467142c93196e9d8","target":"graph","created_at":"2026-05-18T01:18:24Z","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":"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","authors_text":"Fan Wei, Jacob Fox","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-23T02:56:56Z","title":"On the number of cliques in graphs with a forbidden minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07056","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:cf3be7e87695420a23ba8ec0f28c5d1dcb0980fe5d44c624f8d16d88ed5a4275","target":"record","created_at":"2026-05-18T01:18:24Z","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":"616ce24fcf4dcc93d0b2e42ddcb318910de359f68ef04e35f35e3b45b3eea3d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-23T02:56:56Z","title_canon_sha256":"bc5eb96265bda0e954f6dd4d5a6e9021f3d5bf975f5ff643815d412d9ef36eda"},"schema_version":"1.0","source":{"id":"1603.07056","kind":"arxiv","version":1}},"canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a715fd14f47d5e01405c204e5b2188ec7c05868804db47796909d4555fa5a676","first_computed_at":"2026-05-18T01:18:24.595773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:24.595773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8pkrasc0evh1HmBO2a3qpnETXZdGObG3FwpRJJt9TGMur1xZ64NE3nyT/1KTWz1dZHsrbky1W1vvML40WD9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:24.596284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3be7e87695420a23ba8ec0f28c5d1dcb0980fe5d44c624f8d16d88ed5a4275","sha256:27226cd2ff4a82745a9c14c23ac53d1d1725a775bbe47cb8467142c93196e9d8"],"state_sha256":"a095f27fce0e9df9600b5a4f34044c52a4c42e91e5dbfbf9f1636249b3a409e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3hVI9ZWDWV+Bjabe53SBEcd2kvXm28YLsK/uk+iIxSSOlDJXVCufcZLG5jujHREvxxixDqCjnRN1riQHebPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:17:05.942385Z","bundle_sha256":"5f983d0792ea26cb31f32f4711b50aa53a0c232b10cc667ff8cac9f7deb97fed"}}