{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PSSFQRUDAYGJTG2KCNVSYXA53P","short_pith_number":"pith:PSSFQRUD","schema_version":"1.0","canonical_sha256":"7ca4584683060c999b4a136b2c5c1ddbde11b3126059d34989ee9b25cfcd1367","source":{"kind":"arxiv","id":"2602.06776","version":2},"attestation_state":"computed","paper":{"title":"Fair Transit Stop Placement: A Clustering Perspective and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Jeremy Vollen, Ling Gai, Yuhang Guo","submitted_at":"2026-02-06T15:31:02Z","abstract_excerpt":"We study the transit stop placement (TrSP) problem in general metric spaces, where agents travel between source-destination pairs and may either walk directly or utilize a shuttle service via selected transit stops. We investigate fairness in TrSP through the lens of justified representation (JR) and the core, and uncover a structural correspondence with fair clustering. Specifically, we show that a constant-factor approximation to proportional fairness in clustering can be used to guarantee a constant-factor biparameterized approximation to core. We establish a lower bound of 1.366 on the app"},"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":"2602.06776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-06T15:31:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3fd3286178fd32cad2e0645b1c3222424641818314fe96a0ed13668a654b84c7","abstract_canon_sha256":"49b9eeed194c64b06ae09886c39ed2ac4fa491f28f57a6c0537bdda491e4eb4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:01.646880Z","signature_b64":"O6ZnCOWOd/GDvGwWJ19kAHhHaFkfGoaalmfKdkt1sV4bLnh7MlRrhIo68DnEl2CazR6FV/U8jplTR5TCyUhWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca4584683060c999b4a136b2c5c1ddbde11b3126059d34989ee9b25cfcd1367","last_reissued_at":"2026-06-23T01:12:01.646293Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:01.646293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Transit Stop Placement: A Clustering Perspective and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Jeremy Vollen, Ling Gai, Yuhang Guo","submitted_at":"2026-02-06T15:31:02Z","abstract_excerpt":"We study the transit stop placement (TrSP) problem in general metric spaces, where agents travel between source-destination pairs and may either walk directly or utilize a shuttle service via selected transit stops. We investigate fairness in TrSP through the lens of justified representation (JR) and the core, and uncover a structural correspondence with fair clustering. Specifically, we show that a constant-factor approximation to proportional fairness in clustering can be used to guarantee a constant-factor biparameterized approximation to core. We establish a lower bound of 1.366 on the app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06776","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/2602.06776/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":"2602.06776","created_at":"2026-06-23T01:12:01.646380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.06776v2","created_at":"2026-06-23T01:12:01.646380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06776","created_at":"2026-06-23T01:12:01.646380+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSSFQRUDAYGJ","created_at":"2026-06-23T01:12:01.646380+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSSFQRUDAYGJTG2K","created_at":"2026-06-23T01:12:01.646380+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSSFQRUD","created_at":"2026-06-23T01:12:01.646380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.07285","citing_title":"Improved Lower Bounds for Proportionally Fair Clustering","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P","json":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P.json","graph_json":"https://pith.science/api/pith-number/PSSFQRUDAYGJTG2KCNVSYXA53P/graph.json","events_json":"https://pith.science/api/pith-number/PSSFQRUDAYGJTG2KCNVSYXA53P/events.json","paper":"https://pith.science/paper/PSSFQRUD"},"agent_actions":{"view_html":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P","download_json":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P.json","view_paper":"https://pith.science/paper/PSSFQRUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.06776&json=true","fetch_graph":"https://pith.science/api/pith-number/PSSFQRUDAYGJTG2KCNVSYXA53P/graph.json","fetch_events":"https://pith.science/api/pith-number/PSSFQRUDAYGJTG2KCNVSYXA53P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P/action/storage_attestation","attest_author":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P/action/author_attestation","sign_citation":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P/action/citation_signature","submit_replication":"https://pith.science/pith/PSSFQRUDAYGJTG2KCNVSYXA53P/action/replication_record"}},"created_at":"2026-06-23T01:12:01.646380+00:00","updated_at":"2026-06-23T01:12:01.646380+00:00"}