{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BWX4PLYF5FNJHEIDLGSPLVOOEA","short_pith_number":"pith:BWX4PLYF","canonical_record":{"source":{"id":"1907.03219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-07T05:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"d5bf97acff6ac74a645e8b3f311a1d608d94bde3ed31ee827e1515f084db5b29","abstract_canon_sha256":"3699c572948dff4572f349eb2bbbb54ae5c580a13c815fa72a8da90eb96674df"},"schema_version":"1.0"},"canonical_sha256":"0dafc7af05e95a93910359a4f5d5ce201526d899db92d7256c73d680baa6e8d5","source":{"kind":"arxiv","id":"1907.03219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03219","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03219v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03219","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"BWX4PLYF5FNJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BWX4PLYF5FNJHEID","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BWX4PLYF","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BWX4PLYF5FNJHEIDLGSPLVOOEA","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-07T05:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"d5bf97acff6ac74a645e8b3f311a1d608d94bde3ed31ee827e1515f084db5b29","abstract_canon_sha256":"3699c572948dff4572f349eb2bbbb54ae5c580a13c815fa72a8da90eb96674df"},"schema_version":"1.0"},"canonical_sha256":"0dafc7af05e95a93910359a4f5d5ce201526d899db92d7256c73d680baa6e8d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.603266Z","signature_b64":"FTaqzIWEFvTRzGavzFp+E1E7eey7ORy6peYF4pNW8qi4JcKqCH3IyOqbUO5AzDnYeNRWYgb2XlFXR3nPXWycCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dafc7af05e95a93910359a4f5d5ce201526d899db92d7256c73d680baa6e8d5","last_reissued_at":"2026-05-17T23:41:18.602758Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.602758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03219","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MXgm4P1NQumuKqod55P04hRmvkLxWLfNbqejKhecdp/s9OH5IlOGHs+wQfNYUL9LRlwG4aLEt9sXkwA7Gi9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:41.174796Z"},"content_sha256":"f4ad25f196603e614948e1300499b0cccc3cf414afa58ecaafde33d444eb201c","schema_version":"1.0","event_id":"sha256:f4ad25f196603e614948e1300499b0cccc3cf414afa58ecaafde33d444eb201c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BWX4PLYF5FNJHEIDLGSPLVOOEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Driven Distributionally Robust Appointment Scheduling over Wasserstein Balls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanglin Xu, Minseok Ryu, Ruiwei Jiang","submitted_at":"2019-07-07T05:03:59Z","abstract_excerpt":"We study a single-server appointment scheduling problem with a fixed sequence of appointments, for which we must determine the arrival time for each appointment. We specifically examine two stochastic models. In the first model, we assume that all appointees show up at the scheduled arrival times yet their service durations are random. In the second model, we assume that appointees have random no-show behaviors and their service durations are random given that they show up at the appointments. In both models, we assume that the probability distribution of the uncertain parameters is unknown bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03219","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpAUN8rE9hKgJuI4Ot5bPCyfRDWDSqGH5Ezw619qP5RLuqeq2wBMt0U2X1dGjxFJ6GYYiZkv2GZuwrZbeNbkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:41.175467Z"},"content_sha256":"305fcd1bc2a8aecd70bf4d66ea4bcfab2d377b5a68c38409ba2d450f22d171d2","schema_version":"1.0","event_id":"sha256:305fcd1bc2a8aecd70bf4d66ea4bcfab2d377b5a68c38409ba2d450f22d171d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/bundle.json","state_url":"https://pith.science/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/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-25T19:22:41Z","links":{"resolver":"https://pith.science/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA","bundle":"https://pith.science/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/bundle.json","state":"https://pith.science/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWX4PLYF5FNJHEIDLGSPLVOOEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BWX4PLYF5FNJHEIDLGSPLVOOEA","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":"3699c572948dff4572f349eb2bbbb54ae5c580a13c815fa72a8da90eb96674df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-07T05:03:59Z","title_canon_sha256":"d5bf97acff6ac74a645e8b3f311a1d608d94bde3ed31ee827e1515f084db5b29"},"schema_version":"1.0","source":{"id":"1907.03219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03219","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03219v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03219","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"BWX4PLYF5FNJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BWX4PLYF5FNJHEID","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BWX4PLYF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:305fcd1bc2a8aecd70bf4d66ea4bcfab2d377b5a68c38409ba2d450f22d171d2","target":"graph","created_at":"2026-05-17T23:41:18Z","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 study a single-server appointment scheduling problem with a fixed sequence of appointments, for which we must determine the arrival time for each appointment. We specifically examine two stochastic models. In the first model, we assume that all appointees show up at the scheduled arrival times yet their service durations are random. In the second model, we assume that appointees have random no-show behaviors and their service durations are random given that they show up at the appointments. In both models, we assume that the probability distribution of the uncertain parameters is unknown bu","authors_text":"Guanglin Xu, Minseok Ryu, Ruiwei Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-07T05:03:59Z","title":"Data-Driven Distributionally Robust Appointment Scheduling over Wasserstein Balls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03219","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:f4ad25f196603e614948e1300499b0cccc3cf414afa58ecaafde33d444eb201c","target":"record","created_at":"2026-05-17T23:41:18Z","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":"3699c572948dff4572f349eb2bbbb54ae5c580a13c815fa72a8da90eb96674df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-07T05:03:59Z","title_canon_sha256":"d5bf97acff6ac74a645e8b3f311a1d608d94bde3ed31ee827e1515f084db5b29"},"schema_version":"1.0","source":{"id":"1907.03219","kind":"arxiv","version":1}},"canonical_sha256":"0dafc7af05e95a93910359a4f5d5ce201526d899db92d7256c73d680baa6e8d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dafc7af05e95a93910359a4f5d5ce201526d899db92d7256c73d680baa6e8d5","first_computed_at":"2026-05-17T23:41:18.602758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.602758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FTaqzIWEFvTRzGavzFp+E1E7eey7ORy6peYF4pNW8qi4JcKqCH3IyOqbUO5AzDnYeNRWYgb2XlFXR3nPXWycCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.603266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4ad25f196603e614948e1300499b0cccc3cf414afa58ecaafde33d444eb201c","sha256:305fcd1bc2a8aecd70bf4d66ea4bcfab2d377b5a68c38409ba2d450f22d171d2"],"state_sha256":"46dc438a3283634a50fba27393439eae86baa6588127b9e6b944d6992a405567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uF/yLF6bpEvkzt0/jN11kH/IqgNTp+RBiXMYEsiAo/Js9gW8z6cMq+y3Zdfp+3RA6+AlGjgWN8mjphBSgFTWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:22:41.179080Z","bundle_sha256":"68623d2febff9781dd294a2e7a7da670cff96c0f37ea704941220c3dfdbdd3eb"}}