{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5U6R6XEZEVKH524LROENGAL5XA","short_pith_number":"pith:5U6R6XEZ","schema_version":"1.0","canonical_sha256":"ed3d1f5c9925547eeb8b8b88d3017db80288791c4e3a112a844d9d1150de0a39","source":{"kind":"arxiv","id":"2507.08758","version":1},"attestation_state":"computed","paper":{"title":"On Fair Epsilon Net and Geometric Hitting Set","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar, Stavros Sintos","submitted_at":"2025-07-11T17:11:54Z","abstract_excerpt":"Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be effectively tackled using concepts from computational geometry, such as $\\varepsilon$-nets. However, these powerful tools have yet to be examined from the perspective of fairness. To fill this research gap, we add fairness to classical geometric approximation problems of $\\varepsilon$-net, $\\varepsilon$-sample, and geometric hitting set. We introduce and address two notions of group fairness: demographic parity, whi"},"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":"2507.08758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-11T17:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"8b5f454d2e3d085e086b7712860484a2fd67872ce01957951d4ddf6d835261ed","abstract_canon_sha256":"f67611f8be4701cd8b9d1f4a6c70d735ce742cc251ef947807c4c20465c42883"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:46.031598Z","signature_b64":"1189SXzkaz5dMfH0Zv5EyMMVGDD9+bdi2lZ8Y396l4tJc4myfbEaRmuRc+sFd+2fa6rUishP8cf0vXOkKUF3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed3d1f5c9925547eeb8b8b88d3017db80288791c4e3a112a844d9d1150de0a39","last_reissued_at":"2026-07-05T11:35:46.031035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:46.031035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fair Epsilon Net and Geometric Hitting Set","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar, Stavros Sintos","submitted_at":"2025-07-11T17:11:54Z","abstract_excerpt":"Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be effectively tackled using concepts from computational geometry, such as $\\varepsilon$-nets. However, these powerful tools have yet to be examined from the perspective of fairness. To fill this research gap, we add fairness to classical geometric approximation problems of $\\varepsilon$-net, $\\varepsilon$-sample, and geometric hitting set. We introduce and address two notions of group fairness: demographic parity, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08758","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.08758/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":"2507.08758","created_at":"2026-07-05T11:35:46.031106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08758v1","created_at":"2026-07-05T11:35:46.031106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08758","created_at":"2026-07-05T11:35:46.031106+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U6R6XEZEVKH","created_at":"2026-07-05T11:35:46.031106+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U6R6XEZEVKH524L","created_at":"2026-07-05T11:35:46.031106+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U6R6XEZ","created_at":"2026-07-05T11:35:46.031106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA","json":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA.json","graph_json":"https://pith.science/api/pith-number/5U6R6XEZEVKH524LROENGAL5XA/graph.json","events_json":"https://pith.science/api/pith-number/5U6R6XEZEVKH524LROENGAL5XA/events.json","paper":"https://pith.science/paper/5U6R6XEZ"},"agent_actions":{"view_html":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA","download_json":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA.json","view_paper":"https://pith.science/paper/5U6R6XEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08758&json=true","fetch_graph":"https://pith.science/api/pith-number/5U6R6XEZEVKH524LROENGAL5XA/graph.json","fetch_events":"https://pith.science/api/pith-number/5U6R6XEZEVKH524LROENGAL5XA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA/action/storage_attestation","attest_author":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA/action/author_attestation","sign_citation":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA/action/citation_signature","submit_replication":"https://pith.science/pith/5U6R6XEZEVKH524LROENGAL5XA/action/replication_record"}},"created_at":"2026-07-05T11:35:46.031106+00:00","updated_at":"2026-07-05T11:35:46.031106+00:00"}