{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7TLOUJJYOVKP5DZWIC23JUFTYZ","short_pith_number":"pith:7TLOUJJY","schema_version":"1.0","canonical_sha256":"fcd6ea25387554fe8f3640b5b4d0b3c674021251d5bc08627168fcec75081dee","source":{"kind":"arxiv","id":"1808.00034","version":3},"attestation_state":"computed","paper":{"title":"Incentives and Coordination in Bottleneck Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Babaioff, Sigal Oren","submitted_at":"2018-07-31T19:15:43Z","abstract_excerpt":"We study a variant of Vickrey's classic bottleneck model. In our model there are $n$ agents and each agent strategically chooses when to join a first-come-first-served observable queue. Agents dislike standing in line and they take actions in discrete time steps: we assume that each agent has a cost of $1$ for every time step he waits before joining the queue and a cost of $w>1$ for every time step he waits in the queue. At each time step a single agent can be processed. Before each time step, every agent observes the queue and strategically decides whether or not to join, with the goal of min"},"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":"1808.00034","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-31T19:15:43Z","cross_cats_sorted":[],"title_canon_sha256":"3c75ed4069da3118c587e988f86cfff276e86e7bc3b455e55867e56001dab086","abstract_canon_sha256":"dc0d883f48495a2b90602fa43dc8b63f017afd5ad981c097e9315b3717b23019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:55.563851Z","signature_b64":"VFn+xvYV39DSGZgE18xTy/Um1uOLLGYeSWR6BoybunCyQvruVqdAmwN2kuVG72U3CHGf+kpHPDAL+RpD51pPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd6ea25387554fe8f3640b5b4d0b3c674021251d5bc08627168fcec75081dee","last_reissued_at":"2026-05-18T00:03:55.563291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:55.563291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incentives and Coordination in Bottleneck Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Babaioff, Sigal Oren","submitted_at":"2018-07-31T19:15:43Z","abstract_excerpt":"We study a variant of Vickrey's classic bottleneck model. In our model there are $n$ agents and each agent strategically chooses when to join a first-come-first-served observable queue. Agents dislike standing in line and they take actions in discrete time steps: we assume that each agent has a cost of $1$ for every time step he waits before joining the queue and a cost of $w>1$ for every time step he waits in the queue. At each time step a single agent can be processed. Before each time step, every agent observes the queue and strategically decides whether or not to join, with the goal of min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00034","kind":"arxiv","version":3},"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":"1808.00034","created_at":"2026-05-18T00:03:55.563405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00034v3","created_at":"2026-05-18T00:03:55.563405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00034","created_at":"2026-05-18T00:03:55.563405+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TLOUJJYOVKP","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TLOUJJYOVKP5DZW","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TLOUJJY","created_at":"2026-05-18T12:32:11.075285+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/7TLOUJJYOVKP5DZWIC23JUFTYZ","json":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ.json","graph_json":"https://pith.science/api/pith-number/7TLOUJJYOVKP5DZWIC23JUFTYZ/graph.json","events_json":"https://pith.science/api/pith-number/7TLOUJJYOVKP5DZWIC23JUFTYZ/events.json","paper":"https://pith.science/paper/7TLOUJJY"},"agent_actions":{"view_html":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ","download_json":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ.json","view_paper":"https://pith.science/paper/7TLOUJJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00034&json=true","fetch_graph":"https://pith.science/api/pith-number/7TLOUJJYOVKP5DZWIC23JUFTYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7TLOUJJYOVKP5DZWIC23JUFTYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ/action/storage_attestation","attest_author":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ/action/author_attestation","sign_citation":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ/action/citation_signature","submit_replication":"https://pith.science/pith/7TLOUJJYOVKP5DZWIC23JUFTYZ/action/replication_record"}},"created_at":"2026-05-18T00:03:55.563405+00:00","updated_at":"2026-05-18T00:03:55.563405+00:00"}