{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YOEWFWMANH37EAQ2DEV55TI5KQ","short_pith_number":"pith:YOEWFWMA","schema_version":"1.0","canonical_sha256":"c38962d98069f7f2021a192bdecd1d5409018b17d0385e8bf6a68dc9a11fdb7e","source":{"kind":"arxiv","id":"2504.02992","version":2},"attestation_state":"computed","paper":{"title":"A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pierre Charbit, Romain Bourneuf, St\\'ephan Thomass\\'e","submitted_at":"2025-04-03T19:31:05Z","abstract_excerpt":"In its Euclidean form, the Dense Neighborhood Lemma (DNL) asserts that if $V$ is a finite set of points of $\\mathbb{R}^N$ such that for each $v \\in V$ the ball $B(v,1)$ intersects $V$ on at least $\\delta |V|$ points, then for every $\\varepsilon >0$, the points of $V$ can be covered with $f(\\delta,\\varepsilon)$ balls $B(v,1+\\varepsilon)$ with $v \\in V$. DNL also applies to other metric spaces and to abstract set systems, where elements are compared pairwise with respect to (near) disjointness. In its strongest form, DNL provides an $\\varepsilon$-clustering with size exponential in $\\varepsilon^"},"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":"2504.02992","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-04-03T19:31:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96be92377939cacc9889a2df70492163f1b69ad88527e63ca6462100f572cfcb","abstract_canon_sha256":"415ad56e2fdc6e9d487610cb33b9d21481c947cd707721b26d47eb6df7a82d04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:33.580064Z","signature_b64":"kJciCX5IYjb/vlgD29MlklOrIQI7vO9QQ74OR55snWgJiEj3PRZNVZL6aHLzjjO/SG/C15j+kLajNUqEDp1eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c38962d98069f7f2021a192bdecd1d5409018b17d0385e8bf6a68dc9a11fdb7e","last_reissued_at":"2026-07-05T10:55:33.579580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:33.579580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pierre Charbit, Romain Bourneuf, St\\'ephan Thomass\\'e","submitted_at":"2025-04-03T19:31:05Z","abstract_excerpt":"In its Euclidean form, the Dense Neighborhood Lemma (DNL) asserts that if $V$ is a finite set of points of $\\mathbb{R}^N$ such that for each $v \\in V$ the ball $B(v,1)$ intersects $V$ on at least $\\delta |V|$ points, then for every $\\varepsilon >0$, the points of $V$ can be covered with $f(\\delta,\\varepsilon)$ balls $B(v,1+\\varepsilon)$ with $v \\in V$. DNL also applies to other metric spaces and to abstract set systems, where elements are compared pairwise with respect to (near) disjointness. In its strongest form, DNL provides an $\\varepsilon$-clustering with size exponential in $\\varepsilon^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02992","kind":"arxiv","version":2},"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/2504.02992/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":"2504.02992","created_at":"2026-07-05T10:55:33.579634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.02992v2","created_at":"2026-07-05T10:55:33.579634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02992","created_at":"2026-07-05T10:55:33.579634+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOEWFWMANH37","created_at":"2026-07-05T10:55:33.579634+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOEWFWMANH37EAQ2","created_at":"2026-07-05T10:55:33.579634+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOEWFWMA","created_at":"2026-07-05T10:55:33.579634+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19654","citing_title":"Hardness and Approximation for Coloring Digraphs","ref_index":242,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ","json":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ.json","graph_json":"https://pith.science/api/pith-number/YOEWFWMANH37EAQ2DEV55TI5KQ/graph.json","events_json":"https://pith.science/api/pith-number/YOEWFWMANH37EAQ2DEV55TI5KQ/events.json","paper":"https://pith.science/paper/YOEWFWMA"},"agent_actions":{"view_html":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ","download_json":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ.json","view_paper":"https://pith.science/paper/YOEWFWMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.02992&json=true","fetch_graph":"https://pith.science/api/pith-number/YOEWFWMANH37EAQ2DEV55TI5KQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YOEWFWMANH37EAQ2DEV55TI5KQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ/action/storage_attestation","attest_author":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ/action/author_attestation","sign_citation":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ/action/citation_signature","submit_replication":"https://pith.science/pith/YOEWFWMANH37EAQ2DEV55TI5KQ/action/replication_record"}},"created_at":"2026-07-05T10:55:33.579634+00:00","updated_at":"2026-07-05T10:55:33.579634+00:00"}