{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YAWXEXQAHVYH2IIR2DKOYIZ5QX","short_pith_number":"pith:YAWXEXQA","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"},"canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","source":{"kind":"arxiv","id":"1709.09569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09569","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09569v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09569","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"YAWXEXQAHVYH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YAWXEXQAHVYH2IIR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YAWXEXQA","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YAWXEXQAHVYH2IIR2DKOYIZ5QX","target":"record","payload":{"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"},"canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","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"},"source_kind":"arxiv","source_id":"1709.09569","source_version":1,"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-05-18T00:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKoDdJPWIfi3IUBgC7PAzJKmddtSB9TeqOK7Sw21yin6l2vYtcsdbm/StuSsO/sNJCxzOOTYIDhyIOWtvGPmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:05:53.223618Z"},"content_sha256":"807faaf8c92fbd6187cf5c77ac1b36eefc4f130ae9f2d026de53868b31c3272e","schema_version":"1.0","event_id":"sha256:807faaf8c92fbd6187cf5c77ac1b36eefc4f130ae9f2d026de53868b31c3272e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YAWXEXQAHVYH2IIR2DKOYIZ5QX","target":"graph","payload":{"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"},"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-05-18T00:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQa5XFz12+yUVpGYxTLQZCaD0CWD6Lup+ikxFTcfnvH+9xvbIT4xNjIaPhIbF83JE8/4oPy7aj5oaHh+X8WfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:05:53.224290Z"},"content_sha256":"d4b1acfd4f59b11c73f831e5bfe2a4136c7b0aa384de10f9343e4f67ae117f1f","schema_version":"1.0","event_id":"sha256:d4b1acfd4f59b11c73f831e5bfe2a4136c7b0aa384de10f9343e4f67ae117f1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/bundle.json","state_url":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/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-06-09T19:05:53Z","links":{"resolver":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX","bundle":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/bundle.json","state":"https://pith.science/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAWXEXQAHVYH2IIR2DKOYIZ5QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YAWXEXQAHVYH2IIR2DKOYIZ5QX","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":"91a3b80d8fb26010de0b1c5794ba6d4725ed324b9e158353be3c6c1b980461c5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-09-27T15:03:48Z","title_canon_sha256":"1570913e820daa736e58c024270f614c2c87cc76d11d156ff33d7c2410f697f2"},"schema_version":"1.0","source":{"id":"1709.09569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09569","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09569v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09569","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"YAWXEXQAHVYH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YAWXEXQAHVYH2IIR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YAWXEXQA","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:d4b1acfd4f59b11c73f831e5bfe2a4136c7b0aa384de10f9343e4f67ae117f1f","target":"graph","created_at":"2026-05-18T00:34:11Z","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"},"paper":{"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","authors_text":"Guni Sharon, Michael Albert, Peter Stone, Stephen Boyles, Tarun Rambha","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-09-27T15:03:48Z","title":"Traffic Optimization For a Mixture of Self-interested and Compliant Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09569","kind":"arxiv","version":1},"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:807faaf8c92fbd6187cf5c77ac1b36eefc4f130ae9f2d026de53868b31c3272e","target":"record","created_at":"2026-05-18T00:34:11Z","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":"91a3b80d8fb26010de0b1c5794ba6d4725ed324b9e158353be3c6c1b980461c5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-09-27T15:03:48Z","title_canon_sha256":"1570913e820daa736e58c024270f614c2c87cc76d11d156ff33d7c2410f697f2"},"schema_version":"1.0","source":{"id":"1709.09569","kind":"arxiv","version":1}},"canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c02d725e003d707d2111d0d4ec233d85e037c5101a38d698bdd182bfcd1ed68a","first_computed_at":"2026-05-18T00:34:11.286116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:11.286116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F20S7ClqI3yQSJfXu8f3pJd+EAGkn/5mES1QCoywiZC9zV5snmFUaXRJ2z6pKqokvCVR2pps1DE11c8+ecCYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:11.286650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:807faaf8c92fbd6187cf5c77ac1b36eefc4f130ae9f2d026de53868b31c3272e","sha256:d4b1acfd4f59b11c73f831e5bfe2a4136c7b0aa384de10f9343e4f67ae117f1f"],"state_sha256":"6b6d1362dd1dfa7610a0651d7f028c9d52ed75fab4a712dcb1834ec45d882ff9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dhrKInhp8EXQUxD69N9RNaMMILuapmLLfOoEJa9fMh7LNhXmR6lfmMEkPsBGrhqvaZOT8gOI/31o93dQ6uPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:05:53.228447Z","bundle_sha256":"fa1672a74c5fbfe067f491b23450c9dc7e245f1c3e4f21432baaab2be32c9950"}}