{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4P3LV343EWOWLE33G2JD5BDI6L","short_pith_number":"pith:4P3LV343","canonical_record":{"source":{"id":"2608.11710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-08-12T06:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"235a07cd0a7fe44da087966218e209b38cd347d7c066a7ab707e72aaf0e97dc8","abstract_canon_sha256":"33bcef129bb61446ddc59250995861e2f4f0c84901b7b1a74a1f855ad5615cde"},"schema_version":"1.0"},"canonical_sha256":"e3f6baef9b259d65937b36923e8468f2f2bfe6381038a5e76b6b01fc956cf400","source":{"kind":"arxiv","id":"2608.11710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11710","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11710v1","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11710","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"4P3LV343EWOW","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"4P3LV343EWOWLE33","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"4P3LV343","created_at":"2026-08-13T01:27:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4P3LV343EWOWLE33G2JD5BDI6L","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-08-12T06:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"235a07cd0a7fe44da087966218e209b38cd347d7c066a7ab707e72aaf0e97dc8","abstract_canon_sha256":"33bcef129bb61446ddc59250995861e2f4f0c84901b7b1a74a1f855ad5615cde"},"schema_version":"1.0"},"canonical_sha256":"e3f6baef9b259d65937b36923e8468f2f2bfe6381038a5e76b6b01fc956cf400","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:27:53.771261Z","signature_b64":"FzZ0J1hRv8FZqQ/Z+5LjmR7SNpCkBtP5QnlWOznb9y2K80is+tpyGWYnGuWmGHNJpuu987geOG21aVviEJSmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f6baef9b259d65937b36923e8468f2f2bfe6381038a5e76b6b01fc956cf400","last_reissued_at":"2026-08-13T01:27:53.769156Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:27:53.769156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11710","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-08-13T01:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZzINUAedUsCaPLsfhYgPagi2ZOBH9sKkz9nBcooVSRdTubVDIXvs9dr07lO+OkwMufhIfg51CBYpS+2uA00DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:44:47.112637Z"},"content_sha256":"d871293a512bc906f9fd2f9453dbec06ffae0210344e4a0d0708a21376200fa8","schema_version":"1.0","event_id":"sha256:d871293a512bc906f9fd2f9453dbec06ffae0210344e4a0d0708a21376200fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4P3LV343EWOWLE33G2JD5BDI6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Beat FCFS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Itai Ashlagi, Joseph Root","submitted_at":"2026-08-12T06:46:07Z","abstract_excerpt":"We study two observable queues with identical service rates, serving agents who arrive stochastically over time. Agents join the queue that minimizes their expected waiting time. Assuming one queue uses the ubiquitous First-Come-First-Served (FCFS) service rule, we show that by simply modifying its service order, the other queue can capture a strict majority of the demand. We establish an upper bound on the arrival share any rule can capture against FCFS. When both queues can design their service order, we show a novel variant of Last-Come-First-Served (LCFS) is an equilibrium in a low congest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11710","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.11710/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-13T01:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRT82QjvXkYdWlVYr49D0348DPXMrnKHz0gCUhSnydBgGRQYZy2mZkXVoT8quroUbztLi4dBTSTVVpfpXTeuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:44:47.113149Z"},"content_sha256":"e151db67022cb3e8627211c427a314ddc69601325b67634978633ad78479ccbc","schema_version":"1.0","event_id":"sha256:e151db67022cb3e8627211c427a314ddc69601325b67634978633ad78479ccbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4P3LV343EWOWLE33G2JD5BDI6L/bundle.json","state_url":"https://pith.science/pith/4P3LV343EWOWLE33G2JD5BDI6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4P3LV343EWOWLE33G2JD5BDI6L/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-08-19T18:44:47Z","links":{"resolver":"https://pith.science/pith/4P3LV343EWOWLE33G2JD5BDI6L","bundle":"https://pith.science/pith/4P3LV343EWOWLE33G2JD5BDI6L/bundle.json","state":"https://pith.science/pith/4P3LV343EWOWLE33G2JD5BDI6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4P3LV343EWOWLE33G2JD5BDI6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4P3LV343EWOWLE33G2JD5BDI6L","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":"33bcef129bb61446ddc59250995861e2f4f0c84901b7b1a74a1f855ad5615cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-08-12T06:46:07Z","title_canon_sha256":"235a07cd0a7fe44da087966218e209b38cd347d7c066a7ab707e72aaf0e97dc8"},"schema_version":"1.0","source":{"id":"2608.11710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11710","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11710v1","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11710","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"4P3LV343EWOW","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"4P3LV343EWOWLE33","created_at":"2026-08-13T01:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"4P3LV343","created_at":"2026-08-13T01:27:53Z"}],"graph_snapshots":[{"event_id":"sha256:e151db67022cb3e8627211c427a314ddc69601325b67634978633ad78479ccbc","target":"graph","created_at":"2026-08-13T01:27:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.11710/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study two observable queues with identical service rates, serving agents who arrive stochastically over time. Agents join the queue that minimizes their expected waiting time. Assuming one queue uses the ubiquitous First-Come-First-Served (FCFS) service rule, we show that by simply modifying its service order, the other queue can capture a strict majority of the demand. We establish an upper bound on the arrival share any rule can capture against FCFS. When both queues can design their service order, we show a novel variant of Last-Come-First-Served (LCFS) is an equilibrium in a low congest","authors_text":"Itai Ashlagi, Joseph Root","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-08-12T06:46:07Z","title":"How to Beat FCFS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11710","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:d871293a512bc906f9fd2f9453dbec06ffae0210344e4a0d0708a21376200fa8","target":"record","created_at":"2026-08-13T01:27:53Z","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":"33bcef129bb61446ddc59250995861e2f4f0c84901b7b1a74a1f855ad5615cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-08-12T06:46:07Z","title_canon_sha256":"235a07cd0a7fe44da087966218e209b38cd347d7c066a7ab707e72aaf0e97dc8"},"schema_version":"1.0","source":{"id":"2608.11710","kind":"arxiv","version":1}},"canonical_sha256":"e3f6baef9b259d65937b36923e8468f2f2bfe6381038a5e76b6b01fc956cf400","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3f6baef9b259d65937b36923e8468f2f2bfe6381038a5e76b6b01fc956cf400","first_computed_at":"2026-08-13T01:27:53.769156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T01:27:53.769156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzZ0J1hRv8FZqQ/Z+5LjmR7SNpCkBtP5QnlWOznb9y2K80is+tpyGWYnGuWmGHNJpuu987geOG21aVviEJSmAQ==","signature_status":"signed_v1","signed_at":"2026-08-13T01:27:53.771261Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d871293a512bc906f9fd2f9453dbec06ffae0210344e4a0d0708a21376200fa8","sha256:e151db67022cb3e8627211c427a314ddc69601325b67634978633ad78479ccbc"],"state_sha256":"42baab5e421cc843f45fb4d3b5b9cc2fa19012df2d29a5ff0c688380b1562634"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0U27zNIPz7EzuZ2PJ4tclTBKSw2SBGd86sD62rwJEcyKLuuye1F6C3T4liQhojmfG5kJ+Lac0xwmWsq+JYOXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:44:47.119248Z","bundle_sha256":"5b75919c7e2feaf77554d8a567175c9f154c50e38e4a51116a4f6b4159adce21"}}