{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NLFMGX6SWQGUGLTUEWY7YCE2J2","short_pith_number":"pith:NLFMGX6S","canonical_record":{"source":{"id":"1708.05920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-20T01:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"c4925836968183eff8e7683c16e50127a68237192fee0d308708e24d8998c623","abstract_canon_sha256":"b20dafdc0257bbec9b2bc473b71b14aeec1e733f54a89cbb2c976f8c38a8de07"},"schema_version":"1.0"},"canonical_sha256":"6acac35fd2b40d432e7425b1fc089a4e8bf504bd9ede617980bbd7cffc92a62e","source":{"kind":"arxiv","id":"1708.05920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05920","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05920v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05920","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"NLFMGX6SWQGU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLFMGX6SWQGUGLTU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLFMGX6S","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NLFMGX6SWQGUGLTUEWY7YCE2J2","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-20T01:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"c4925836968183eff8e7683c16e50127a68237192fee0d308708e24d8998c623","abstract_canon_sha256":"b20dafdc0257bbec9b2bc473b71b14aeec1e733f54a89cbb2c976f8c38a8de07"},"schema_version":"1.0"},"canonical_sha256":"6acac35fd2b40d432e7425b1fc089a4e8bf504bd9ede617980bbd7cffc92a62e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.795489Z","signature_b64":"aMT3vCTry94NaNLn86TOxACY8ZpVuAacUn/tUk9kSQBn4MMfW/ieg6OpBs5+7NNaSczzZYXUy1cJvHlxW40rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6acac35fd2b40d432e7425b1fc089a4e8bf504bd9ede617980bbd7cffc92a62e","last_reissued_at":"2026-05-18T00:37:43.794937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.794937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05920","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-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKP59YtmFUAXyVUh4AbqmuYUa7gIMCA1Y+6L+IrLX8vyUPCveDtf/SJ4gvtZHKpIxLXT2U+ti0Dz6/cuC1CvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:38:04.364694Z"},"content_sha256":"f9aaafe574b6dc3f4a216c8e0450057c913be48dd1e318feafeea8a2a257e699","schema_version":"1.0","event_id":"sha256:f9aaafe574b6dc3f4a216c8e0450057c913be48dd1e318feafeea8a2a257e699"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NLFMGX6SWQGUGLTUEWY7YCE2J2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically optimal appointment schedules with customer no-shows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Harsha Honnappa, Mor Armony, Rami Atar","submitted_at":"2017-08-20T01:43:01Z","abstract_excerpt":"We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows, to minimize the sum of customer waiting time and server overtime costs. Since appointments need to be scheduled ahead of time we refer to this problem as an optimization problem rather than a dynamic control one. We study this optimization problem in fluid and diffusion scales and identify asymptotically optimal schedules in both scales. In fluid scale, we show that it is optimal to schedule appointments so that the system is in critical load; thus heavy-traffic con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05920","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-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBysoiWQk+i7VedIe1h0ZmEFziwL531/Y1SWQnFDAdqZ10K2sIWuFp+P8F+VpMtj3u9WyZmKAc/lGJgch/BvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:38:04.365039Z"},"content_sha256":"a1bd92c094ee5588181d0d923c4bbfd4790af1de95c5cf1f5334692068cd450e","schema_version":"1.0","event_id":"sha256:a1bd92c094ee5588181d0d923c4bbfd4790af1de95c5cf1f5334692068cd450e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/bundle.json","state_url":"https://pith.science/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/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-06-03T05:38:04Z","links":{"resolver":"https://pith.science/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2","bundle":"https://pith.science/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/bundle.json","state":"https://pith.science/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLFMGX6SWQGUGLTUEWY7YCE2J2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NLFMGX6SWQGUGLTUEWY7YCE2J2","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":"b20dafdc0257bbec9b2bc473b71b14aeec1e733f54a89cbb2c976f8c38a8de07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-20T01:43:01Z","title_canon_sha256":"c4925836968183eff8e7683c16e50127a68237192fee0d308708e24d8998c623"},"schema_version":"1.0","source":{"id":"1708.05920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05920","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05920v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05920","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"NLFMGX6SWQGU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLFMGX6SWQGUGLTU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLFMGX6S","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a1bd92c094ee5588181d0d923c4bbfd4790af1de95c5cf1f5334692068cd450e","target":"graph","created_at":"2026-05-18T00:37:43Z","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 problem of scheduling appointments for a finite customer population to a service facility with customer no-shows, to minimize the sum of customer waiting time and server overtime costs. Since appointments need to be scheduled ahead of time we refer to this problem as an optimization problem rather than a dynamic control one. We study this optimization problem in fluid and diffusion scales and identify asymptotically optimal schedules in both scales. In fluid scale, we show that it is optimal to schedule appointments so that the system is in critical load; thus heavy-traffic con","authors_text":"Harsha Honnappa, Mor Armony, Rami Atar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-20T01:43:01Z","title":"Asymptotically optimal appointment schedules with customer no-shows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05920","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:f9aaafe574b6dc3f4a216c8e0450057c913be48dd1e318feafeea8a2a257e699","target":"record","created_at":"2026-05-18T00:37:43Z","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":"b20dafdc0257bbec9b2bc473b71b14aeec1e733f54a89cbb2c976f8c38a8de07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-20T01:43:01Z","title_canon_sha256":"c4925836968183eff8e7683c16e50127a68237192fee0d308708e24d8998c623"},"schema_version":"1.0","source":{"id":"1708.05920","kind":"arxiv","version":1}},"canonical_sha256":"6acac35fd2b40d432e7425b1fc089a4e8bf504bd9ede617980bbd7cffc92a62e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6acac35fd2b40d432e7425b1fc089a4e8bf504bd9ede617980bbd7cffc92a62e","first_computed_at":"2026-05-18T00:37:43.794937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.794937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aMT3vCTry94NaNLn86TOxACY8ZpVuAacUn/tUk9kSQBn4MMfW/ieg6OpBs5+7NNaSczzZYXUy1cJvHlxW40rDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.795489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9aaafe574b6dc3f4a216c8e0450057c913be48dd1e318feafeea8a2a257e699","sha256:a1bd92c094ee5588181d0d923c4bbfd4790af1de95c5cf1f5334692068cd450e"],"state_sha256":"88417a8ecabdf77217798fd87ab843e9a7b0cc905acf81e97d9cf2c6d6dd410b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiC0PxEyLIMf6HbGM9z+e3xF/SK4N9YLKVfKPk2ILWZQpY874sW7OhxVMZS6K5pbNiNen8etkDIdJpPz+mb3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:38:04.367001Z","bundle_sha256":"399bab331fc7478c7d58f8a13df18c167e468727c7b2c93dc47ea12180445a60"}}