{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YAWXEXQAHVYH2IIR2DKOYIZ5QX","short_pith_number":"pith:YAWXEXQA","schema_version":"1.0","canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","source":{"kind":"arxiv","id":"1709.09569","version":1},"attestation_state":"computed","paper":{"title":"Traffic Optimization For a Mixture of Self-interested and Compliant Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Guni Sharon, Michael Albert, Peter Stone, Stephen Boyles, Tarun Rambha","submitted_at":"2017-09-27T15:03:48Z","abstract_excerpt":"This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes its own utility, while the system-optimum routing agents are assigned paths with the goal of maximizing system performance. This paper considers a scenario where a centralized network manager wishes to optimize utilities over all agents, i.e., implement a system-optimum routing policy. In many real-life scenarios, however, the system manager is unable to inf"},"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":"1709.09569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-09-27T15:03:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1570913e820daa736e58c024270f614c2c87cc76d11d156ff33d7c2410f697f2","abstract_canon_sha256":"91a3b80d8fb26010de0b1c5794ba6d4725ed324b9e158353be3c6c1b980461c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:11.286650Z","signature_b64":"F20S7ClqI3yQSJfXu8f3pJd+EAGkn/5mES1QCoywiZC9zV5snmFUaXRJ2z6pKqokvCVR2pps1DE11c8+ecCYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","last_reissued_at":"2026-05-18T00:34:11.286116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:11.286116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traffic Optimization For a Mixture of Self-interested and Compliant Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Guni Sharon, Michael Albert, Peter Stone, Stephen Boyles, Tarun Rambha","submitted_at":"2017-09-27T15:03:48Z","abstract_excerpt":"This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes its own utility, while the system-optimum routing agents are assigned paths with the goal of maximizing system performance. This paper considers a scenario where a centralized network manager wishes to optimize utilities over all agents, i.e., implement a system-optimum routing policy. In many real-life scenarios, however, the system manager is unable to inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09569","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":"1709.09569","created_at":"2026-05-18T00:34:11.286191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09569v1","created_at":"2026-05-18T00:34:11.286191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09569","created_at":"2026-05-18T00:34:11.286191+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAWXEXQAHVYH","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAWXEXQAHVYH2IIR","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAWXEXQA","created_at":"2026-05-18T12:31:56.362134+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/YAWXEXQAHVYH2IIR2DKOYIZ5QX","json":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX.json","graph_json":"https://pith.science/api/pith-number/YAWXEXQAHVYH2IIR2DKOYIZ5QX/graph.json","events_json":"https://pith.science/api/pith-number/YAWXEXQAHVYH2IIR2DKOYIZ5QX/events.json","paper":"https://pith.science/paper/YAWXEXQA"},"agent_actions":{"view_html":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX","download_json":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX.json","view_paper":"https://pith.science/paper/YAWXEXQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09569&json=true","fetch_graph":"https://pith.science/api/pith-number/YAWXEXQAHVYH2IIR2DKOYIZ5QX/graph.json","fetch_events":"https://pith.science/api/pith-number/YAWXEXQAHVYH2IIR2DKOYIZ5QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/action/storage_attestation","attest_author":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/action/author_attestation","sign_citation":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/action/citation_signature","submit_replication":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/action/replication_record"}},"created_at":"2026-05-18T00:34:11.286191+00:00","updated_at":"2026-05-18T00:34:11.286191+00:00"}