{"as_of":"2026-08-23T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7c860bc8593bcc5e8da38bf2d8b1052a4dd59a71ed2cbde469fe4533158f4b4","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:55:51.028880Z","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-23T06:30:58.430688+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/2501.13648/citation-record","integrity":"/paper/2501.13648/integrity","json":"/paper/2501.13648/citation-record.json","paper":"/paper/2501.13648"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.12997","last_updated":"2020-03-29T02:08:41Z","snapshot_observed_at":"2026-08-18T21:42:20.655164Z","submitted_at":"2018-10-30T20:43:04Z","title":"An Online-Learning Approach to Inverse Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.12997","snapshot_observed_at":"2026-08-10T15:55:50.960830Z","title":"Inverse optimization","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.960830Z"},"links":{"cited_paper":"/paper/1810.12997","citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:956db7fba8e98b7048331360303a7026eb35a426d96e7de869d3bcc692dd9dd9","observation_id":"b0adb9fc-4e51-4551-8d3e-8d66a7a79efb","resolution":{"observed_at":"2026-08-10T15:55:50.960830Z","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-10T15:55:51.145009Z","title":"□ B Recovering the Same Bound as Bärmann et al","venue":null,"work_id":"078bcf82-e4a4-4ae4-85f3-1828e17f6381","year":2017},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.020974Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:84ae8e34900651fa9673a8ce4118ee5d81f7340fec22e279c7cd70a959edbc00","observation_id":"9c91b36c-30a3-4739-a969-733b977739bb","resolution":{"observed_at":"2026-08-10T15:55:51.148607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.178445Z","title":"Inverse problem theory: Methods for data fitting and model parameter estimation","venue":null,"work_id":"b3ef2079-3511-43e4-b47f-eee8d1e733d0","year":1988},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.009501Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:b3684989c745fc62564d7446e6f6e753af6d440a2a3ae8e3fc49fe5221c75aeb","observation_id":"9232ace4-6fdb-4b1b-bdef-f7fe39b80d94","resolution":{"observed_at":"2026-08-10T15:55:51.183230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.155772Z","title":null,"venue":null,"work_id":"28d7a79e-0b60-41d1-8799-7a288f958d6c","year":2023},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.017201Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:061b64b78827f867c453c6b9579b540fec8f74a87c2adb7644064207c164d09b","observation_id":"cfaed048-6a51-431a-900f-ee162c90e1d6","resolution":{"observed_at":"2026-08-10T15:55:51.159605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.133954Z","title":"We let /u1D6FD/u1D447 +1 = /u1D6FD/u1D447 , which does not affect the analysis (Orabona, 2023, Remark 7.3)","venue":null,"work_id":"a244c9ba-18a4-4a4c-828c-02402ddb852c","year":2023},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.024910Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:7d62cc007503b57f920102642164249c5e35aa992846c07f4aa30fad632865e7","observation_id":"4515eda3-dec4-4ae7-8c2e-4d459fa0c56a","resolution":{"observed_at":"2026-08-10T15:55:51.137954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.121964Z","title":null,"venue":null,"work_id":"e11c4377-882a-4bbb-9282-7be02002ddc2","year":2023},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.028880Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:999418f3157bae46392884038e3da9c5b308583e225a5707b46536dbf6f58ae4","observation_id":"3796b22e-f919-4137-8a0e-5394cad7be44","resolution":{"observed_at":"2026-08-10T15:55:51.125873Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.242258Z","title":"Smart “predict, th en optimize","venue":null,"work_id":"83135e00-4f90-4290-a56a-12096c308f7a","year":2022},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.982162Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:599c7e054657bd18aec16a77e3d9ec708853df414ad9a97ee036799882597ef8","observation_id":"d27b5b2c-2db8-43f9-b286-b3acdb1230f0","resolution":{"observed_at":"2026-08-10T15:55:51.246182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.267310Z","title":"Online learn ing from optimal actions","venue":null,"work_id":"580b1303-9163-4217-abd2-43565f2857e6","year":2021},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.969902Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:b9fe652f68767f8810f5cc9eb202e48f2c5e08970d09fc443de7078eb7e38b4d","observation_id":"d5490d9e-2d42-47ec-b61a-97deff37c007","resolution":{"observed_at":"2026-08-10T15:55:51.271153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.229758Z","title":"Logarithmic re gret algorithms for online convex optimization","venue":null,"work_id":"37e29bf3-1d1d-4e6e-9aaf-afa49ddb5f4a","year":2007},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.986395Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:7a2b92c7d48a4a66ce18103450cc727ceb0cd9dd46874d817c8ae6d482cf4cb4","observation_id":"abe8df67-4e07-4e15-b1e5-9b1666e6231e","resolution":{"observed_at":"2026-08-10T15:55:51.233908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.204243Z","title":"Onlin e structured prediction with Fenchel–Young losses and improved surrogate regret for online multiclass classi fication with logistic loss","venue":null,"work_id":"d729e5cf-0a51-4ad0-8747-59fa1bef10c9","year":2024},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.997867Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:068e12c2037e2c940d25b083bea070e7fabe8dfb587694b5a8e0068d5896d130","observation_id":"86f50a7b-7608-4c07-b827-0f01ac73e2e0","resolution":{"observed_at":"2026-08-10T15:55:51.208441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.279392Z","title":"Learning with differentiable pertub ed optimizers","venue":null,"work_id":"50ee436a-2f77-450e-817c-4dfdfab1d2bb","year":2020},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.965965Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:e90ea4ab0e5e4b71ee7b5a8f47e34eafe814f0519ef65ac306d5184f6248d247","observation_id":"5bebc78b-3317-4493-ab49-adf676d1f73f","resolution":{"observed_at":"2026-08-10T15:55:51.283327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.166542Z","title":"Melding the d ata-decisions pipeline: Decision-focused learning for combinatorial optimization","venue":null,"work_id":"d8657092-6184-4d11-8edc-d7cbee8d62ca","year":2019},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.013291Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:1fdb2f7c8249e14fe8d451e50efa8003a17d08f1bf7b8d6fa4696ec00c5a6294","observation_id":"d9dd1c0f-979c-48d6-a5ca-dba06a21d26e","resolution":{"observed_at":"2026-08-10T15:55:51.170508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.254157Z","title":"The theory of max-min, with applicat ions","venue":null,"work_id":"c6dc37fb-3d99-4175-b286-30ef5d489fc4","year":1966},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.978095Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:9de85d1fae284215661cda9a7053cb5938f136235bd2db5a4b18e533efb7b258","observation_id":"f4df7d44-3c82-4bc7-84a2-b9f28985f200","resolution":{"observed_at":"2026-08-10T15:55:51.259023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.10460","last_updated":"2021-06-04T13:31:11Z","snapshot_observed_at":"2026-08-09T09:58:16.629960Z","submitted_at":"2020-08-24T14:05:13Z","title":"Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.10460","snapshot_observed_at":"2026-08-10T15:55:50.973632Z","title":"Contextual inverse optimization: Offline and onli ne learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":134,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.973632Z"},"links":{"cited_paper":"/paper/2008.10460","citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:990aa77eece53900ec3090fe8bef196b5621215f75326d9a96b27096e9b66e1a","observation_id":"ace538cb-9446-43fa-b9e7-5a4a56490dc3","resolution":{"observed_at":"2026-08-10T15:55:50.973632Z","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-10T15:55:51.216205Z","title":"Asymptotically efficient a daptive allocation rules","venue":null,"work_id":"9adbb623-0a11-4707-b28b-592e0cb9ed09","year":1985},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.990199Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:2eeb48a3c0eb057a963a19a772bc0a7c22174f72197c6c50cd523e1c63dbabc6","observation_id":"4bec5637-d635-4b32-a974-c6ba67807e9f","resolution":{"observed_at":"2026-08-10T15:55:51.221154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-10T15:55:51.191943Z","title":"Learning line ar programs from optimal decisions","venue":null,"work_id":"903a99a2-95e8-428e-82aa-2247e41618f2","year":2020},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":202,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.005616Z"},"links":{"citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:222b7bbfd0b0a94cbe39d1563dde3024453a9b546465b73949bd9dae0d01b1a4","observation_id":"5845a4c6-e113-4851-af41-04a649012fc1","resolution":{"observed_at":"2026-08-10T15:55:51.195994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-10T15:55:50.993925Z","title":"Data-driven inverse optimization with imperfect information","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":235,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:50.993925Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:79e5bc7605bdd40762cb8923b296d8d782bba880b1b3ee7a99bd22761477315d","observation_id":"5ea76408-5f42-42ea-94b1-30ba80e1894f","resolution":{"observed_at":"2026-08-10T15:55:50.993925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14349","last_updated":"2025-05-22T02:11:40Z","snapshot_observed_at":"2026-08-16T12:58:43.272387Z","submitted_at":"2025-01-24T09:19:15Z","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","version":6},"cited_work":{"arxiv_id":"2501.14349","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.14349","snapshot_observed_at":"2026-08-10T15:55:51.062423Z","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","venue":"cs.LG","work_id":"1bcf7957-b4a6-4807-8050-643e5a6722d5","year":2025},"citing_paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","version":3},"reference_index":247,"source":"pdf_text","source_observed_at":"2026-08-10T15:55:51.001579Z"},"links":{"cited_paper":"/paper/2501.14349","citing_paper":"/paper/2501.13648"},"observation_digest":"sha256:7715f224e72cc538cb95040bcaee551cd2ec64d02f52827b3b8b9601732576dd","observation_id":"23a76792-c9d3-4eb7-9b7e-5dcb98c5f7f4","resolution":{"observed_at":"2026-08-10T15:55:51.069392Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13648","last_updated":"2025-02-07T23:35:18Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T14:52:54.193559Z","submitted_at":"2025-01-23T13:27:14Z","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":18},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2501.13648."}