{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q3YO23USYGQFHCMEP6SXNZGIVV","short_pith_number":"pith:Q3YO23US","schema_version":"1.0","canonical_sha256":"86f0ed6e92c1a05389847fa576e4c8ad45aefa2f009c4bec70ddd055d65bdea4","source":{"kind":"arxiv","id":"1502.04019","version":2},"attestation_state":"computed","paper":{"title":"Inducing Approximately Optimal Flow Using Truthful Mediators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aaron Roth, Jonathan Ullman, Ryan Rogers, Zhiwei Steven Wu","submitted_at":"2015-02-13T15:01:15Z","abstract_excerpt":"We revisit a classic coordination problem from the perspective of mechanism design: how can we coordinate a social welfare maximizing flow in a network congestion game with selfish players? The classical approach, which computes tolls as a function of known demands, fails when the demands are unknown to the mechanism designer, and naively eliciting them does not necessarily yield a truthful mechanism. Instead, we introduce a weak mediator that can provide suggested routes to players and set tolls as a function of reported demands. However, players can choose to ignore or misreport their type t"},"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":"1502.04019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-13T15:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"2b65aca43cea2da5467d0ef8fdd21c2f8a56d0ca3305be1f051635057d5d05cf","abstract_canon_sha256":"3cc1fa70f7f8b7daaefffde17a846eb1b046088219787920f785d96adb3c0c63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:38.994438Z","signature_b64":"V7FCXQM5/3J8ilgwU7naF11Lt1tV0lydFjTxUCdURClradrhJyY/N9Qq/vjTIt33wz228yQW228Z89g9XrP8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86f0ed6e92c1a05389847fa576e4c8ad45aefa2f009c4bec70ddd055d65bdea4","last_reissued_at":"2026-05-18T02:16:38.993795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:38.993795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inducing Approximately Optimal Flow Using Truthful Mediators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aaron Roth, Jonathan Ullman, Ryan Rogers, Zhiwei Steven Wu","submitted_at":"2015-02-13T15:01:15Z","abstract_excerpt":"We revisit a classic coordination problem from the perspective of mechanism design: how can we coordinate a social welfare maximizing flow in a network congestion game with selfish players? The classical approach, which computes tolls as a function of known demands, fails when the demands are unknown to the mechanism designer, and naively eliciting them does not necessarily yield a truthful mechanism. Instead, we introduce a weak mediator that can provide suggested routes to players and set tolls as a function of reported demands. However, players can choose to ignore or misreport their type t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04019","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":"1502.04019","created_at":"2026-05-18T02:16:38.993892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04019v2","created_at":"2026-05-18T02:16:38.993892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04019","created_at":"2026-05-18T02:16:38.993892+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3YO23USYGQF","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3YO23USYGQFHCME","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3YO23US","created_at":"2026-05-18T12:29:37.295048+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/Q3YO23USYGQFHCMEP6SXNZGIVV","json":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV.json","graph_json":"https://pith.science/api/pith-number/Q3YO23USYGQFHCMEP6SXNZGIVV/graph.json","events_json":"https://pith.science/api/pith-number/Q3YO23USYGQFHCMEP6SXNZGIVV/events.json","paper":"https://pith.science/paper/Q3YO23US"},"agent_actions":{"view_html":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV","download_json":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV.json","view_paper":"https://pith.science/paper/Q3YO23US","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04019&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3YO23USYGQFHCMEP6SXNZGIVV/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3YO23USYGQFHCMEP6SXNZGIVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV/action/storage_attestation","attest_author":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV/action/author_attestation","sign_citation":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV/action/citation_signature","submit_replication":"https://pith.science/pith/Q3YO23USYGQFHCMEP6SXNZGIVV/action/replication_record"}},"created_at":"2026-05-18T02:16:38.993892+00:00","updated_at":"2026-05-18T02:16:38.993892+00:00"}