{"as_of":"2026-08-17T16:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4ab618d4a031369675cdefb84454037c86cf3a351fca5de9a399a65e2d77a7e","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:29:28.681657Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T08:21:32.803474Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T16:58:42.499191Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2501.01716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01716","snapshot_observed_at":"2026-07-03T16:58:42.499191Z","title":"Beyond non-degeneracy: Revisiting certainty equivalent heuristic for online linear programming","venue":null,"work_id":"9a636221-7fd6-4698-a859-962f6cedc5a6","year":2025},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"cited_paper":"/paper/2501.01716","citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:d2cc994f7318cdb8c17b48d463a7bdc59c633b868197a3b905fd87724942bb46","observation_id":"2c2cd026-2760-4633-a74b-f337cdca3518","resolution":{"observed_at":"2026-07-03T04:07:36.535700Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2501.01716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01716","snapshot_observed_at":"2026-07-03T16:58:42.499191Z","title":"Beyond non-degeneracy: Revisiting certainty equivalent heuristic for online linear programming","venue":null,"work_id":"9a636221-7fd6-4698-a859-962f6cedc5a6","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":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-03T16:51:03.016123Z"},"links":{"cited_paper":"/paper/2501.01716","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:b57fd526b0e600b9540057881dd90e65a9e982f2a005a65464eddf4a6fcfc0e3","observation_id":"3bb2e300-2d3d-4a67-be72-156907cdb3fb","resolution":{"observed_at":"2026-07-03T16:58:42.500791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.01716/citation-record","integrity":"/paper/2501.01716/integrity","json":"/paper/2501.01716/citation-record.json","paper":"/paper/2501.01716"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.13822","last_updated":"2025-06-23T14:11:23Z","snapshot_observed_at":"2026-08-16T15:05:37.342211Z","submitted_at":"2023-08-26T09:19:26Z","title":"Dynamic Pricing for Reusable Resources: The Power of Two Prices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.13822","snapshot_observed_at":"2026-08-10T22:29:28.604161Z","title":"and Ye, Y","venue":null,"work_id":null,"year":2014},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.604161Z"},"links":{"cited_paper":"/paper/2308.13822","citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:b1ea916290f5164d5aad8fdd6e6d14134ad59f6d18f97561ad9ca0169721ea68","observation_id":"54b53344-2859-4397-b61d-a71de886628e","resolution":{"observed_at":"2026-08-10T22:29:28.604161Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.867620Z","title":"Hence, we must have λ θ = λ 2, which contradicts the condition λ θ ⁄= λ 2, and finish the proof","venue":null,"work_id":"231b75b7-94be-470e-957d-72f5df812cc9","year":2024},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.646615Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:9709b4e6ebe431cb4993ce4e2015582c34f83e69bbb5c71e65962ae49c84e7d2","observation_id":"a26aa907-fdaa-401d-afd8-99a947d1a3f6","resolution":{"observed_at":"2026-08-10T22:29:28.872834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.949843Z","title":null,"venue":null,"work_id":"a087563b-f5e1-467c-a7ac-6b8efdbd8729","year":2022},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.617211Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:6b775eb73e8b359509dd27cead68a379c0b90063108e47dd56241bdb1d01658b","observation_id":"9db6a65c-4ef1-4814-a0ef-b2e9b73b44c3","resolution":{"observed_at":"2026-08-10T22:29:28.954960Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.934414Z","title":"(i) Assumption 4.3 ⇐ ⇒Assumption 4.2","venue":null,"work_id":"2a95089c-0737-41b9-b048-74eb5163d8a3","year":1997},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.623456Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:fe1071723857e2cf43aba97b20d9040591e4e0bf3c90e807db66ec32f1312c5f","observation_id":"1011274e-2cb9-4b80-861b-9c4a0c892046","resolution":{"observed_at":"2026-08-10T22:29:28.939453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.918286Z","title":null,"venue":null,"work_id":"d1395829-bb3d-42bb-b2f3-95fdcba2f968","year":2023},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.629779Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:d031f15f415142fa318c353118acace0ea42ed53e1dea1ce7e115fd70099bafd","observation_id":"0d904b4a-044e-4ef8-938c-dd7417d8a574","resolution":{"observed_at":"2026-08-10T22:29:28.923645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.901610Z","title":null,"venue":null,"work_id":"dc64bd8b-7351-4bf4-9eca-1b9643107dba","year":2022},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.635556Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:bd59842b862ba2213a9357100bfb02d5309a2d223e9252148c383f4d8ac39243","observation_id":"e019d2ff-4254-4924-9f35-9ea0335fd0ae","resolution":{"observed_at":"2026-08-10T22:29:28.906433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.884694Z","title":"Assumption 2.1)","venue":null,"work_id":"4234f908-5e17-4383-b0ed-6b1fd13236ce","year":2022},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.641979Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:e93aa94340488bedbfd437d67e627e04e40a376a73c765bf7343f81dfe5f4927","observation_id":"36ba7fba-3336-4462-b9a1-19e6a7ca2530","resolution":{"observed_at":"2026-08-10T22:29:28.890584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.851712Z","title":"semi-discrete","venue":null,"work_id":"57fdc1f7-f882-4072-8347-320918e1a0d6","year":2022},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.651801Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:81f0ec66a8e2e86f508bf36e31a477b857f23cb0129ee1bccd76ef2303fd54ae","observation_id":"4cedc932-7845-4f0d-a03b-e4d59fd56ba0","resolution":{"observed_at":"2026-08-10T22:29:28.856802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.833567Z","title":"H Proof of Lemma 5.4 and Lemma 5.5 To begin with, we introduce additional notation","venue":null,"work_id":"b443c0a9-c9ab-4bc1-96f4-61155369d2b0","year":2000},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.657712Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:6d6c61b1f1b7d1a99a3f9a707f8f4d7469e98ec946378f06e7c1f0feac0dd3a0","observation_id":"b1d38e6d-91bc-4a43-8e4f-0257e1cb67de","resolution":{"observed_at":"2026-08-10T22:29:28.839948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.816605Z","title":"Let N0 = (2 + ¯r δA )5m","venue":null,"work_id":"a7d79001-4e73-4f5e-8d99-c9ace80e7dae","year":2022},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.662388Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:049980f29dc2c64fc6356ae8fba20d23b25aba5e52ecf9497a72ce6907abe989","observation_id":"9711bceb-af2c-40d2-a9e1-d1145e418a25","resolution":{"observed_at":"2026-08-10T22:29:28.821507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.799836Z","title":null,"venue":null,"work_id":"266a1341-d824-4d05-9875-d21a453e383a","year":1990},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.667311Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:eb48efd14ff12a1cd814042513d5b224293df950d5de13c60edfe5a4af857230","observation_id":"9a7c1403-1667-4176-b3f6-55ec1029cec9","resolution":{"observed_at":"2026-08-10T22:29:28.804848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.765087Z","title":null,"venue":null,"work_id":"44224ed8-99b1-4f7a-8a0b-29074b5a78df","year":2000},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.677040Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:ca550a5bbec9e7d6314c3dbdae2ebc4b39eb2607add1b7a204b9de6da61d3bd9","observation_id":"5778abfb-bfec-4e6a-b09f-3c8479521563","resolution":{"observed_at":"2026-08-10T22:29:28.771036Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.747662Z","title":"Refer to the proof of Lemma 1 in Li and Ye (2022)","venue":null,"work_id":"c7cfa2f8-5171-45ee-8d1a-f529079a30b2","year":2022},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.681657Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:dbe17acd65622885b152bf278e29eb9db6cf2882b871b663c1f63852ad5a1ebf","observation_id":"a6279eef-e1ca-4e2c-9078-1238338d4b82","resolution":{"observed_at":"2026-08-10T22:29:28.753378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07996","last_updated":"2025-01-02T16:07:08Z","snapshot_observed_at":"2026-08-16T23:06:09.756360Z","submitted_at":"2022-10-14T17:52:19Z","title":"Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07996","snapshot_observed_at":"2026-08-10T22:29:28.611097Z","title":"and Sinha, A","venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":345,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.611097Z"},"links":{"cited_paper":"/paper/2210.07996","citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:b50a6adef30fc1e84ba49ebd1f1a27fd51375e23155e2a2f062d06fed63614af","observation_id":"bf65604c-2c19-4605-82a5-ea241042c296","resolution":{"observed_at":"2026-08-10T22:29:28.611097Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:28.783650Z","title":null,"venue":null,"work_id":"5654d906-9b2e-4a13-9ba8-9b3da44103fb","year":2000},"citing_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},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:28.672410Z"},"links":{"citing_paper":"/paper/2501.01716"},"observation_digest":"sha256:4954f72450df515aa81c99781f52f8f34ac45bf81e8a3860541d86c6fbe79b46","observation_id":"6f510509-6b6c-470a-a480-79cb61126ea5","resolution":{"observed_at":"2026-08-10T22:29:28.788811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.01716","last_updated":"2025-02-13T00:33:06Z","latest_version":2,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":15},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 3 inbound Pith citation observations for arXiv:2501.01716."}