{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LI3RF2NC7HWEWNAHXNBOYHCKM2","short_pith_number":"pith:LI3RF2NC","schema_version":"1.0","canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","source":{"kind":"arxiv","id":"2305.05829","version":3},"attestation_state":"computed","paper":{"title":"Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Jiashuo Jiang","submitted_at":"2023-05-10T01:22:59Z","abstract_excerpt":"The Network Revenue Management (NRM) problem is a well-known challenge in dynamic decision-making under uncertainty. In this problem, fixed resources must be allocated to serve customers over a finite horizon, while customers arrive according to a stochastic process. The typical NRM model assumes that customer arrivals are independent over time. However, in this paper, we explore a more general setting where customer arrivals over different periods can be correlated. We propose a model that assumes the existence of a system state, which determines customer arrivals for the current period. This"},"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":"2305.05829","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-10T01:22:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9056a2548f3aa37e2999172e72b2baaac265efc02cdabdf2a404cf1a7dfa26e5","abstract_canon_sha256":"1addb7d377c8022448aa669eb22c0571995435e5a2dd08047cdf5905de493284"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:23.201673Z","signature_b64":"2AqaGftnfsBlyLc25VnGNd8gYmmw0LhVgG4jq4crbfQqQt/m/bca4Tlw8uJpbNhOcJxiOi3GAHO4ao0aKIh6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","last_reissued_at":"2026-07-05T07:00:23.200587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:23.200587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Jiashuo Jiang","submitted_at":"2023-05-10T01:22:59Z","abstract_excerpt":"The Network Revenue Management (NRM) problem is a well-known challenge in dynamic decision-making under uncertainty. In this problem, fixed resources must be allocated to serve customers over a finite horizon, while customers arrive according to a stochastic process. The typical NRM model assumes that customer arrivals are independent over time. However, in this paper, we explore a more general setting where customer arrivals over different periods can be correlated. We propose a model that assumes the existence of a system state, which determines customer arrivals for the current period. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05829","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.05829/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.05829","created_at":"2026-07-05T07:00:23.201180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.05829v3","created_at":"2026-07-05T07:00:23.201180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05829","created_at":"2026-07-05T07:00:23.201180+00:00"},{"alias_kind":"pith_short_12","alias_value":"LI3RF2NC7HWE","created_at":"2026-07-05T07:00:23.201180+00:00"},{"alias_kind":"pith_short_16","alias_value":"LI3RF2NC7HWEWNAH","created_at":"2026-07-05T07:00:23.201180+00:00"},{"alias_kind":"pith_short_8","alias_value":"LI3RF2NC","created_at":"2026-07-05T07:00:23.201180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14812","citing_title":"A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2","json":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2.json","graph_json":"https://pith.science/api/pith-number/LI3RF2NC7HWEWNAHXNBOYHCKM2/graph.json","events_json":"https://pith.science/api/pith-number/LI3RF2NC7HWEWNAHXNBOYHCKM2/events.json","paper":"https://pith.science/paper/LI3RF2NC"},"agent_actions":{"view_html":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2","download_json":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2.json","view_paper":"https://pith.science/paper/LI3RF2NC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.05829&json=true","fetch_graph":"https://pith.science/api/pith-number/LI3RF2NC7HWEWNAHXNBOYHCKM2/graph.json","fetch_events":"https://pith.science/api/pith-number/LI3RF2NC7HWEWNAHXNBOYHCKM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/action/storage_attestation","attest_author":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/action/author_attestation","sign_citation":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/action/citation_signature","submit_replication":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/action/replication_record"}},"created_at":"2026-07-05T07:00:23.201180+00:00","updated_at":"2026-07-05T07:00:23.201180+00:00"}