{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:R6NMPAL2NPUWSJX7IV44JDQDGK","short_pith_number":"pith:R6NMPAL2","canonical_record":{"source":{"id":"2307.07746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-07-15T08:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"cb3b348e8202eede1f9c3201b8f50bb4380d19c9beb043c271487fab7a1aac1b","abstract_canon_sha256":"8598ba95b30769e7efaf4265bc1678542a98d22061858e05f485d98b93cad43b"},"schema_version":"1.0"},"canonical_sha256":"8f9ac7817a6be96926ff4579c48e0332b3b26ab9ea18f4c77ccb15d9c9dd1379","source":{"kind":"arxiv","id":"2307.07746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07746","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07746v1","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07746","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_12","alias_value":"R6NMPAL2NPUW","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"R6NMPAL2NPUWSJX7","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"R6NMPAL2","created_at":"2026-07-05T06:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:R6NMPAL2NPUWSJX7IV44JDQDGK","target":"record","payload":{"canonical_record":{"source":{"id":"2307.07746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-07-15T08:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"cb3b348e8202eede1f9c3201b8f50bb4380d19c9beb043c271487fab7a1aac1b","abstract_canon_sha256":"8598ba95b30769e7efaf4265bc1678542a98d22061858e05f485d98b93cad43b"},"schema_version":"1.0"},"canonical_sha256":"8f9ac7817a6be96926ff4579c48e0332b3b26ab9ea18f4c77ccb15d9c9dd1379","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:15.275847Z","signature_b64":"BNNK4CD3gZuEgEaQbE/N9wR/6A9TtPjQ9NxTyQDElD1zQ/IX9XogQi17QflSqeWIRmkxQWFyXv1RBNfPv8AACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f9ac7817a6be96926ff4579c48e0332b3b26ab9ea18f4c77ccb15d9c9dd1379","last_reissued_at":"2026-07-05T06:31:15.275513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:15.275513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.07746","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-07-05T06:31:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGbGovU4GxbtwtJ5kE5oyDvOGhADHwuY3IMMv+3nUqMOKIrkmsOgJ4+IBNBOxvt/XjmA633ZvqA8xYPIWG6ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:21:16.203898Z"},"content_sha256":"18bbc0e504efb0163d28d19066080a4e83f51c6c2542c310d9c3bcb0fc36d94a","schema_version":"1.0","event_id":"sha256:18bbc0e504efb0163d28d19066080a4e83f51c6c2542c310d9c3bcb0fc36d94a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:R6NMPAL2NPUWSJX7IV44JDQDGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Queue Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Olivier Tercieux, Yeon-Koo Che","submitted_at":"2023-07-15T08:55:37Z","abstract_excerpt":"We study the optimal method for rationing scarce resources through a queue system. The designer controls agents' entry into a queue and their exit, their service priority -- or queueing discipline -- as well as their information about queue priorities, while providing them with the incentive to join the queue and, importantly, to stay in the queue, when recommended by the designer. Under a mild condition, the optimal mechanism induces agents to enter up to a certain queue length and never removes any agents from the queue; serves them according to a first-come-first-served (FCFS) rule; and pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07746","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/2307.07746/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-07-05T06:31:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRjmbDF0uGKuq5uzkPfIGqBpWY3EnvWaS96J3INQ+4xxcd+oNniyofL5N7xmTodpsWuwi9j/Ey4qH9X+TYbuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:21:16.204268Z"},"content_sha256":"4a7d15f560b2923bd77e00a6a0bd2edf787df97c0b65bc5847f2e1522cfabc33","schema_version":"1.0","event_id":"sha256:4a7d15f560b2923bd77e00a6a0bd2edf787df97c0b65bc5847f2e1522cfabc33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/bundle.json","state_url":"https://pith.science/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/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-07-12T19:21:16Z","links":{"resolver":"https://pith.science/pith/R6NMPAL2NPUWSJX7IV44JDQDGK","bundle":"https://pith.science/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/bundle.json","state":"https://pith.science/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6NMPAL2NPUWSJX7IV44JDQDGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:R6NMPAL2NPUWSJX7IV44JDQDGK","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":"8598ba95b30769e7efaf4265bc1678542a98d22061858e05f485d98b93cad43b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-07-15T08:55:37Z","title_canon_sha256":"cb3b348e8202eede1f9c3201b8f50bb4380d19c9beb043c271487fab7a1aac1b"},"schema_version":"1.0","source":{"id":"2307.07746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07746","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07746v1","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07746","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_12","alias_value":"R6NMPAL2NPUW","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"R6NMPAL2NPUWSJX7","created_at":"2026-07-05T06:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"R6NMPAL2","created_at":"2026-07-05T06:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:4a7d15f560b2923bd77e00a6a0bd2edf787df97c0b65bc5847f2e1522cfabc33","target":"graph","created_at":"2026-07-05T06:31:15Z","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/2307.07746/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the optimal method for rationing scarce resources through a queue system. The designer controls agents' entry into a queue and their exit, their service priority -- or queueing discipline -- as well as their information about queue priorities, while providing them with the incentive to join the queue and, importantly, to stay in the queue, when recommended by the designer. Under a mild condition, the optimal mechanism induces agents to enter up to a certain queue length and never removes any agents from the queue; serves them according to a first-come-first-served (FCFS) rule; and pro","authors_text":"Olivier Tercieux, Yeon-Koo Che","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-07-15T08:55:37Z","title":"Optimal Queue Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07746","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:18bbc0e504efb0163d28d19066080a4e83f51c6c2542c310d9c3bcb0fc36d94a","target":"record","created_at":"2026-07-05T06:31:15Z","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":"8598ba95b30769e7efaf4265bc1678542a98d22061858e05f485d98b93cad43b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-07-15T08:55:37Z","title_canon_sha256":"cb3b348e8202eede1f9c3201b8f50bb4380d19c9beb043c271487fab7a1aac1b"},"schema_version":"1.0","source":{"id":"2307.07746","kind":"arxiv","version":1}},"canonical_sha256":"8f9ac7817a6be96926ff4579c48e0332b3b26ab9ea18f4c77ccb15d9c9dd1379","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f9ac7817a6be96926ff4579c48e0332b3b26ab9ea18f4c77ccb15d9c9dd1379","first_computed_at":"2026-07-05T06:31:15.275513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:15.275513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BNNK4CD3gZuEgEaQbE/N9wR/6A9TtPjQ9NxTyQDElD1zQ/IX9XogQi17QflSqeWIRmkxQWFyXv1RBNfPv8AACQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:15.275847Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.07746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18bbc0e504efb0163d28d19066080a4e83f51c6c2542c310d9c3bcb0fc36d94a","sha256:4a7d15f560b2923bd77e00a6a0bd2edf787df97c0b65bc5847f2e1522cfabc33"],"state_sha256":"1f6043d6ea097886086bb7e6d1adc5174375cccf2c9da0aa6ce18b6b46a901d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPGIc9URopl+Z+nc/ibqHedk7dMmD4SoGiTzH5RHSgEa/zHiPmgsSdYk81F+JbeNMfB86oo2gl7J+wVjYe88Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T19:21:16.206475Z","bundle_sha256":"f0cf6014e281e3ac3e4a9a469b19ae1a86af6fe2e1f811f41a31d0abe0ad1dc5"}}