{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J5U77DCALUIIEWEPSNGE56M3D7","short_pith_number":"pith:J5U77DCA","schema_version":"1.0","canonical_sha256":"4f69ff8c405d1082588f934c4ef99b1fcd119901c11f97212c66781096fd7569","source":{"kind":"arxiv","id":"1511.02784","version":2},"attestation_state":"computed","paper":{"title":"Totally Unimodular Congestion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Alberto Del Pia, Carla Michini, Michael Ferris","submitted_at":"2015-11-09T17:49:42Z","abstract_excerpt":"We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class.\n  In the symmetric case, when all players have the same strategy set, we design an algorithm that finds an optimal aggregated strategy and then decomposes it into the single players' strategies. This approach yields strongly polynomial-time algorithms to (i) find a pure Nash equilibrium, and (ii) compute a socially optimal state, if the "},"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":"1511.02784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-09T17:49:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ac37c478622004e320502bdafbbf23e88a491075196b0751e23ebc6a92304718","abstract_canon_sha256":"d4c1841d909cd21690a15428449e4fba42c439cfa3a771872b0895fc422e2e20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:20.226097Z","signature_b64":"5AvYtHuYRefqCIK7354JMxrdJ6jC5qjKZbUAQfWp1jLeo1jp5BIRF4pTyqV49pIWXoqyx78ZedDfFCQhZXemAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f69ff8c405d1082588f934c4ef99b1fcd119901c11f97212c66781096fd7569","last_reissued_at":"2026-05-18T01:10:20.225372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:20.225372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Totally Unimodular Congestion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Alberto Del Pia, Carla Michini, Michael Ferris","submitted_at":"2015-11-09T17:49:42Z","abstract_excerpt":"We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class.\n  In the symmetric case, when all players have the same strategy set, we design an algorithm that finds an optimal aggregated strategy and then decomposes it into the single players' strategies. This approach yields strongly polynomial-time algorithms to (i) find a pure Nash equilibrium, and (ii) compute a socially optimal state, if the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02784","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":""},"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":"1511.02784","created_at":"2026-05-18T01:10:20.225503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02784v2","created_at":"2026-05-18T01:10:20.225503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02784","created_at":"2026-05-18T01:10:20.225503+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5U77DCALUII","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5U77DCALUIIEWEP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5U77DCA","created_at":"2026-05-18T12:29:27.538025+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/J5U77DCALUIIEWEPSNGE56M3D7","json":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7.json","graph_json":"https://pith.science/api/pith-number/J5U77DCALUIIEWEPSNGE56M3D7/graph.json","events_json":"https://pith.science/api/pith-number/J5U77DCALUIIEWEPSNGE56M3D7/events.json","paper":"https://pith.science/paper/J5U77DCA"},"agent_actions":{"view_html":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7","download_json":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7.json","view_paper":"https://pith.science/paper/J5U77DCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02784&json=true","fetch_graph":"https://pith.science/api/pith-number/J5U77DCALUIIEWEPSNGE56M3D7/graph.json","fetch_events":"https://pith.science/api/pith-number/J5U77DCALUIIEWEPSNGE56M3D7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7/action/storage_attestation","attest_author":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7/action/author_attestation","sign_citation":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7/action/citation_signature","submit_replication":"https://pith.science/pith/J5U77DCALUIIEWEPSNGE56M3D7/action/replication_record"}},"created_at":"2026-05-18T01:10:20.225503+00:00","updated_at":"2026-05-18T01:10:20.225503+00:00"}