{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LI3RF2NC7HWEWNAHXNBOYHCKM2","short_pith_number":"pith:LI3RF2NC","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"},"canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","source":{"kind":"arxiv","id":"2305.05829","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05829","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05829v3","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05829","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"LI3RF2NC7HWE","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_16","alias_value":"LI3RF2NC7HWEWNAH","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_8","alias_value":"LI3RF2NC","created_at":"2026-07-05T07:00:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LI3RF2NC7HWEWNAHXNBOYHCKM2","target":"record","payload":{"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"},"canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","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"},"source_kind":"arxiv","source_id":"2305.05829","source_version":3,"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-07-05T07:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TLGLVg9m32u5ZOyknfbS2BalkWpw7lqb4paMwzRTV5y4zJyFYdLE2e4EYXtH2IHQwKg9sNtEu0SyGONuIHbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:07.446956Z"},"content_sha256":"615650b18c6fda59164e4bba68b9c04290c0d281cbfd115f03ca1434b78ad6d9","schema_version":"1.0","event_id":"sha256:615650b18c6fda59164e4bba68b9c04290c0d281cbfd115f03ca1434b78ad6d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LI3RF2NC7HWEWNAHXNBOYHCKM2","target":"graph","payload":{"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"},"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-07-05T07:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYZPV8Ii4IQOP2w6ANie0aSSDAagYJrY49FSz41qxg/pDR1FmvPJFFWONmja4kRvKN2jDUq7Pl1GkAvPSvOUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:07.447529Z"},"content_sha256":"083d1cf6aa8646d64f38285cb1340e5220966c7c45c653e94eed4e4da8ba5f0f","schema_version":"1.0","event_id":"sha256:083d1cf6aa8646d64f38285cb1340e5220966c7c45c653e94eed4e4da8ba5f0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/bundle.json","state_url":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/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-08-09T00:41:07Z","links":{"resolver":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2","bundle":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/bundle.json","state":"https://pith.science/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LI3RF2NC7HWEWNAHXNBOYHCKM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LI3RF2NC7HWEWNAHXNBOYHCKM2","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":"1addb7d377c8022448aa669eb22c0571995435e5a2dd08047cdf5905de493284","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-10T01:22:59Z","title_canon_sha256":"9056a2548f3aa37e2999172e72b2baaac265efc02cdabdf2a404cf1a7dfa26e5"},"schema_version":"1.0","source":{"id":"2305.05829","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05829","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05829v3","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05829","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"LI3RF2NC7HWE","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_16","alias_value":"LI3RF2NC7HWEWNAH","created_at":"2026-07-05T07:00:23Z"},{"alias_kind":"pith_short_8","alias_value":"LI3RF2NC","created_at":"2026-07-05T07:00:23Z"}],"graph_snapshots":[{"event_id":"sha256:083d1cf6aa8646d64f38285cb1340e5220966c7c45c653e94eed4e4da8ba5f0f","target":"graph","created_at":"2026-07-05T07:00:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.05829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jiashuo Jiang","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-10T01:22:59Z","title":"Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05829","kind":"arxiv","version":3},"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:615650b18c6fda59164e4bba68b9c04290c0d281cbfd115f03ca1434b78ad6d9","target":"record","created_at":"2026-07-05T07:00:23Z","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":"1addb7d377c8022448aa669eb22c0571995435e5a2dd08047cdf5905de493284","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-10T01:22:59Z","title_canon_sha256":"9056a2548f3aa37e2999172e72b2baaac265efc02cdabdf2a404cf1a7dfa26e5"},"schema_version":"1.0","source":{"id":"2305.05829","kind":"arxiv","version":3}},"canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a3712e9a2f9ec4b3407bb42ec1c4a6691f909401272e1dda943ce09fde61be9","first_computed_at":"2026-07-05T07:00:23.200587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:00:23.200587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AqaGftnfsBlyLc25VnGNd8gYmmw0LhVgG4jq4crbfQqQt/m/bca4Tlw8uJpbNhOcJxiOi3GAHO4ao0aKIh6DA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:00:23.201673Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.05829","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:615650b18c6fda59164e4bba68b9c04290c0d281cbfd115f03ca1434b78ad6d9","sha256:083d1cf6aa8646d64f38285cb1340e5220966c7c45c653e94eed4e4da8ba5f0f"],"state_sha256":"d68d5a8adf3ca1dcbf14137f97ed45c2dead81eb79dde53e8972c1ab8ddf109d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OG5q0EXjtD3HtmSYujyNeobbQPA8E1PR6TSEQ7yFwDuTORtWphwSvTyE6RVGa25CwiLnYKKdDH3+kxLVlfxoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:41:07.452915Z","bundle_sha256":"ea3b976f2b5d062342e6c1c92954b49361d422e1a529acca64b173d63baf9c7e"}}