{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TSU62LDQ5SVLP7WKZQP3NBS6EX","short_pith_number":"pith:TSU62LDQ","schema_version":"1.0","canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","source":{"kind":"arxiv","id":"2602.03687","version":2},"attestation_state":"computed","paper":{"title":"Fair and Efficient Investment in Public Transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Edith Elkind, Kassian K\\\"ock, Martin Bullinger","submitted_at":"2026-02-03T16:06:49Z","abstract_excerpt":"We study a stylized model of infrastructure investment in public transportation. In our model, each agent travels between a pair of terminals in a network captured by a weighted graph, where edge weights represent distances. The central planner can improve the travel time along a fixed number of edges, with the goal of maximizing the utilitarian or egalitarian welfare. When there is only one agent, we provide a polynomial-time algorithm that combines Dijkstra's algorithm with a dynamic program. We then demonstrate how to use this algorithm as a subroutine to solve the problem for two agents. G"},"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.03687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-03T16:06:49Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"cd6f20dba379db845c1ccd3fc7dae8dbdbbc993cc82dd768f739a1741e041900","abstract_canon_sha256":"b7482b62835597b6563b0201213bd8bf13dd6d6c0ddd835b227635465a4876c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","last_reissued_at":"2026-07-31T01:33:14.774911Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:33:14.774911Z"},"graph_snapshot":{"paper":{"title":"Fair and Efficient Investment in Public Transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Edith Elkind, Kassian K\\\"ock, Martin Bullinger","submitted_at":"2026-02-03T16:06:49Z","abstract_excerpt":"We study a stylized model of infrastructure investment in public transportation. In our model, each agent travels between a pair of terminals in a network captured by a weighted graph, where edge weights represent distances. The central planner can improve the travel time along a fixed number of edges, with the goal of maximizing the utilitarian or egalitarian welfare. When there is only one agent, we provide a polynomial-time algorithm that combines Dijkstra's algorithm with a dynamic program. We then demonstrate how to use this algorithm as a subroutine to solve the problem for two agents. G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.03687","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.03687/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.03687","created_at":"2026-07-31T01:33:14.778046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.03687v2","created_at":"2026-07-31T01:33:14.778046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.03687","created_at":"2026-07-31T01:33:14.778046+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSU62LDQ5SVL","created_at":"2026-07-31T01:33:14.778046+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSU62LDQ5SVLP7WK","created_at":"2026-07-31T01:33:14.778046+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSU62LDQ","created_at":"2026-07-31T01:33:14.778046+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/TSU62LDQ5SVLP7WKZQP3NBS6EX","json":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX.json","graph_json":"https://pith.science/api/pith-number/TSU62LDQ5SVLP7WKZQP3NBS6EX/graph.json","events_json":"https://pith.science/api/pith-number/TSU62LDQ5SVLP7WKZQP3NBS6EX/events.json","paper":"https://pith.science/paper/TSU62LDQ"},"agent_actions":{"view_html":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX","download_json":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX.json","view_paper":"https://pith.science/paper/TSU62LDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.03687&json=true","fetch_graph":"https://pith.science/api/pith-number/TSU62LDQ5SVLP7WKZQP3NBS6EX/graph.json","fetch_events":"https://pith.science/api/pith-number/TSU62LDQ5SVLP7WKZQP3NBS6EX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/action/storage_attestation","attest_author":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/action/author_attestation","sign_citation":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/action/citation_signature","submit_replication":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/action/replication_record"}},"created_at":"2026-07-31T01:33:14.778046+00:00","updated_at":"2026-07-31T01:33:14.778046+00:00"}