{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IZQJGRXDBY3BMWX4SL7W6MKOSL","short_pith_number":"pith:IZQJGRXD","schema_version":"1.0","canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","source":{"kind":"arxiv","id":"2403.03054","version":3},"attestation_state":"computed","paper":{"title":"Bounds for the independence and chromatic numbers of locally sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan","submitted_at":"2024-03-05T15:37:34Z","abstract_excerpt":"In this note we consider a more general version of local sparsity introduced recently by Anderson, Kuchukova, and the author. In particular, we say a graph $G = (V, E)$ is $(k, r)$-locally-sparse if for each vertex $v \\in V(G)$, the subgraph induced by its neighborhood contains at most $k$ cliques of size $r$. For $r \\geq 3$ and $\\epsilon \\in [0, 1]$, we show that an $n$-vertex $(\\Delta^{\\epsilon r}, r)$-locally-sparse graph $G$ of maximum degree $\\Delta$ satisfies $\\alpha(G) \\geq (1-o(1))\\dfrac{n}{\\eta\\Delta}$ and $\\chi(G) \\leq \\Theta\\left(\\eta\\Delta\\right)$, where $\\eta := \\epsilon + \\dfrac{"},"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.03054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-05T15:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"904a0cbfe9729978d6e7b6bed52fa8b7e97df48f36b7691bdaba08da58fdc705","abstract_canon_sha256":"f18a70bf61551e7e9ff7338916ab1ef3d4b0276f57f1c4155ad32b4675c96821"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:29.892135Z","signature_b64":"knxwIZw1b1krLOaSIz1yQPnDC/5j1J54J7mrKRi49H/si+pIOlBmiSWQ4BmrS7s1GQXq0hSuPdEMZ88jKthMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","last_reissued_at":"2026-07-05T11:40:29.891650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:29.891650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for the independence and chromatic numbers of locally sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan","submitted_at":"2024-03-05T15:37:34Z","abstract_excerpt":"In this note we consider a more general version of local sparsity introduced recently by Anderson, Kuchukova, and the author. In particular, we say a graph $G = (V, E)$ is $(k, r)$-locally-sparse if for each vertex $v \\in V(G)$, the subgraph induced by its neighborhood contains at most $k$ cliques of size $r$. For $r \\geq 3$ and $\\epsilon \\in [0, 1]$, we show that an $n$-vertex $(\\Delta^{\\epsilon r}, r)$-locally-sparse graph $G$ of maximum degree $\\Delta$ satisfies $\\alpha(G) \\geq (1-o(1))\\dfrac{n}{\\eta\\Delta}$ and $\\chi(G) \\leq \\Theta\\left(\\eta\\Delta\\right)$, where $\\eta := \\epsilon + \\dfrac{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03054","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.03054/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.03054","created_at":"2026-07-05T11:40:29.891709+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03054v3","created_at":"2026-07-05T11:40:29.891709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03054","created_at":"2026-07-05T11:40:29.891709+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZQJGRXDBY3B","created_at":"2026-07-05T11:40:29.891709+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZQJGRXDBY3BMWX4","created_at":"2026-07-05T11:40:29.891709+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZQJGRXD","created_at":"2026-07-05T11:40:29.891709+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00567","citing_title":"Local Shearer bound","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL","json":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL.json","graph_json":"https://pith.science/api/pith-number/IZQJGRXDBY3BMWX4SL7W6MKOSL/graph.json","events_json":"https://pith.science/api/pith-number/IZQJGRXDBY3BMWX4SL7W6MKOSL/events.json","paper":"https://pith.science/paper/IZQJGRXD"},"agent_actions":{"view_html":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL","download_json":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL.json","view_paper":"https://pith.science/paper/IZQJGRXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03054&json=true","fetch_graph":"https://pith.science/api/pith-number/IZQJGRXDBY3BMWX4SL7W6MKOSL/graph.json","fetch_events":"https://pith.science/api/pith-number/IZQJGRXDBY3BMWX4SL7W6MKOSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/action/storage_attestation","attest_author":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/action/author_attestation","sign_citation":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/action/citation_signature","submit_replication":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/action/replication_record"}},"created_at":"2026-07-05T11:40:29.891709+00:00","updated_at":"2026-07-05T11:40:29.891709+00:00"}