{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BMWH2A72ALSGRZRUP5SOZQA27F","short_pith_number":"pith:BMWH2A72","schema_version":"1.0","canonical_sha256":"0b2c7d03fa02e468e6347f64ecc01af94e62f5865ae3c7edc42681d86b495499","source":{"kind":"arxiv","id":"1804.10044","version":1},"attestation_state":"computed","paper":{"title":"Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Phani Raj Lolakapuri, Umang Bhaskar","submitted_at":"2018-04-26T13:32:14Z","abstract_excerpt":"We present polynomial-time algorithms as well as hardness results for equilibrium computation in atomic splittable routing games, for the case of general convex cost functions. These games model traffic in freight transportation, market oligopolies, data networks, and various other applications. An atomic splittable routing game is played on a network where the edges have traffic-dependent cost functions, and player strategies correspond to flows in the network. A player can thus split it's traffic arbitrarily among different paths. While many properties of equilibria in these games have been "},"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":"1804.10044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-26T13:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"884296da69fbc0579f13e10be491d8b1d265dfa0ac43905ef38909edfb14af7c","abstract_canon_sha256":"402850119af1633d4b2c56d386f5ced8c546f56e70b097148206fec3864a5dec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:25.301247Z","signature_b64":"L18sRqFP72AxNLl1aE3a0qbcm5Rpdi79mO3ptXfN21f5ucrcIStWHhCsE691PsHgRdTIey9yB/BfWBUd3kqpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2c7d03fa02e468e6347f64ecc01af94e62f5865ae3c7edc42681d86b495499","last_reissued_at":"2026-05-18T00:17:25.300498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:25.300498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Phani Raj Lolakapuri, Umang Bhaskar","submitted_at":"2018-04-26T13:32:14Z","abstract_excerpt":"We present polynomial-time algorithms as well as hardness results for equilibrium computation in atomic splittable routing games, for the case of general convex cost functions. These games model traffic in freight transportation, market oligopolies, data networks, and various other applications. An atomic splittable routing game is played on a network where the edges have traffic-dependent cost functions, and player strategies correspond to flows in the network. A player can thus split it's traffic arbitrarily among different paths. While many properties of equilibria in these games have been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10044","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":""},"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":"1804.10044","created_at":"2026-05-18T00:17:25.300630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10044v1","created_at":"2026-05-18T00:17:25.300630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10044","created_at":"2026-05-18T00:17:25.300630+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMWH2A72ALSG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMWH2A72ALSGRZRU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMWH2A72","created_at":"2026-05-18T12:32:16.446611+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/BMWH2A72ALSGRZRUP5SOZQA27F","json":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F.json","graph_json":"https://pith.science/api/pith-number/BMWH2A72ALSGRZRUP5SOZQA27F/graph.json","events_json":"https://pith.science/api/pith-number/BMWH2A72ALSGRZRUP5SOZQA27F/events.json","paper":"https://pith.science/paper/BMWH2A72"},"agent_actions":{"view_html":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F","download_json":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F.json","view_paper":"https://pith.science/paper/BMWH2A72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10044&json=true","fetch_graph":"https://pith.science/api/pith-number/BMWH2A72ALSGRZRUP5SOZQA27F/graph.json","fetch_events":"https://pith.science/api/pith-number/BMWH2A72ALSGRZRUP5SOZQA27F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F/action/storage_attestation","attest_author":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F/action/author_attestation","sign_citation":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F/action/citation_signature","submit_replication":"https://pith.science/pith/BMWH2A72ALSGRZRUP5SOZQA27F/action/replication_record"}},"created_at":"2026-05-18T00:17:25.300630+00:00","updated_at":"2026-05-18T00:17:25.300630+00:00"}