{"as_of":"2026-08-18T22:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41d18effff46634911e9fecd517c6af2029b41a212d561081aaf73c6ee70c4ac","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.505341Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2501.02761","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02761","snapshot_observed_at":"2026-07-03T16:58:42.505341Z","title":"Beyond O( T) regret","venue":null,"work_id":"0a339676-569f-45b8-ae38-4f92b9fbef2e","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":18,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"cited_paper":"/paper/2501.02761","citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:cccc3d400fbde50f5e6c8a8e4741ac3d9917c6c703d2979d243b6b7741a2873b","observation_id":"4a6f4820-0c07-42c6-8b35-c16df151343a","resolution":{"observed_at":"2026-07-03T04:07:36.538541Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"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":"2501.02761","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02761","snapshot_observed_at":"2026-07-03T16:58:42.505341Z","title":"Beyond O( T) regret","venue":null,"work_id":"0a339676-569f-45b8-ae38-4f92b9fbef2e","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":20,"source":"arxiv_source","source_observed_at":"2026-07-03T16:51:03.016123Z"},"links":{"cited_paper":"/paper/2501.02761","citing_paper":"/paper/2607.02196"},"observation_digest":"sha256:74b877c203aba004f51a87c8a551df64fa64da7465f73cd5011b763ea52a204e","observation_id":"d71cad5e-37fa-44c8-a7ba-376d30c219b4","resolution":{"observed_at":"2026-07-03T16:58:42.506775Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02761/citation-record","integrity":"/paper/2501.02761/integrity","json":"/paper/2501.02761/citation-record.json","paper":"/paper/2501.02761"},"outbound":[],"paper":{"arxiv_id":"2501.02761","last_updated":"2025-01-06T04:57:44Z","latest_version":1,"primary_category":"stat.ML","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.02761."}