{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KTR2LGBUX2EPCAN73LRB6YJFMR","short_pith_number":"pith:KTR2LGBU","schema_version":"1.0","canonical_sha256":"54e3a59834be88f101bfdae21f61256447c27e98857e51a7f29f348de66f78f5","source":{"kind":"arxiv","id":"2403.17910","version":3},"attestation_state":"computed","paper":{"title":"Beyond chromatic threshold via the $(p,q)$-theorem, and a sharp blow-up phenomenon","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Hong Liu, Jozef Skokan, Zixiang Xu","submitted_at":"2024-03-26T17:47:00Z","abstract_excerpt":"We establish a novel connection between the well-known chromatic threshold problem in extremal combinatorics and the celebrated $(p,q)$-theorem in discrete geometry. In particular, for a graph $G$ with bounded clique number and a natural density condition, we prove a $(p,q)$-theorem for an abstract convexity space associated with $G$. Our result strengthens those of Thomassen and Nikiforov on the chromatic threshold of cliques. Our $(p,q)$-theorem can also be viewed as a $\\chi$-boundedness result for (what we call) ultra maximal $K_r$-free graphs.\n  We further show that the graphs under study "},"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":"2403.17910","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-26T17:47:00Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"0068bb83ad92accbd05f4b7f592084838838e3b51c252a9cbf8a3f8c32febce9","abstract_canon_sha256":"700a7943c1be8bb2db6ebc21b933a7a4ceccafee2d211e19b37d0336c1a11014"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:26.771401Z","signature_b64":"zDIlrTCvKpE6khG6GXuTGT+dTMhHYm6qkhV9JFJ/u4jr7vddPOW0218ekW5OU1s9fiWsEpkpIUt0uAunGWvADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e3a59834be88f101bfdae21f61256447c27e98857e51a7f29f348de66f78f5","last_reissued_at":"2026-07-05T08:59:26.770926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:26.770926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond chromatic threshold via the $(p,q)$-theorem, and a sharp blow-up phenomenon","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Hong Liu, Jozef Skokan, Zixiang Xu","submitted_at":"2024-03-26T17:47:00Z","abstract_excerpt":"We establish a novel connection between the well-known chromatic threshold problem in extremal combinatorics and the celebrated $(p,q)$-theorem in discrete geometry. In particular, for a graph $G$ with bounded clique number and a natural density condition, we prove a $(p,q)$-theorem for an abstract convexity space associated with $G$. Our result strengthens those of Thomassen and Nikiforov on the chromatic threshold of cliques. Our $(p,q)$-theorem can also be viewed as a $\\chi$-boundedness result for (what we call) ultra maximal $K_r$-free graphs.\n  We further show that the graphs under study "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17910","kind":"arxiv","version":3},"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/2403.17910/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.17910","created_at":"2026-07-05T08:59:26.770982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.17910v3","created_at":"2026-07-05T08:59:26.770982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17910","created_at":"2026-07-05T08:59:26.770982+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTR2LGBUX2EP","created_at":"2026-07-05T08:59:26.770982+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTR2LGBUX2EPCAN7","created_at":"2026-07-05T08:59:26.770982+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTR2LGBU","created_at":"2026-07-05T08:59:26.770982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10897","citing_title":"Chromatic thresholds for pairs of graphs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR","json":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR.json","graph_json":"https://pith.science/api/pith-number/KTR2LGBUX2EPCAN73LRB6YJFMR/graph.json","events_json":"https://pith.science/api/pith-number/KTR2LGBUX2EPCAN73LRB6YJFMR/events.json","paper":"https://pith.science/paper/KTR2LGBU"},"agent_actions":{"view_html":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR","download_json":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR.json","view_paper":"https://pith.science/paper/KTR2LGBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.17910&json=true","fetch_graph":"https://pith.science/api/pith-number/KTR2LGBUX2EPCAN73LRB6YJFMR/graph.json","fetch_events":"https://pith.science/api/pith-number/KTR2LGBUX2EPCAN73LRB6YJFMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR/action/storage_attestation","attest_author":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR/action/author_attestation","sign_citation":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR/action/citation_signature","submit_replication":"https://pith.science/pith/KTR2LGBUX2EPCAN73LRB6YJFMR/action/replication_record"}},"created_at":"2026-07-05T08:59:26.770982+00:00","updated_at":"2026-07-05T08:59:26.770982+00:00"}