{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K6KLTMSQM6PPLWWTQJDSFEY7EG","short_pith_number":"pith:K6KLTMSQ","schema_version":"1.0","canonical_sha256":"5794b9b250679ef5dad3824722931f219a6c020eda5dda8cafb6d4fdf682cd07","source":{"kind":"arxiv","id":"1805.10412","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10412","created_at":"2026-05-18T00:14:52.595360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10412v1","created_at":"2026-05-18T00:14:52.595360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10412","created_at":"2026-05-18T00:14:52.595360+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6KLTMSQM6PP","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6KLTMSQM6PPLWWT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6KLTMSQ","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG","json":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG.json","graph_json":"https://pith.science/api/pith-number/K6KLTMSQM6PPLWWTQJDSFEY7EG/graph.json","events_json":"https://pith.science/api/pith-number/K6KLTMSQM6PPLWWTQJDSFEY7EG/events.json","paper":"https://pith.science/paper/K6KLTMSQ"},"agent_actions":{"view_html":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG","download_json":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG.json","view_paper":"https://pith.science/paper/K6KLTMSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10412&json=true","fetch_graph":"https://pith.science/api/pith-number/K6KLTMSQM6PPLWWTQJDSFEY7EG/graph.json","fetch_events":"https://pith.science/api/pith-number/K6KLTMSQM6PPLWWTQJDSFEY7EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/action/storage_attestation","attest_author":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/action/author_attestation","sign_citation":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/action/citation_signature","submit_replication":"https://pith.science/pith/K6KLTMSQM6PPLWWTQJDSFEY7EG/action/replication_record"}},"created_at":"2026-05-18T00:14:52.595360+00:00","updated_at":"2026-05-18T00:14:52.595360+00:00"}