{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TSU62LDQ5SVLP7WKZQP3NBS6EX","short_pith_number":"pith:TSU62LDQ","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"},"canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","source":{"kind":"arxiv","id":"2602.03687","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.03687","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"2602.03687v2","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.03687","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"TSU62LDQ5SVL","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_16","alias_value":"TSU62LDQ5SVLP7WK","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_8","alias_value":"TSU62LDQ","created_at":"2026-07-31T01:33:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TSU62LDQ5SVLP7WKZQP3NBS6EX","target":"record","payload":{"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"},"canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","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"},"source_kind":"arxiv","source_id":"2602.03687","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyZq1by7vxLeRwYliwbUla6TqBncHuplYiJ6sEqInVWhj/OB/N1gX2M6N7tn5saOO7NWWuplMZizsFeVaNfEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:34:45.907005Z"},"content_sha256":"2875d800051a55bfe546fd2584c376b73fb6372f706b6540afccbe03fcf4a8b3","schema_version":"1.0","event_id":"sha256:2875d800051a55bfe546fd2584c376b73fb6372f706b6540afccbe03fcf4a8b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TSU62LDQ5SVLP7WKZQP3NBS6EX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldp7FFbgxMuczLNM8fLx4hPHKvEiwLpfk/BhJmzoT7nEBH2VNDM5q+BROAPX2Fwexnt4wFntlfqqzqf5d2ZwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:34:45.907534Z"},"content_sha256":"3217eee36eb1cb5daf0b2ff4dd89f6d3714d08aeaf194b249637d507d55c3e99","schema_version":"1.0","event_id":"sha256:3217eee36eb1cb5daf0b2ff4dd89f6d3714d08aeaf194b249637d507d55c3e99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/bundle.json","state_url":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T01:34:45Z","links":{"resolver":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX","bundle":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/bundle.json","state":"https://pith.science/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSU62LDQ5SVLP7WKZQP3NBS6EX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TSU62LDQ5SVLP7WKZQP3NBS6EX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b7482b62835597b6563b0201213bd8bf13dd6d6c0ddd835b227635465a4876c3","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-03T16:06:49Z","title_canon_sha256":"cd6f20dba379db845c1ccd3fc7dae8dbdbbc993cc82dd768f739a1741e041900"},"schema_version":"1.0","source":{"id":"2602.03687","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.03687","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"2602.03687v2","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.03687","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"TSU62LDQ5SVL","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_16","alias_value":"TSU62LDQ5SVLP7WK","created_at":"2026-07-31T01:33:14Z"},{"alias_kind":"pith_short_8","alias_value":"TSU62LDQ","created_at":"2026-07-31T01:33:14Z"}],"graph_snapshots":[{"event_id":"sha256:3217eee36eb1cb5daf0b2ff4dd89f6d3714d08aeaf194b249637d507d55c3e99","target":"graph","created_at":"2026-07-31T01:33:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.03687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Edith Elkind, Kassian K\\\"ock, Martin Bullinger","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-03T16:06:49Z","title":"Fair and Efficient Investment in Public Transportation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.03687","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2875d800051a55bfe546fd2584c376b73fb6372f706b6540afccbe03fcf4a8b3","target":"record","created_at":"2026-07-31T01:33:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b7482b62835597b6563b0201213bd8bf13dd6d6c0ddd835b227635465a4876c3","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-03T16:06:49Z","title_canon_sha256":"cd6f20dba379db845c1ccd3fc7dae8dbdbbc993cc82dd768f739a1741e041900"},"schema_version":"1.0","source":{"id":"2602.03687","kind":"arxiv","version":2}},"canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ca9ed2c70ecaab7fecacc1fb6865e25d4eeacf9c0cf4b92275a3f353f7c0c7a","first_computed_at":"2026-07-31T01:33:14.774911Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:33:14.774911Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2602.03687","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2875d800051a55bfe546fd2584c376b73fb6372f706b6540afccbe03fcf4a8b3","sha256:3217eee36eb1cb5daf0b2ff4dd89f6d3714d08aeaf194b249637d507d55c3e99"],"state_sha256":"13d306724eee00642e62ab1ccafdc5bca7c115ee5d7bf3c048327f52e1c6f7b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6YGCjM5wpAM2rmazHTlBkfTBkmQWuacCPCuhNACWEa9LY3879BFHQ8pXd7myuk01IPUL3iqGQmAwM8BA7yhgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:34:45.911748Z","bundle_sha256":"d0eaab47c66a7e47c5931cec8549b779f806768601e1ce47dc188348bc99fd81"}}