{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NK2SBI75HLA6X4G6TXCVCASSKW","short_pith_number":"pith:NK2SBI75","schema_version":"1.0","canonical_sha256":"6ab520a3fd3ac1ebf0de9dc5510252558384d355d802089e5a93c2ccb5a166cc","source":{"kind":"arxiv","id":"2011.06327","version":4},"attestation_state":"computed","paper":{"title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rui Sun, Xinshang Wang, Zijie Zhou","submitted_at":"2020-11-12T11:50:06Z","abstract_excerpt":"We study the canonical quantity-based network revenue management (NRM) problem where the decision-maker must irrevocably accept or reject each arriving customer request with the goal of maximizing the total revenue given limited resources. The exact solution to the problem by dynamic programming is computationally intractable due to the well-known curse of dimensionality. Existing works in the literature make use of the solution to the deterministic linear program (DLP) to design asymptotically optimal algorithms. Those algorithms rely on repeatedly solving DLPs to achieve near-optimal regret "},"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":"2011.06327","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-12T11:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"cbed050e4eefa78da2f352426d16d8cf125536b45c948060ce7cebfffb3d35bb","abstract_canon_sha256":"33f04f2cc18bec298f44c551e9563a96eb3325545f5a476c1245f5cdbab35030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:09.753542Z","signature_b64":"JoWpRXPwkzcIYT+dTS2txkEzN9hr1YY916QFpx7SlyWOaf4rqAqmCTL7yY39Nv1TY2vynSE7agq+G0g4HK6ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab520a3fd3ac1ebf0de9dc5510252558384d355d802089e5a93c2ccb5a166cc","last_reissued_at":"2026-07-05T04:38:09.753201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:09.753201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rui Sun, Xinshang Wang, Zijie Zhou","submitted_at":"2020-11-12T11:50:06Z","abstract_excerpt":"We study the canonical quantity-based network revenue management (NRM) problem where the decision-maker must irrevocably accept or reject each arriving customer request with the goal of maximizing the total revenue given limited resources. The exact solution to the problem by dynamic programming is computationally intractable due to the well-known curse of dimensionality. Existing works in the literature make use of the solution to the deterministic linear program (DLP) to design asymptotically optimal algorithms. Those algorithms rely on repeatedly solving DLPs to achieve near-optimal regret "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06327","kind":"arxiv","version":4},"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/2011.06327/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":"2011.06327","created_at":"2026-07-05T04:38:09.753255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06327v4","created_at":"2026-07-05T04:38:09.753255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06327","created_at":"2026-07-05T04:38:09.753255+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK2SBI75HLA6","created_at":"2026-07-05T04:38:09.753255+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK2SBI75HLA6X4G6","created_at":"2026-07-05T04:38:09.753255+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK2SBI75","created_at":"2026-07-05T04:38:09.753255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06113","citing_title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06113","citing_title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW","json":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW.json","graph_json":"https://pith.science/api/pith-number/NK2SBI75HLA6X4G6TXCVCASSKW/graph.json","events_json":"https://pith.science/api/pith-number/NK2SBI75HLA6X4G6TXCVCASSKW/events.json","paper":"https://pith.science/paper/NK2SBI75"},"agent_actions":{"view_html":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW","download_json":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW.json","view_paper":"https://pith.science/paper/NK2SBI75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06327&json=true","fetch_graph":"https://pith.science/api/pith-number/NK2SBI75HLA6X4G6TXCVCASSKW/graph.json","fetch_events":"https://pith.science/api/pith-number/NK2SBI75HLA6X4G6TXCVCASSKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW/action/storage_attestation","attest_author":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW/action/author_attestation","sign_citation":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW/action/citation_signature","submit_replication":"https://pith.science/pith/NK2SBI75HLA6X4G6TXCVCASSKW/action/replication_record"}},"created_at":"2026-07-05T04:38:09.753255+00:00","updated_at":"2026-07-05T04:38:09.753255+00:00"}