{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K6KLTMSQM6PPLWWTQJDSFEY7EG","short_pith_number":"pith:K6KLTMSQ","canonical_record":{"source":{"id":"1805.10412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-26T02:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"abae06433044548438efcc76592208b657d900addc5a9c7668b21cbcd2d960d6","abstract_canon_sha256":"7a71be717dfefab3656819c2c38eab2b5db9c5e122d990f320291fc3bf063f7b"},"schema_version":"1.0"},"canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","source":{"kind":"arxiv","id":"1805.10412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10412","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10412v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10412","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"K6KLTMSQM6PP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6KLTMSQM6PPLWWT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6KLTMSQ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K6KLTMSQM6PPLWWTQJDSFEY7EG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-26T02:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"abae06433044548438efcc76592208b657d900addc5a9c7668b21cbcd2d960d6","abstract_canon_sha256":"7a71be717dfefab3656819c2c38eab2b5db9c5e122d990f320291fc3bf063f7b"},"schema_version":"1.0"},"canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.595959Z","signature_b64":"pbJGga5WRHNAUpyN1Yp6J4gRxST1sUWRzNy6ZlPjyXyKRnnrF6u0fwfevF+FemT9ZFQuD4+u5e9CxQDm+pOEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","last_reissued_at":"2026-05-18T00:14:52.595249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.595249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10412","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJHaQsl5Vmn7fT8syJIjd9BaBAR1DhQ8eYLqi5fE29d9mVzlMPZIcEaQL+rvZut/AIKz/fu4poLI6sx7k/gFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:12:56.739705Z"},"content_sha256":"458680b25e7f24e73cc07a48d0815774d0c8cb2922f16eeb56081a8ace8bd507","schema_version":"1.0","event_id":"sha256:458680b25e7f24e73cc07a48d0815774d0c8cb2922f16eeb56081a8ace8bd507"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K6KLTMSQM6PPLWWTQJDSFEY7EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Advance Admission Scheduling for Services with Customer Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Bank, Van-Anh Truong, Xinshang Wang","submitted_at":"2018-05-26T02:11:27Z","abstract_excerpt":"We study web and mobile applications that are used to schedule advance service, from medical appointments to restaurant reservations. We model them as online weighted bipartite matching problems with non-stationary arrivals. We propose new algorithms with performance guarantees for this class of problems. Specifically, we show that the expected performance of our algorithms is bounded below by $1-\\sqrt{\\frac{2}{\\pi}}\\frac{1}{\\sqrt{k}}+O(\\frac{1}{k})$ times that of an optimal offline algorithm, which knows all future information upfront, where $k$ is the minimum capacity of a resource. This is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10412","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfyPvIJCc6l82PwsbXrCo0AEyTTwdlw66GdRnEywKQlGCOdiQ364L1X4bhsYk9AjOgnK/DuYeoEdFACkD1XPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:12:56.740371Z"},"content_sha256":"fa8f2c73273f14ed2d4750058d693e52ef8dfb9b5c9874d6432538ce5a141f18","schema_version":"1.0","event_id":"sha256:fa8f2c73273f14ed2d4750058d693e52ef8dfb9b5c9874d6432538ce5a141f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/bundle.json","state_url":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/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-26T12:12:56Z","links":{"resolver":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG","bundle":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/bundle.json","state":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K6KLTMSQM6PPLWWTQJDSFEY7EG","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":"7a71be717dfefab3656819c2c38eab2b5db9c5e122d990f320291fc3bf063f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-26T02:11:27Z","title_canon_sha256":"abae06433044548438efcc76592208b657d900addc5a9c7668b21cbcd2d960d6"},"schema_version":"1.0","source":{"id":"1805.10412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10412","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10412v1","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10412","created_at":"2026-05-18T00:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"K6KLTMSQM6PP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6KLTMSQM6PPLWWT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6KLTMSQ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:fa8f2c73273f14ed2d4750058d693e52ef8dfb9b5c9874d6432538ce5a141f18","target":"graph","created_at":"2026-05-18T00:14:52Z","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 web and mobile applications that are used to schedule advance service, from medical appointments to restaurant reservations. We model them as online weighted bipartite matching problems with non-stationary arrivals. We propose new algorithms with performance guarantees for this class of problems. Specifically, we show that the expected performance of our algorithms is bounded below by $1-\\sqrt{\\frac{2}{\\pi}}\\frac{1}{\\sqrt{k}}+O(\\frac{1}{k})$ times that of an optimal offline algorithm, which knows all future information upfront, where $k$ is the minimum capacity of a resource. This is ","authors_text":"David Bank, Van-Anh Truong, Xinshang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-26T02:11:27Z","title":"Online Advance Admission Scheduling for Services with Customer Preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10412","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:458680b25e7f24e73cc07a48d0815774d0c8cb2922f16eeb56081a8ace8bd507","target":"record","created_at":"2026-05-18T00:14:52Z","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":"7a71be717dfefab3656819c2c38eab2b5db9c5e122d990f320291fc3bf063f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-26T02:11:27Z","title_canon_sha256":"abae06433044548438efcc76592208b657d900addc5a9c7668b21cbcd2d960d6"},"schema_version":"1.0","source":{"id":"1805.10412","kind":"arxiv","version":1}},"canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","first_computed_at":"2026-05-18T00:14:52.595249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:52.595249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pbJGga5WRHNAUpyN1Yp6J4gRxST1sUWRzNy6ZlPjyXyKRnnrF6u0fwfevF+FemT9ZFQuD4+u5e9CxQDm+pOEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:52.595959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:458680b25e7f24e73cc07a48d0815774d0c8cb2922f16eeb56081a8ace8bd507","sha256:fa8f2c73273f14ed2d4750058d693e52ef8dfb9b5c9874d6432538ce5a141f18"],"state_sha256":"53c3e2036e128ff023ece28a39540690fac66ba3cbb860325f3748a9c9775b23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSLzXMcBEDRTzHBOXSASvy0h3xDJTLwJZylWqZaszK2ciBVGolUXyGBzg5GBB2ulWGqZtvZh6IouzLL9wgOxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:12:56.743170Z","bundle_sha256":"5050d606ca5bee545081e91c91c0de7c0294f0c0adb5e36bd0138819dd8ba1f6"}}