{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VE3M3HTX72TKEMDZU22SSDQPOL","short_pith_number":"pith:VE3M3HTX","schema_version":"1.0","canonical_sha256":"a936cd9e77fea6a23079a6b5290e0f72c2fbe5d427f886707f93d96e7d62527d","source":{"kind":"arxiv","id":"2211.14873","version":4},"attestation_state":"computed","paper":{"title":"Which $L_p$ norm is the fairest? Approximations for fair facility location across all \"$p$\"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jai Moondra, Mohit Singh, Swati Gupta","submitted_at":"2022-11-27T16:07:21Z","abstract_excerpt":"Fair facility location problems try to balance access costs to open facilities borne by different groups of people by minimizing the $L_p$ norm of these group distances. However, there is no clear choice of \"$p$\" in the current literature. We present a novel approach to address the challenge of choosing the right notion of fairness. We introduce the concept of portfolios, a set of solutions that contains an approximately optimal solution for each objective in a given class of objectives, such as $L_p$ norms. This concept opens up new possibilities for getting around the \"right\" notion of fairn"},"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":"2211.14873","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-27T16:07:21Z","cross_cats_sorted":[],"title_canon_sha256":"6319ae3f9a0f25367c088040a3c54336d3fe1054735fc3378f2ea4dc9fe0627d","abstract_canon_sha256":"f5edc465b9f89a5f4e688d344e450e14bde062a59a6219f85a36a628db97d4d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:01.512191Z","signature_b64":"XMqZh2HWCThc1k7zuk2/23HpX6Dr6LPx7flHMliScdOhrizI1KZfZawDTQTQ78AtggSBAk2AcXLwDWfIbrMoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a936cd9e77fea6a23079a6b5290e0f72c2fbe5d427f886707f93d96e7d62527d","last_reissued_at":"2026-07-05T08:34:01.511766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:01.511766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which $L_p$ norm is the fairest? Approximations for fair facility location across all \"$p$\"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jai Moondra, Mohit Singh, Swati Gupta","submitted_at":"2022-11-27T16:07:21Z","abstract_excerpt":"Fair facility location problems try to balance access costs to open facilities borne by different groups of people by minimizing the $L_p$ norm of these group distances. However, there is no clear choice of \"$p$\" in the current literature. We present a novel approach to address the challenge of choosing the right notion of fairness. We introduce the concept of portfolios, a set of solutions that contains an approximately optimal solution for each objective in a given class of objectives, such as $L_p$ norms. This concept opens up new possibilities for getting around the \"right\" notion of fairn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14873","kind":"arxiv","version":4},"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/2211.14873/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":"2211.14873","created_at":"2026-07-05T08:34:01.511825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14873v4","created_at":"2026-07-05T08:34:01.511825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14873","created_at":"2026-07-05T08:34:01.511825+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE3M3HTX72TK","created_at":"2026-07-05T08:34:01.511825+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE3M3HTX72TKEMDZ","created_at":"2026-07-05T08:34:01.511825+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE3M3HTX","created_at":"2026-07-05T08:34:01.511825+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14683","citing_title":"Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL","json":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL.json","graph_json":"https://pith.science/api/pith-number/VE3M3HTX72TKEMDZU22SSDQPOL/graph.json","events_json":"https://pith.science/api/pith-number/VE3M3HTX72TKEMDZU22SSDQPOL/events.json","paper":"https://pith.science/paper/VE3M3HTX"},"agent_actions":{"view_html":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL","download_json":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL.json","view_paper":"https://pith.science/paper/VE3M3HTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14873&json=true","fetch_graph":"https://pith.science/api/pith-number/VE3M3HTX72TKEMDZU22SSDQPOL/graph.json","fetch_events":"https://pith.science/api/pith-number/VE3M3HTX72TKEMDZU22SSDQPOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL/action/storage_attestation","attest_author":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL/action/author_attestation","sign_citation":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL/action/citation_signature","submit_replication":"https://pith.science/pith/VE3M3HTX72TKEMDZU22SSDQPOL/action/replication_record"}},"created_at":"2026-07-05T08:34:01.511825+00:00","updated_at":"2026-07-05T08:34:01.511825+00:00"}