{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IZQJGRXDBY3BMWX4SL7W6MKOSL","short_pith_number":"pith:IZQJGRXD","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"},"canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","source":{"kind":"arxiv","id":"2403.03054","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03054","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03054v3","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03054","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"IZQJGRXDBY3B","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"IZQJGRXDBY3BMWX4","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"IZQJGRXD","created_at":"2026-07-05T11:40:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IZQJGRXDBY3BMWX4SL7W6MKOSL","target":"record","payload":{"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"},"canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","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"},"source_kind":"arxiv","source_id":"2403.03054","source_version":3,"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-07-05T11:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhkZTkxXTt9N6zaSp+61xFCbzvRP9YFSPrgVO6dNLSHDqEx3x4F4QFnlPWTpI252D1lxeUd8EM6yVsrzod17Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:15:45.630269Z"},"content_sha256":"c3b73156a8741b4f328e49d5c7317d5d9e21c33943c45a4ce385c4d7a50e0408","schema_version":"1.0","event_id":"sha256:c3b73156a8741b4f328e49d5c7317d5d9e21c33943c45a4ce385c4d7a50e0408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IZQJGRXDBY3BMWX4SL7W6MKOSL","target":"graph","payload":{"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"},"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-07-05T11:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKEq/zi7Be7Em+I37yo+8IOLfksjA1dUQ3NH7EiHpiZ+XMqs1ixdVOT9ZkB5mYJuJ9+Lm0ostTazeR6Fwzm7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:15:45.630649Z"},"content_sha256":"a8c3c5d5c16a9558074d35c2e2b3a2f1716f1fb4ba8a6ec8aeb0debc5f0f4ff1","schema_version":"1.0","event_id":"sha256:a8c3c5d5c16a9558074d35c2e2b3a2f1716f1fb4ba8a6ec8aeb0debc5f0f4ff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/bundle.json","state_url":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/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-08-13T10:15:45Z","links":{"resolver":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL","bundle":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/bundle.json","state":"https://pith.science/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZQJGRXDBY3BMWX4SL7W6MKOSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IZQJGRXDBY3BMWX4SL7W6MKOSL","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":"f18a70bf61551e7e9ff7338916ab1ef3d4b0276f57f1c4155ad32b4675c96821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-05T15:37:34Z","title_canon_sha256":"904a0cbfe9729978d6e7b6bed52fa8b7e97df48f36b7691bdaba08da58fdc705"},"schema_version":"1.0","source":{"id":"2403.03054","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03054","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03054v3","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03054","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"IZQJGRXDBY3B","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"IZQJGRXDBY3BMWX4","created_at":"2026-07-05T11:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"IZQJGRXD","created_at":"2026-07-05T11:40:29Z"}],"graph_snapshots":[{"event_id":"sha256:a8c3c5d5c16a9558074d35c2e2b3a2f1716f1fb4ba8a6ec8aeb0debc5f0f4ff1","target":"graph","created_at":"2026-07-05T11:40:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.03054/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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{","authors_text":"Abhishek Dhawan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-05T15:37:34Z","title":"Bounds for the independence and chromatic numbers of locally sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03054","kind":"arxiv","version":3},"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:c3b73156a8741b4f328e49d5c7317d5d9e21c33943c45a4ce385c4d7a50e0408","target":"record","created_at":"2026-07-05T11:40:29Z","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":"f18a70bf61551e7e9ff7338916ab1ef3d4b0276f57f1c4155ad32b4675c96821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-05T15:37:34Z","title_canon_sha256":"904a0cbfe9729978d6e7b6bed52fa8b7e97df48f36b7691bdaba08da58fdc705"},"schema_version":"1.0","source":{"id":"2403.03054","kind":"arxiv","version":3}},"canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46609346e30e36165afc92ff6f314e92dab42aa09e609b7ff703cf4dcfcac071","first_computed_at":"2026-07-05T11:40:29.891650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:29.891650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"knxwIZw1b1krLOaSIz1yQPnDC/5j1J54J7mrKRi49H/si+pIOlBmiSWQ4BmrS7s1GQXq0hSuPdEMZ88jKthMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:29.892135Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.03054","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3b73156a8741b4f328e49d5c7317d5d9e21c33943c45a4ce385c4d7a50e0408","sha256:a8c3c5d5c16a9558074d35c2e2b3a2f1716f1fb4ba8a6ec8aeb0debc5f0f4ff1"],"state_sha256":"895f5b9941c12fd3f08711d54fab25aaf216bbfaf2ccff81a7a812403af0b0a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbjB4qi2Pjw76uKkU8w0U/SVHbojhDsNRI3CkjEG2A6Yi6IquZzBa1GQu0licgsilvKPhRMnpZnfEzuGcIVxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:15:45.633768Z","bundle_sha256":"a6c4ad21d20ccb1ef69da19a69a9a637c69e0a64bc4db096bc189911f70ed856"}}