{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5S4J7FJESSJG42IY5D5POX6TK6","short_pith_number":"pith:5S4J7FJE","schema_version":"1.0","canonical_sha256":"ecb89f952494926e6918e8faf75fd357a4b3ee216fe97d0fe2f9184cdf7ba4b3","source":{"kind":"arxiv","id":"1210.4848","version":1},"attestation_state":"computed","paper":{"title":"Uncertain Congestion Games with Assorted Human Agent Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Asrar Ahmed, Pradeep Varakantham, Shih-Fen Cheng","submitted_at":"2012-10-16T17:35:13Z","abstract_excerpt":"Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, mo"},"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":"1210.4848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-10-16T17:35:13Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"5df014a5e4e34022886d0f463b1f5eb876864f05d0ff08e8b861563bb4b9141c","abstract_canon_sha256":"b8d4cca8f78b01aa219c4c1e6f03319a5400141c6ab76cae27d986a2fcae3bc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.507268Z","signature_b64":"Lhk6tDEuVIdn6VEMEzuUiOp4Df3ngWhEU0gpiJzpfHlnJg5sS9r6S+rlz4WA1U5iDLXS9jPhcOJ/wVhjH7kSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb89f952494926e6918e8faf75fd357a4b3ee216fe97d0fe2f9184cdf7ba4b3","last_reissued_at":"2026-05-18T03:42:55.506611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.506611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertain Congestion Games with Assorted Human Agent Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Asrar Ahmed, Pradeep Varakantham, Shih-Fen Cheng","submitted_at":"2012-10-16T17:35:13Z","abstract_excerpt":"Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4848","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":"1210.4848","created_at":"2026-05-18T03:42:55.506728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4848v1","created_at":"2026-05-18T03:42:55.506728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4848","created_at":"2026-05-18T03:42:55.506728+00:00"},{"alias_kind":"pith_short_12","alias_value":"5S4J7FJESSJG","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5S4J7FJESSJG42IY","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5S4J7FJE","created_at":"2026-05-18T12:26:56.085431+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/5S4J7FJESSJG42IY5D5POX6TK6","json":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6.json","graph_json":"https://pith.science/api/pith-number/5S4J7FJESSJG42IY5D5POX6TK6/graph.json","events_json":"https://pith.science/api/pith-number/5S4J7FJESSJG42IY5D5POX6TK6/events.json","paper":"https://pith.science/paper/5S4J7FJE"},"agent_actions":{"view_html":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6","download_json":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6.json","view_paper":"https://pith.science/paper/5S4J7FJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4848&json=true","fetch_graph":"https://pith.science/api/pith-number/5S4J7FJESSJG42IY5D5POX6TK6/graph.json","fetch_events":"https://pith.science/api/pith-number/5S4J7FJESSJG42IY5D5POX6TK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6/action/storage_attestation","attest_author":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6/action/author_attestation","sign_citation":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6/action/citation_signature","submit_replication":"https://pith.science/pith/5S4J7FJESSJG42IY5D5POX6TK6/action/replication_record"}},"created_at":"2026-05-18T03:42:55.506728+00:00","updated_at":"2026-05-18T03:42:55.506728+00:00"}