{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HSO73ORDNQCSY6QSD2BM5XUZ4C","short_pith_number":"pith:HSO73ORD","canonical_record":{"source":{"id":"1010.1549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-07T21:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"e5514bb219de78f442ccf3b85861ee93599a2bbd8a0d7bdc675ef667bfbc0999","abstract_canon_sha256":"214bc44014e31b10ec17a9e884f5e4cf1d706b6bb777d1350e6f79b718da03e9"},"schema_version":"1.0"},"canonical_sha256":"3c9dfdba236c052c7a121e82cede99e0bb0a069522721a9f91799d48a6148a12","source":{"kind":"arxiv","id":"1010.1549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1549","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1549v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1549","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"HSO73ORDNQCS","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HSO73ORDNQCSY6QS","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HSO73ORD","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HSO73ORDNQCSY6QSD2BM5XUZ4C","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-07T21:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"e5514bb219de78f442ccf3b85861ee93599a2bbd8a0d7bdc675ef667bfbc0999","abstract_canon_sha256":"214bc44014e31b10ec17a9e884f5e4cf1d706b6bb777d1350e6f79b718da03e9"},"schema_version":"1.0"},"canonical_sha256":"3c9dfdba236c052c7a121e82cede99e0bb0a069522721a9f91799d48a6148a12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:40.737624Z","signature_b64":"VKW6V6bvnn5YZwWPz9QNp0T0vzc0qBfxvnX3V6UZBMBvDqjV/hik4HA8RA/dm3xZcaD4UEXsmPY1MhurVrhwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c9dfdba236c052c7a121e82cede99e0bb0a069522721a9f91799d48a6148a12","last_reissued_at":"2026-05-18T04:39:40.737121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:40.737121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1549","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-05-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5twFrpfNyNJnCde9RXhe7InrUpmBaXqsqTa3CH14uECUXigtMG+yMkP/hFNgIQuayYjOtqRgYq5+1s7g0NQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:41.599774Z"},"content_sha256":"dfa82809c32ad8ccaba576ca1872725e959756e52d000f80c942caae1f398ce0","schema_version":"1.0","event_id":"sha256:dfa82809c32ad8ccaba576ca1872725e959756e52d000f80c942caae1f398ce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HSO73ORDNQCSY6QSD2BM5XUZ4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task Release Control for Decision Making Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C\\'edric Langbort, Francesco Bullo, Ruggero Carli, Vaibhav Srivastava","submitted_at":"2010-10-07T21:09:59Z","abstract_excerpt":"We consider the optimal duration allocation in a decision making queue. Decision making tasks arrive at a given rate to a human operator. The correctness of the decision made by human evolves as a sigmoidal function of the duration allocated to the task. Each task in the queue loses its value continuously. We elucidate on this trade-off and determine optimal policies for the human operator. We show the optimal policy requires the human to drop some tasks. We present a receding horizon optimization strategy, and compare it with the greedy policy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1549","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"},"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-05-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBgjwkQzHk/pJpU/iPso9Q8C6O7EdsFKCcAgRYGNRqUuVW5MqXz/wK+EEP5dkjur+fu6IpNDQrXiTwyzej8fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:41.600124Z"},"content_sha256":"a9a35e0795ce319d5bd452bca3fe28575d40b048df6b53cace0ec520dacddf96","schema_version":"1.0","event_id":"sha256:a9a35e0795ce319d5bd452bca3fe28575d40b048df6b53cace0ec520dacddf96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/bundle.json","state_url":"https://pith.science/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/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-05-30T00:30:41Z","links":{"resolver":"https://pith.science/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C","bundle":"https://pith.science/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/bundle.json","state":"https://pith.science/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSO73ORDNQCSY6QSD2BM5XUZ4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HSO73ORDNQCSY6QSD2BM5XUZ4C","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":"214bc44014e31b10ec17a9e884f5e4cf1d706b6bb777d1350e6f79b718da03e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-07T21:09:59Z","title_canon_sha256":"e5514bb219de78f442ccf3b85861ee93599a2bbd8a0d7bdc675ef667bfbc0999"},"schema_version":"1.0","source":{"id":"1010.1549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1549","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1549v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1549","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"HSO73ORDNQCS","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HSO73ORDNQCSY6QS","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HSO73ORD","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:a9a35e0795ce319d5bd452bca3fe28575d40b048df6b53cace0ec520dacddf96","target":"graph","created_at":"2026-05-18T04:39:40Z","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"},"paper":{"abstract_excerpt":"We consider the optimal duration allocation in a decision making queue. Decision making tasks arrive at a given rate to a human operator. The correctness of the decision made by human evolves as a sigmoidal function of the duration allocated to the task. Each task in the queue loses its value continuously. We elucidate on this trade-off and determine optimal policies for the human operator. We show the optimal policy requires the human to drop some tasks. We present a receding horizon optimization strategy, and compare it with the greedy policy.","authors_text":"C\\'edric Langbort, Francesco Bullo, Ruggero Carli, Vaibhav Srivastava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-07T21:09:59Z","title":"Task Release Control for Decision Making Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1549","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:dfa82809c32ad8ccaba576ca1872725e959756e52d000f80c942caae1f398ce0","target":"record","created_at":"2026-05-18T04:39:40Z","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":"214bc44014e31b10ec17a9e884f5e4cf1d706b6bb777d1350e6f79b718da03e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-07T21:09:59Z","title_canon_sha256":"e5514bb219de78f442ccf3b85861ee93599a2bbd8a0d7bdc675ef667bfbc0999"},"schema_version":"1.0","source":{"id":"1010.1549","kind":"arxiv","version":1}},"canonical_sha256":"3c9dfdba236c052c7a121e82cede99e0bb0a069522721a9f91799d48a6148a12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c9dfdba236c052c7a121e82cede99e0bb0a069522721a9f91799d48a6148a12","first_computed_at":"2026-05-18T04:39:40.737121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.737121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKW6V6bvnn5YZwWPz9QNp0T0vzc0qBfxvnX3V6UZBMBvDqjV/hik4HA8RA/dm3xZcaD4UEXsmPY1MhurVrhwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.737624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfa82809c32ad8ccaba576ca1872725e959756e52d000f80c942caae1f398ce0","sha256:a9a35e0795ce319d5bd452bca3fe28575d40b048df6b53cace0ec520dacddf96"],"state_sha256":"526304cb8a69f66b166c29fb189181f5431e77e7b3a92cbb1a754e93b41e675f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/qGoZ2ml3gTLmmcpkCRjLMz6Qtw07kX+ukIfTOxxAhJsueNsc1weLvsX8T1xm0KZWg3EqX1J43haVKeQUgcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:30:41.602437Z","bundle_sha256":"347e9dafd058c98096a9f08ff0565d206cdcf31bd89a17a3e506e5701cf0018b"}}