{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BSXVFEKYTNPOMJZR2FNEJ4VZ5E","short_pith_number":"pith:BSXVFEKY","schema_version":"1.0","canonical_sha256":"0caf5291589b5ee62731d15a44f2b9e92b46e8ff6cfb843a26e2923bf9cf8e29","source":{"kind":"arxiv","id":"1805.05554","version":1},"attestation_state":"computed","paper":{"title":"Advance Service Reservations with Heterogeneous Customers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Clifford Stein, Van-Anh Truong, Xinshang Wang","submitted_at":"2018-05-15T04:32:03Z","abstract_excerpt":"We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic processes. Each customer requires a specific amount of capacity and has a specific preference for each of the resources, with some resources being feasible for the customer and some not. The system must find a feasible assignment of each customer to a resource or must reject the customer. The aim is to maximize the total expected capacity utilization of the res"},"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.05554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-15T04:32:03Z","cross_cats_sorted":[],"title_canon_sha256":"6b0e4d99bb20fd22716bcc05f64e0e292fd53cf7d6573a7008876a12f0caaa3b","abstract_canon_sha256":"b23c9232b7b4ab822c5d273b850eab37e2f1be598ad79be3f569d467a41c5eb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:00.233407Z","signature_b64":"ut6ZFrgkOjqemkVjzgi2U2iRkjlIDPYMDbI1O/3xTVCycb/zlLH+kHexnz9yaDvtultrnWIsEMc+ecvzJxShAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0caf5291589b5ee62731d15a44f2b9e92b46e8ff6cfb843a26e2923bf9cf8e29","last_reissued_at":"2026-05-18T00:16:00.232951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:00.232951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advance Service Reservations with Heterogeneous Customers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Clifford Stein, Van-Anh Truong, Xinshang Wang","submitted_at":"2018-05-15T04:32:03Z","abstract_excerpt":"We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic processes. Each customer requires a specific amount of capacity and has a specific preference for each of the resources, with some resources being feasible for the customer and some not. The system must find a feasible assignment of each customer to a resource or must reject the customer. The aim is to maximize the total expected capacity utilization of the res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05554","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.05554","created_at":"2026-05-18T00:16:00.233022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05554v1","created_at":"2026-05-18T00:16:00.233022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05554","created_at":"2026-05-18T00:16:00.233022+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSXVFEKYTNPO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSXVFEKYTNPOMJZR","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSXVFEKY","created_at":"2026-05-18T12:32:16.446611+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/BSXVFEKYTNPOMJZR2FNEJ4VZ5E","json":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E.json","graph_json":"https://pith.science/api/pith-number/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/graph.json","events_json":"https://pith.science/api/pith-number/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/events.json","paper":"https://pith.science/paper/BSXVFEKY"},"agent_actions":{"view_html":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E","download_json":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E.json","view_paper":"https://pith.science/paper/BSXVFEKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05554&json=true","fetch_graph":"https://pith.science/api/pith-number/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/graph.json","fetch_events":"https://pith.science/api/pith-number/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/action/storage_attestation","attest_author":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/action/author_attestation","sign_citation":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/action/citation_signature","submit_replication":"https://pith.science/pith/BSXVFEKYTNPOMJZR2FNEJ4VZ5E/action/replication_record"}},"created_at":"2026-05-18T00:16:00.233022+00:00","updated_at":"2026-05-18T00:16:00.233022+00:00"}