{"as_of":"2026-08-18T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d49cc072e1871bf91fef0fe92101d06d5c50651978f8fe7ad367f931e374b174","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T08:21:32.803474Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.02196/citation-record","integrity":"/paper/2607.02196/integrity","json":"/paper/2607.02196/citation-record.json","paper":"/paper/2607.02196"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"A dynamic near-optimal algorithm for online linear programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:8d61accd6aa5c17ee3826a7413de9887a62aad6d290c257f6188f92bdc2c25f8","observation_id":"06b62fc2-4e2e-479c-8674-02b85ff7fd42","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Uniformly bounded regret in the multisecretary problem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:368c879d337538f714ba0e8e1b39327a3325cd3e73f6db5e5e48f5bf56e59e36","observation_id":"55a170f2-72a9-4761-a5fc-431c955c56f0","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:60b7678b8ac872318d28713841b3dd268dff697a6c480cc8247e37c4ab11ea14","observation_id":"ae43fcc2-4351-4bd3-a299-b2f588a52895","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online resource allocation with limited flexibility","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:f06cc0243ebd79ba0a7c60d4d1393332af4ce893f3895dfe29ca861d65b8dd19","observation_id":"ac11a49d-c919-4b6d-b191-b11b572515e0","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Balseiro, Omar Besbes, and Dana Pizarro","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:5037ce76054037b8092737471d8ca25d11b6da9125f61bd02b575eb8a8d161c7","observation_id":"efdfd2ce-fb83-4761-b8f8-ccf759d0b8c9","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Balseiro, Haihao Lu, and Vahab Mirrokni","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:e49e300a0075abddd5a5037c6cf9fff835288deeba702158f07eaaf49fdffd16","observation_id":"84b02f8a-6863-4aee-b51d-551bef93728d","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Good prophets know when the end is near","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:d5b42f912abfd942a9590f80e0efb1122577561130e577a96bb0f4a1edf52d4d","observation_id":"12281ac2-8024-46a0-9566-1a799c47722a","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Dynamic resource allocation: Algorithmic design principles and spectrum of achievable performances","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:dc4e9a23e20fca8774fbcda10f5815deae5c9939ae26ee42bfa09e8d5fb34857","observation_id":"032649d3-36cc-49b1-9e04-2bc6b463a1c4","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Improved approximation results for stochastic knapsack problems","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:93f3ae70d96f5c28b9db2dd1e2ce806893d87acc53497276e854750ba8b43c4d","observation_id":"f8cc1901-0f6a-4e6f-b9bf-76e1dce762ca","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:c7d94e6fe23460fe8d47eda1d6adc7c36f3e92084ac8090d6f6c5da8cd3c5c75","observation_id":"96f03208-2a2f-487c-ad12-3a1f7d445762","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:21ef27749ccf9bc5afa82fdabec4c45fed751a4e8255b87a548cf5c3d357273b","observation_id":"dc83fc8c-911f-4b84-909c-3c696878cecb","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"A re-solving heuristic with uniformly bounded loss for network revenue management","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:61934c0814500c56f52bcc1cdffd410871aa85f489a53c12566a8b4b823596d6","observation_id":"8b28d44c-f467-49b6-b532-a51095cbf552","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01034","last_updated":"2026-05-20T14:58:19Z","snapshot_observed_at":"2026-08-16T20:35:44.610870Z","submitted_at":"2023-07-03T14:10:52Z","title":"Hoffman constant of the argmin mapping in linear optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01034","snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Camacho, M","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"cited_paper":"/paper/2307.01034","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:abd20da976ede182c135cc9b952483471fc46e03a8e5cd40e60656c842034102","observation_id":"08ca6405-d075-4974-aee0-e154b3d764d4","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01716","last_updated":"2025-02-13T00:33:06Z","snapshot_observed_at":"2026-08-17T16:43:25.306664Z","submitted_at":"2025-01-03T09:21:27Z","title":"Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01716","snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Beyond non-degeneracy: Revisiting certainty equivalent heuristic for online linear programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"cited_paper":"/paper/2501.01716","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:c9623012968e1a2b514990f3267c2e75aa91a172a62746b38d912a8941036769","observation_id":"d39ed004-1d57-4374-bf48-697caf5fe02b","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Dean, Michel X","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:f9cd4e97e35bd1b233022a9e6bf2d70f1336e7a4f42d5b3c76a9f621305917c4","observation_id":"0251c4a3-ab09-4b78-9f30-8bc037ac4a09","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Dean, Michel X","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:5df7143721942ab469ce06785242d64c846e2cdd5958f0ff9e0b9a4518919afd","observation_id":"570ac01e-170c-4b39-86e1-a27aa9bba321","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:16b1760a94a0d299d4ab8f345a6a15875f7365c56fe1258e0bd41812c3837b8c","observation_id":"76a31428-c7cb-4492-adbf-be851bd87e47","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Overbooking with bounded loss","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:c8bca3988a4ea6285675e0006e4d6bfcb91d8e361b77ba5ba79bd509bf78b1f5","observation_id":"e2d70063-950a-402b-9eea-1eb31a3b71ed","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Optimal dynamic pricing of inventories with stochastic demand over finite horizons","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:018219d8a794eb60d3a745ddfc30b34c8c5ae97f51710f4c5dd519301321ece0","observation_id":"697b2808-1c26-4f4c-8573-f334078c1ae5","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02761","last_updated":"2025-01-06T04:57:44Z","snapshot_observed_at":"2026-08-16T12:59:37.685125Z","submitted_at":"2025-01-06T04:57:44Z","title":"Beyond $\\mathcal{O}(\\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02761","snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Beyond O( T) Regret: Decoupling Learning and Decision-making in Online Linear Programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"cited_paper":"/paper/2501.02761","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:4673970c4ddcf06e9ee3e069059b0a4e4ce50aff6ae5a7f7a66ef1dd140d5a67","observation_id":"91b3cfdc-4b7d-4ca4-bd3a-d3d244fe751d","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Greedy algorithm for multiway matching with bounded regret","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:045dac752d72ec69e9b3c801b26b8dd4c6984cb24a8d6201fda014562d02fdee","observation_id":"66e2a349-d140-436f-804d-a0ffa1d873d7","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:06ecfefd05297f0b3cb878e8c5b051c3257ccdf2657b8ba9ac64402797a9e8ee","observation_id":"89db4ad5-c488-476f-976c-0e154273a44c","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:f30f4e4d2c98ca14cb6a69fc8f5c126f02830ed3a4e993259db7299c16a64203","observation_id":"0d4f9a85-b9ad-4038-a71e-f7a535459780","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"A re-solving heuristic with bounded revenue loss for network revenue management with customer choice","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:69f173efb30e0cb9d65f78b5c46def46c260612b8b1ea6e81693ad57fa91ae80","observation_id":"7b821906-5861-4d18-aff8-deed0e6d8633","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online stochastic optimization with W asserstein-based nonstationarity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:5adf91fd97731259c6ac481d0ec8ac36e8df771f613542dda4ea442d4cb7f709","observation_id":"3dd89b36-e3ed-4843-ad62-65725decbe36","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Degeneracy is OK : Logarithmic regret for network revenue management with indiscrete distributions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:597f7676bf26711baaaa20c5fbdfcd3716328580fd9588350986af75dfb2de11","observation_id":"65382b1d-1135-457d-a1ac-225fb5214bba","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:7e20300d39a278dd156c5395ef9cf107712a5617d68585805f68115f91df0697","observation_id":"1d5d3899-1e11-457a-9b56-dca763b4058f","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.07933","last_updated":"2020-12-18T02:27:23Z","snapshot_observed_at":"2026-08-16T18:58:33.604614Z","submitted_at":"2020-12-14T20:43:31Z","title":"Online Resource Allocation with Stochastic Resource Consumption","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.07933","snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online resource allocation with stochastic resource consumption","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"cited_paper":"/paper/2012.07933","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:4655fa6fc1b169cd375587b18fd3b2e5dbea74129963f004ba359e872d5f67a5","observation_id":"2bcd161a-8f10-454a-86e4-302aeae59746","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"o nnis, and Berthold V \\","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:017520ae822fcdb5e77b966b174c14334390323f5d26fda3cdee0acf6e4623d5","observation_id":"9c937094-252f-4f15-90dc-2eb427b9c119","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Kleywegt and Jason D","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:c449b5ff3ebb0d03322a8e96a7978a67824ba374ca887a7cb2979d2a4d2b57e9","observation_id":"b06f832b-dc46-4e0f-89e7-37ec79011b69","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Kleywegt and Jason D","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:f7941df09c7c073725ad7a6ca757d3a2d3c399333b77ab370cd44370d382c158","observation_id":"dda6f0ba-edd8-46a8-b932-b64751edd310","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online linear programming: Dual convergence, new algorithms, and regret bounds","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:0870233775696781f20c1769c02423176e199fc8c5d5e42f153b6c17f52c7de9","observation_id":"37d4b69c-0b4d-4265-826a-66f99b68e153","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Simple and fast algorithm for binary integer and online linear programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:1ac0ca5c4c301f293a588798b48b2a24ac5f7dbde600620198cc9caf8b27d971","observation_id":"4c18ea83-eac4-474a-8758-0bea978ad0d7","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Infrequent resolving algorithm for online linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:641f8ca536588adaf933b89ebe1ed3c4cbb70aa663c06eb69ffadf03625ae6a8","observation_id":"4116f3d1-3038-4c25-af89-2829055100c4","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:10b02b79f97805c858c1f51e585b73ddc93d5cd5c76fa22dfcc675a0ed7f4747","observation_id":"c5891d7a-3d58-4c2e-ac4f-003d0fd21fee","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Improvements and generalizations of stochastic knapsack and M arkovian bandit approximation algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:98932731007aa2c69761cc53e0b418da95141c806d2ec6845d5ae468112af8ac","observation_id":"75b46e74-ecca-4fcf-bd0a-1938b59225a7","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":2079},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:3bb0fe39956918708c523cf9f2c597d4d5f85ee0ab0f4c4d5644cf5e1adfd469","observation_id":"5d1c02a8-42de-4920-943d-68e18f272b4e","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Stochastic on-line knapsack problems","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:b757d36fdb0bc9b7412a938ee5d6e9e0afebfb89f41eb8d30df90cc33d8b6879","observation_id":"ddd579c0-78fc-4bdf-8425-2a49b6f65bd1","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Reiman and Qiong Wang","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:40549b8f44bd53785890f514439312705dc9bd98e74da2c3d31b47d4bdbe0d5e","observation_id":"1aeb4f46-dd1c-4036-9ef8-aede7639dfbf","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Talluri and Garrett J","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:22d40ecfc4a975d975f536481d77890288e2b93c4a665d396ed3139050208b03","observation_id":"58d058a2-bb1f-4adc-af0c-58fdc23dbf05","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"The Bayesian prophet: A low-regret framework for online decision making","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:3201f489f76165a1e804376e0404d3e5c8e333ba92dabe69d7a77f05a9414162","observation_id":"27ee0987-3d69-40e6-a502-814813bf3f88","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online allocation and pricing: Constant regret via B ellman inequalities","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:7fc4e190fceacc391aa897a898af40e6186868a21f378e5c152a88562aff5e7f","observation_id":"a14d482b-9a5d-4dd5-b4e9-fee43e58cc14","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:b836991bd1a8642b9c1a6540d0ee823a22d4320510db345a94c88a5957b73652","observation_id":"9ecb5143-cf3b-4194-ba9b-d6ec8519db4f","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Tight lower bounds for the multi-secretary problem via B ellman certificates","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:18cb8aceb021cca16a398324c645ff6b09c2ce8966f3190b46c21e4af2b17b23","observation_id":"07bf562c-7033-4017-b5e8-5b851b771ffe","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T08:21:32.803474Z","title":"Online resource allocation with continuously distributed reward and consumption: unknown distributions case","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-12T08:21:32.803474Z"},"links":{"citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:3a79a4c034c8b1a677950dcb22dc3b014d3a5812e30c4a50110dd7dae9f1394e","observation_id":"a8c2cbc6-399b-4555-8e65-5ecace90b989","resolution":{"observed_at":"2026-07-12T08:21:32.803474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.02196","last_updated":"2026-07-04T01:26:18Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T21:31:43.675683Z","submitted_at":"2026-07-02T14:04:21Z","title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":45},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2607.02196."}