{"as_of":"2026-08-17T17:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05d83c30133d79ec7ab8a73f817eff355e316da1546ff4906c5c1da5af1bc3ad","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:59:27.689381Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:39:41.299077Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14099","snapshot_observed_at":"2026-08-03T08:39:41.299077Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.16510","last_updated":"2026-07-06T14:55:50Z","snapshot_observed_at":"2026-08-07T00:38:18.433498Z","submitted_at":"2026-01-23T07:18:07Z","title":"Learning to Optimize by Differentiable Programming","version":4},"reference_index":146,"source":"pdf_text","source_observed_at":"2026-08-03T08:39:41.299077Z"},"links":{"cited_paper":"/paper/2504.14099","citing_paper":"/paper/2601.16510"},"observation_digest":"sha256:8df15e0bd9d8db26a3b1055808775736ce8b0dc06066f74a61a1a3f82f5dc65b","observation_id":"d882127a-3c40-4d36-b310-5859a729a4be","resolution":{"observed_at":"2026-08-03T08:39:41.299077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.14099/citation-record","integrity":"/paper/2504.14099/integrity","json":"/paper/2504.14099/citation-record.json","paper":"/paper/2504.14099"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:29.003502Z","title":"Agrawal, B","venue":null,"work_id":"ba835426-c19c-471b-92e6-2f3cdd312a59","year":2019},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.302868Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8e83980c334e0e277350c75b860ada4d6df7fed280b073bf16041f1b1b411f99","observation_id":"70fe77ba-1c95-4bbb-bd37-12c776dbfc11","resolution":{"observed_at":"2026-08-16T11:59:29.008927Z","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":"1904.09043","last_updated":"2020-05-20T00:59:53Z","snapshot_observed_at":"2026-08-14T16:44:11.326772Z","submitted_at":"2019-04-19T00:33:25Z","title":"Differentiating Through a Cone Program","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-08-16T11:59:27.310225Z","title":"Agrawal, S","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.310225Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:9529e74c4e2ecc457c8f1c5c481760ef4f08a4d8cc2cad44466bbafe2c4307b8","observation_id":"26e768b1-4fde-4063-8fbe-af49cccefadb","resolution":{"observed_at":"2026-08-16T11:59:27.310225Z","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-16T11:59:28.985127Z","title":"Agrawal, S","venue":null,"work_id":"f01bd531-03cf-4ca1-9f6e-f11b4e4e7495","year":2020},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.316356Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:5fa5aadeb7337f21d5f689d196ee898f153874535a466c15262d7f9eff791142","observation_id":"376fa1be-3a43-4aa1-b918-6965d4045793","resolution":{"observed_at":"2026-08-16T11:59:28.990930Z","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-16T11:59:28.966060Z","title":"Abadi, P","venue":null,"work_id":"90461ebd-5a2b-44e1-b837-d834074b730f","year":2016},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.322757Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:342de6017413372008d60865298ff9ef05e00cc53e999d2b4bb6e0ed1a40edf4","observation_id":"c3c01af5-21ab-463a-a4e4-864951fad2e0","resolution":{"observed_at":"2026-08-16T11:59:28.972703Z","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-16T11:59:28.946986Z","title":"Amos and Z","venue":null,"work_id":"5669b0a8-4cd9-4be9-9049-0f30d0f38aa7","year":2017},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.329048Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:83c176b7d40f165ed52dfd9fe01708bb31a80ece58ddb3a78cbaf821fdc7b15b","observation_id":"bb845e7c-2a87-42e7-b82f-e33f8c3cd097","resolution":{"observed_at":"2026-08-16T11:59:28.952663Z","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-16T11:59:28.929125Z","title":"Anderson and J","venue":null,"work_id":"2549ac69-20cb-46fa-a0f1-ba9ef60a5177","year":2007},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.335532Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:b089002ae70177df09f6a5179b22d0daa60aa83fe63fa0d89887d58f1ef9ce73","observation_id":"9f88a8a6-96cb-4d4e-ab37-760e51a7c399","resolution":{"observed_at":"2026-08-16T11:59:28.934760Z","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-16T11:59:28.909771Z","title":"Akiba, S","venue":null,"work_id":"4f4455ab-58d2-4ff2-a44f-ab9c39d20c8b","year":2019},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.343206Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8b93b0405ad5d67682e695b312627ad9754b2be85e77bd9916a594a3bc7d0ca1","observation_id":"1f6620a6-608d-4cdd-a63f-78e0cdcd9775","resolution":{"observed_at":"2026-08-16T11:59:28.915563Z","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-16T11:59:28.890401Z","title":"Boyd and C","venue":null,"work_id":"2f48a174-66f2-4b15-aca0-3c8cc33d5d98","year":1991},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.348746Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:12463a8a367f2d2ea965f4d408d2e67b4ef56113a95a714cf8ef3b88e5d85186","observation_id":"21355c71-5b21-4354-9201-bc94f9383fdb","resolution":{"observed_at":"2026-08-16T11:59:28.896031Z","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-16T11:59:28.870053Z","title":"Barratt and S","venue":null,"work_id":"1ece8faf-ea19-452b-8c1f-012c69713b0c","year":2021},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.353848Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:b9c21d7c96273cb17b4389fb0d4ea4c6aba1e23e7551ec0decf349bb1422b0b2","observation_id":"870ab53e-674a-42eb-9409-9801571d2a84","resolution":{"observed_at":"2026-08-16T11:59:28.877566Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.358869Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.358869Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:b8ad6b77248701a77413419cc38e44b4264480ba9e7b17b78c69973de79c8cdd","observation_id":"478d2e50-fea8-4ef4-a3a3-a66aaed31396","resolution":{"observed_at":"2026-08-16T11:59:27.358869Z","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-16T11:59:28.842407Z","title":null,"venue":null,"work_id":"5a4ab3a4-6f9f-42cd-9135-fb63571e8f60","year":1994},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.364480Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:fdbe53f0f19d92b92b10444564715d9bec6123a7512c5c77134797a8d3a987f9","observation_id":"92ff07ed-9c9d-4161-89f5-1ea1d5edcd99","resolution":{"observed_at":"2026-08-16T11:59:28.846670Z","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-16T11:59:28.825851Z","title":"Bertsekas","venue":null,"work_id":"53763eff-d18d-4c18-920d-f9989f06a668","year":1991},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.369825Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:dcdee6b16bccc6041e346a9cb35c2880bcbf1e8ab679d66b345ce3a0e8447f89","observation_id":"a2039844-aa1f-495d-90ae-e9a087e31738","resolution":{"observed_at":"2026-08-16T11:59:28.831034Z","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-16T11:59:28.806751Z","title":"Bertsekas","venue":null,"work_id":"98e77cc9-a9ab-4992-8ee7-10fb1db1d757","year":1997},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.374821Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:446500aa02f8d1d4adaf8322c556581e78ed06bc92c7bfc56d4fc94a05b37349","observation_id":"8ba0b831-179b-48e0-8561-78fae2acd8e5","resolution":{"observed_at":"2026-08-16T11:59:28.813219Z","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-16T11:59:28.785308Z","title":"Bradbury, R","venue":null,"work_id":"5790f440-b3d1-4c1d-812a-386de53a27d5","year":2018},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.381650Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8062d9bc2c6517d618c86a73613a27fb4a27a3982bc842dd28fd7c53161e290e","observation_id":"59c61baa-f7af-4b51-b99b-c35d8187f085","resolution":{"observed_at":"2026-08-16T11:59:28.791273Z","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-16T11:59:28.762790Z","title":"Bertsekas and R","venue":null,"work_id":"86c705eb-117c-4732-8a55-94b2f37c1a66","year":1992},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.388080Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:45078c1736e09ffd293cbbff2a7ca22bd6073d4427e569b12226bac91c95b530","observation_id":"308d4d1e-d4b8-4e99-ae6e-6a8bcffee1e1","resolution":{"observed_at":"2026-08-16T11:59:28.769672Z","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-16T11:59:28.744207Z","title":"Brown, W","venue":null,"work_id":"63c49ac9-6ab0-4d9c-b05e-790f077a889f","year":1992},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.394272Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:9b939b67328e38430ab3351abbf509284515c144322769233cb031b97026db68","observation_id":"ff15e960-0683-4d8f-b25d-fc1de8acdb76","resolution":{"observed_at":"2026-08-16T11:59:28.749598Z","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":"2401.05080","last_updated":"2024-01-10T11:26:59Z","snapshot_observed_at":"2026-08-17T08:20:20.732869Z","submitted_at":"2024-01-10T11:26:59Z","title":"Markowitz Portfolio Construction at Seventy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.05080","snapshot_observed_at":"2026-08-16T11:59:27.399902Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.399902Z"},"links":{"cited_paper":"/paper/2401.05080","citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:c4342a7e3d55039eefff68f27478f7fbbaab21f3692d0c4fbb1b1373dc470027","observation_id":"0c338693-9d44-4a18-93cf-f0e04f7099b0","resolution":{"observed_at":"2026-08-16T11:59:27.399902Z","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-16T11:59:28.724663Z","title":"Bishop and N","venue":null,"work_id":"77cd5322-5d44-4949-8367-3acb64834e5d","year":2006},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.405656Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:5003ae70a55ce7bee4701b7788119df29a7bf8007e54a5be26151c650418710c","observation_id":"b763f4c8-fddc-4449-ae3e-fe0bd0d29c97","resolution":{"observed_at":"2026-08-16T11:59:28.730306Z","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-16T11:59:28.707010Z","title":"Bertsimas and A","venue":null,"work_id":"96169098-a395-4e0a-919b-dfd78c5ed42f","year":2004},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.410989Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:48f8d2a307a3490c9d9ad4206dc46c9095b9ce7e50e34cd5e7e6d366c1e64d20","observation_id":"46204aa4-39c5-422a-be51-1d8eb67ff5ac","resolution":{"observed_at":"2026-08-16T11:59:28.712375Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.416527Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.416527Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:5235381003753e33d7f2a03863bd8001f15ece57fbb005df9b47daff6bfaae7d","observation_id":"b92bd84e-6c6e-45f0-8e7c-6fa2c2361376","resolution":{"observed_at":"2026-08-16T11:59:27.416527Z","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-16T11:59:28.678077Z","title":"Carson and N","venue":null,"work_id":"77da8b23-9176-46c1-a066-3b8930319d44","year":2018},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.422341Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8474aa8ed12cff287989a0e5622734659d39a68a05c47dbe08895580db5abed3","observation_id":"5f4287dc-1d73-4d24-a046-086b5d492d40","resolution":{"observed_at":"2026-08-16T11:59:28.683013Z","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-16T11:59:28.659222Z","title":"Calamai and J","venue":null,"work_id":"f344b22d-f65d-42a7-86f2-78ab96193594","year":1987},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.427526Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:1d2a4e0a41a9fc36293bf27e71017764bcf32a977077c0b0ab7ea54d9b2da2ef","observation_id":"7d5aa1f1-58b5-41fc-8c82-5c39de0a52db","resolution":{"observed_at":"2026-08-16T11:59:28.665528Z","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-16T11:59:28.640861Z","title":null,"venue":null,"work_id":"7407dc3b-ded1-42a4-ba45-82d01a5236dc","year":1995},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.433835Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:3775101725e8cba4aece083d7ef79750cd785952e9c81d87c4fa03bcf20bd992","observation_id":"e0f2276e-5a5a-41dd-92b7-c14b031fef39","resolution":{"observed_at":"2026-08-16T11:59:28.645897Z","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-16T11:59:28.623183Z","title":null,"venue":null,"work_id":"c5c82484-179a-4128-8af8-2b5aa64d820e","year":1958},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.440186Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:9b4cfd8ea2483167285b7cf3d8b456c805e460681236d00c70e590247e09ff71","observation_id":"92b32bce-14ab-4f51-b883-1a1afea433c7","resolution":{"observed_at":"2026-08-16T11:59:28.628327Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.445389Z","title":"Diamond and S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.445389Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:0cc756ad4bbc3b5df591b844ef2f8338c5d48b96dd446cbc4aee9e2d968c8b42","observation_id":"d2551159-b354-40b7-ae9f-a2ea0841b71e","resolution":{"observed_at":"2026-08-16T11:59:27.445389Z","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-16T11:59:28.593988Z","title":"Davis and W","venue":null,"work_id":"115ea3b7-5149-46ed-bf21-7ae21b5483f7","year":1999},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.450796Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:da22a832ca3361bb1e683d604a427a89c38b8ff2d41e7e0fe72ee4ab0a567041","observation_id":"d6d12c9a-d4c3-4acf-aa5a-7a10220d16ad","resolution":{"observed_at":"2026-08-16T11:59:28.598824Z","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-16T11:59:28.573766Z","title":"Davis and W","venue":null,"work_id":"68950584-ca1c-4b32-85c3-b13de8a44af2","year":2005},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.456501Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:91f87b5392f76d418727c93f049e56142311951ad5ba14caf350ada1e4930213","observation_id":"5895a08c-f87a-4dba-a9c8-82f17c1e520c","resolution":{"observed_at":"2026-08-16T11:59:28.580650Z","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-16T11:59:28.553432Z","title":"Dunning, J","venue":null,"work_id":"953700ff-b19e-41a5-8671-ea6e06085ede","year":2017},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.462196Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ee640ec790942088038373887c7fe4c9d1d251b000a71db7b3e1e7645bd944fc","observation_id":"731cfede-f8fc-437e-bdcd-74c2c61374ca","resolution":{"observed_at":"2026-08-16T11:59:28.559794Z","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-16T11:59:28.533220Z","title":"predict, then optimize","venue":null,"work_id":"553e3617-066c-4961-87ec-8ac123b48f53","year":2022},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.468506Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:9753391a11f939cbeeef5d598d8ca047b19f9ee030a4bcb35196cab758844a7f","observation_id":"734435b5-805f-42d2-9d1e-e22b3ed1c7c8","resolution":{"observed_at":"2026-08-16T11:59:28.540243Z","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-16T11:59:28.507119Z","title":"Elton, M","venue":null,"work_id":"b556cbba-f51e-4bb5-9649-d92966464d72","year":2009},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.473741Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:63bbb9f5d3151af734a743e97977b044c01db02c67a2b7a9d646525b44ac6076","observation_id":"9000cc9c-c72e-4470-b397-df2346c9c711","resolution":{"observed_at":"2026-08-16T11:59:28.513553Z","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-16T11:59:28.487779Z","title":null,"venue":null,"work_id":"665e5b4f-2fb8-4a49-b88e-7bb940869bd3","year":2020},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.479028Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:dd497c7c4bb1cfd3b27ee0fea667b5b567d7003d14547213717a4495f2b9c188","observation_id":"99dccd73-8fb0-46c3-a951-e7c17e47decd","resolution":{"observed_at":"2026-08-16T11:59:28.492895Z","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-16T11:59:28.467697Z","title":"Grant and S","venue":null,"work_id":"28f9330e-b089-4f40-9430-03a4424d3a49","year":2014},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.484994Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:f0c3c6a0c5043d4fb96b27697a526c39d2bce40522a96d4b4ba706e3d24b6482","observation_id":"8af82fe3-52d4-41b1-896e-5f17061e3b90","resolution":{"observed_at":"2026-08-16T11:59:28.473930Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.490935Z","title":"Grinold and R","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.490935Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:36fd4d6934b418e078ec24c3cfc2583fd05572d5ce7ef0b831d72e646ea66c8d","observation_id":"067a7fc8-8981-457e-bc14-9d9139656291","resolution":{"observed_at":"2026-08-16T11:59:27.490935Z","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-16T11:59:28.432255Z","title":"Garcia, D","venue":null,"work_id":"fba2fbca-6f6c-4b75-874e-bfeefe6e55b3","year":1989},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.495867Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:e3d6a6ddccd628ceb8967b8aa18d37a1f1d23e3886780524e1ad65e2635265b3","observation_id":"72c9fef2-515b-41c9-bd1b-84ab78f59419","resolution":{"observed_at":"2026-08-16T11:59:28.438629Z","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-16T11:59:28.412539Z","title":"Halabian","venue":null,"work_id":"23bec1d8-791d-4e9f-9bef-47e0768faf76","year":2019},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.500337Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:84b09478fbddbe9eb1a9af5ab8ddafae16d18941bd8a6f95b84e8a3b8f79f388","observation_id":"fbb08413-b99a-43c8-90d8-c54a5286a86b","resolution":{"observed_at":"2026-08-16T11:59:28.417840Z","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-16T11:59:28.394111Z","title":null,"venue":null,"work_id":"0d7bd30d-1044-41b5-a319-8f1fbff5f1c2","year":1997},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.505314Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:a000a14da72bfac8044518aef07c3e3370bb026ea45e37993abc7edfeec4b4ce","observation_id":"4761760a-5367-4b48-94d3-3ae2a3c75f63","resolution":{"observed_at":"2026-08-16T11:59:28.399414Z","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-16T11:59:28.374850Z","title":"Hoerl and R","venue":null,"work_id":"79ea3a3c-5dd9-41c6-a065-fa0bcf4df1ab","year":1970},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.510347Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:81d17c1f82ad4ed6042baca8aae1340bc969faa5c29856ee2118d27b6037457f","observation_id":"6066507b-0a76-45f9-a2bc-d3aa36e60aed","resolution":{"observed_at":"2026-08-16T11:59:28.381259Z","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-16T11:59:28.356819Z","title":"Holzmann","venue":null,"work_id":"cad25e69-b9bd-4a6b-b57f-e9b080e9c31b","year":2006},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.515238Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8f3bf1557cfa50916578a7831edc622f6341c39df7b452a524f9893ac4658e41","observation_id":"f64d50ea-e431-4c5e-a1e1-ff292a49c7c2","resolution":{"observed_at":"2026-08-16T11:59:28.362424Z","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-16T11:59:28.337709Z","title":"Hastie, R","venue":null,"work_id":"bc35c044-af7f-493d-a192-88d0cdb44d4d","year":2009},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.519837Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:a08a4901552931850311f4c25443fccdca033e43a2fcbf2b9a870ea41b348103","observation_id":"7e3f82dd-e45a-4f39-8991-99ec5c933123","resolution":{"observed_at":"2026-08-16T11:59:28.343673Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.524167Z","title":"Keshavarz and S","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.524167Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ea920eb90a252a47c503bf52e78d9b1f72e2b8077c00c8d30a55a7e1fdd14dd3","observation_id":"38557a5f-0b32-4f6b-ae9c-fdc05a841283","resolution":{"observed_at":"2026-08-16T11:59:27.524167Z","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-08-16T11:59:27.530246Z","title":"Kouvaritakis and M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.530246Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ac7c2572ba887f80f993456e7ffe2dc666980f3804cac80ca0f061a845728042","observation_id":"df913120-158c-47bf-acce-09026547258f","resolution":{"observed_at":"2026-08-16T11:59:27.530246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04898","last_updated":"2024-09-07T19:52:14Z","snapshot_observed_at":"2026-08-16T13:20:30.752728Z","submitted_at":"2024-09-07T19:52:14Z","title":"Learning Joint Models of Prediction and Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.04898","snapshot_observed_at":"2026-08-16T11:59:27.535435Z","title":"Kotary, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.535435Z"},"links":{"cited_paper":"/paper/2409.04898","citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:57daf1af5ac7f537a1b2d0d8c30e72e5eeb9fdfe09383570c143ba0fd9fddaca","observation_id":"1442586c-3c68-4c98-a72d-75cf9530b0ac","resolution":{"observed_at":"2026-08-16T11:59:27.535435Z","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-16T11:59:28.293953Z","title":"Kwakernaak and R","venue":null,"work_id":"5ea4a8ee-ac0b-4bfc-b009-46e1b34a7718","year":1972},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.541573Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:116cb20831350c7f2022697193d48e594248ee70ee58572a93bf1fb757a27071","observation_id":"817c6706-be98-4b5c-acdf-681523ba5766","resolution":{"observed_at":"2026-08-16T11:59:28.300216Z","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-16T11:59:28.272999Z","title":"L\\\"ofberg","venue":null,"work_id":"56fe67d8-1d26-4312-a63f-541c0d9005c4","year":2004},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.546655Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:c6345e4a182ea66a2a7098211bba0137c0f6d806d44981b7a3b1b67fe21e7d0a","observation_id":"bff13391-840a-4c48-95b8-7e677c4c1193","resolution":{"observed_at":"2026-08-16T11:59:28.279207Z","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-16T11:59:28.252742Z","title":"Lefever, E","venue":null,"work_id":"d6b740c0-36bf-45fc-97b0-f3fff982ce0f","year":2016},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.551701Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:cccd699af956823a95f7d44076255b7af396f9c4b66bf964867eb2d5fb5bdd83","observation_id":"f8a71d85-881c-45f2-bc83-803e7932b888","resolution":{"observed_at":"2026-08-16T11:59:28.259274Z","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-16T11:59:28.233137Z","title":null,"venue":null,"work_id":"18030c62-725f-4a09-84bd-a570aa93094a","year":2007},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.557031Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8fc6cc2bc4dc262126949b6f26b56904f7f7e0112c10925b20524fc4771fe8b9","observation_id":"b8a782ce-f615-4619-9dd6-02e27de43fd3","resolution":{"observed_at":"2026-08-16T11:59:28.239434Z","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-16T11:59:28.214526Z","title":null,"venue":null,"work_id":"806d6865-3a8f-4a51-b25e-39cf791038d6","year":2018},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.563598Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:e37fc2e3ae5afe1eff4a552bbc8a42d747207a4f6168e6ae71ed5886aa315bc1","observation_id":"ba547612-ac9c-4c97-845a-4d34f7ead919","resolution":{"observed_at":"2026-08-16T11:59:28.219886Z","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-16T11:59:28.194808Z","title":"Ledoit and M","venue":null,"work_id":"4dd46980-88a4-4496-b986-06a2f852efc5","year":2008},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.569273Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:63b47b6faefb270610ca87d361bba320d5c3c8eb5d97e8f4c6e31c926aa01c17","observation_id":"055b89a9-0e7d-4117-b518-e41daa0c8dee","resolution":{"observed_at":"2026-08-16T11:59:28.201306Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.574352Z","title":"Markowitz","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.574352Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:4f0a75664846702444bcfc5192f042eeb996accaf0f2e38dbc9daaea06222a69","observation_id":"0052eb75-b252-4d34-96cb-25002a23cddb","resolution":{"observed_at":"2026-08-16T11:59:27.574352Z","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-08-16T11:59:27.579546Z","title":"Mattingley and S","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.579546Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8689b6ba68b95fcc0f302152932c70e1c117cfb8d0a014d9c0cd4b52f44888de","observation_id":"595df937-4700-42c0-9016-2093da765389","resolution":{"observed_at":"2026-08-16T11:59:27.579546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07735","last_updated":"2022-09-08T02:09:49Z","snapshot_observed_at":"2026-08-16T17:21:01.216900Z","submitted_at":"2022-02-15T21:30:38Z","title":"A Light-Weight Multi-Objective Asynchronous Hyper-Parameter Optimizer","version":2},"cited_work":{"arxiv_id":"2202.07735","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.07735","snapshot_observed_at":"2026-08-16T11:59:27.750504Z","title":"A Light-Weight Multi-Objective Asynchronous Hyper-Parameter Optimizer","venue":"cs.LG","work_id":"d8d15ec8-c57b-4769-988a-8ee7f3df515e","year":2022},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.585473Z"},"links":{"cited_paper":"/paper/2202.07735","citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:4f43645cb0bab0f10bade10714fc990c2985c287b7e7978d4bd4bde7ab040c9e","observation_id":"5da275d6-baeb-42ef-a14a-87df44945db0","resolution":{"observed_at":"2026-08-16T11:59:27.757173Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:28.148242Z","title":null,"venue":null,"work_id":"3915dfa8-ca92-4c3b-bb19-240723784289","year":2012},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.591217Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:8381f199d6bc3b4172800493253bb1f731926c4dc4f5c1bce813f8bd1082229f","observation_id":"27e67a09-b7d1-4258-9d59-719cdf808c59","resolution":{"observed_at":"2026-08-16T11:59:28.154063Z","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-16T11:59:28.125104Z","title":null,"venue":null,"work_id":"97e444bb-bc39-451d-9d03-38e498cdda9a","year":2013},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.596267Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:145f39d3f81f0e0a70c1a2ed1643c35235724606cb22df508659caa16714e041","observation_id":"d0c96c44-424f-4c81-aef6-e9aa554f501f","resolution":{"observed_at":"2026-08-16T11:59:28.132915Z","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-16T11:59:28.102970Z","title":"Nobel, E","venue":null,"work_id":"3b2fe1cb-535c-42ed-b2b5-b1d0001187dd","year":2023},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.601399Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ee16afde38a67ca531a27496513db3ebf658e1a1085b88bee9729d4d44b88d11","observation_id":"67a4c141-490d-44a4-b462-5b708f6d5492","resolution":{"observed_at":"2026-08-16T11:59:28.109955Z","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":"2409.09781","last_updated":"2025-04-25T16:33:57Z","snapshot_observed_at":"2026-08-16T13:18:24.726137Z","submitted_at":"2024-09-15T16:10:03Z","title":"RandALO: Out-of-sample risk estimation in no time flat","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.09781","snapshot_observed_at":"2026-08-16T11:59:27.607209Z","title":"Nobel, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.607209Z"},"links":{"cited_paper":"/paper/2409.09781","citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:5f67fdeb48abded58a42dee749fd6e16a1f33a04598ce5483beb1b4f7b070eff","observation_id":"8c1bf9d9-e8ad-4701-bd5e-c015f0b53003","resolution":{"observed_at":"2026-08-16T11:59:27.607209Z","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-16T11:59:28.080847Z","title":null,"venue":null,"work_id":"e5655aee-57da-4f40-aca1-619ee1077452","year":2025},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.612353Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:aa20c13346f91c0704b3b9dbe0f705300cf3a9cb3f7bfdc9837966c5fd2e8d69","observation_id":"65f4d662-6f8b-4dee-9673-b0431000dbd8","resolution":{"observed_at":"2026-08-16T11:59:28.086263Z","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-16T11:59:28.063265Z","title":"Paszke, S","venue":null,"work_id":"c537277d-6b9b-407c-84fa-0ac594d8ca31","year":2017},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.617430Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:2f62947cbf8e909b41de9d6b8be87956e047d74b099aa57438479cb2e585f4ad","observation_id":"c5f9eb83-381a-400f-8157-1f34cef4b26c","resolution":{"observed_at":"2026-08-16T11:59:28.068284Z","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-16T11:59:28.046753Z","title":"Pappas, A","venue":null,"work_id":"809e36c5-8721-4eef-a4b0-ea10480ce109","year":1980},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.623233Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:18e72ea4db4866afce0af6ffde204969e36e1ee3ca7e8f53a04943983d45ef81","observation_id":"feb28986-fe61-416c-b2d2-6536b63648be","resolution":{"observed_at":"2026-08-16T11:59:28.051647Z","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-16T11:59:28.028760Z","title":"Rawlings, D","venue":null,"work_id":"471750d1-13ee-4504-869f-02cac1eabfe3","year":2017},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.628206Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:3d77bad4b27c4b378d9f793a37962baf633df8f75d1828a821189ae6b03d5d07","observation_id":"53727ffb-8d7a-4704-a4bf-20df497a4ba7","resolution":{"observed_at":"2026-08-16T11:59:28.034555Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.633710Z","title":"Schaller, G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.633710Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:5fb6043b836fe1e6c93c2c4f853d7a193c343fa5714d1167a42dc9670d4fd3bd","observation_id":"34668912-d873-4ce9-924d-0b6a62919ccc","resolution":{"observed_at":"2026-08-16T11:59:27.633710Z","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-16T11:59:27.998458Z","title":"Stellato, G","venue":null,"work_id":"8171ee36-dde0-47fa-b0ba-b63f62d260d3","year":2020},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.638076Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:6d7e74e51e08d4feb0d661c2e44f9f0f45068c07f60659b8bf408f259d674380","observation_id":"38491cac-678b-4ef2-9fe6-27458a796536","resolution":{"observed_at":"2026-08-16T11:59:28.004187Z","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-16T11:59:27.979774Z","title":null,"venue":null,"work_id":"20b4c2bf-1ce8-4ed7-8857-2533d83bba73","year":1993},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.642982Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:c6fc357b99bcf6b975808da03fb3a8bb3c5af2d698dfab28fc9c972efaac91cb","observation_id":"e4605508-2b6e-488a-b97e-1406a1b37e1d","resolution":{"observed_at":"2026-08-16T11:59:27.985314Z","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-16T11:59:27.961858Z","title":"Tibshirani","venue":null,"work_id":"f1643449-d2cb-4eca-abd7-1a30d64ffb48","year":1996},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.647774Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:a630d9564c119aa3cba783c01330ba3b7ffa1ee5916d58b93284fe37acfeb9e5","observation_id":"a91596d0-84d3-4f2f-a331-34826f74b1ec","resolution":{"observed_at":"2026-08-16T11:59:27.967435Z","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-16T11:59:27.941213Z","title":"Tang and E","venue":null,"work_id":"8d2a6449-82b8-462b-9f28-b0c78211086a","year":2024},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.652687Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:efa6b9010499aef490c00808d1687374a53228c1667b0dcc41a75395f30786f2","observation_id":"6956d7b2-b91f-491d-9c6c-e508d037ec1e","resolution":{"observed_at":"2026-08-16T11:59:27.948028Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.657076Z","title":"Udell, K","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.657076Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:e846c2cb7c38d4c37606fca51a1fe1f80241ad3db6b6c78b90e29f6cbeacad62","observation_id":"bcc82b0a-5fc7-4c5e-8f5b-3de420d7f3a1","resolution":{"observed_at":"2026-08-16T11:59:27.657076Z","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-16T11:59:27.908962Z","title":"Vanderbei","venue":null,"work_id":"be2744fb-d40c-42c8-a144-1c326c392381","year":1995},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.662301Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ba100928f4a067f49ecc518274b49994afd1d5e6b09eb18cc2929ff32dc233f8","observation_id":"9bccec99-0758-4c2e-9caf-acbc9feb97f7","resolution":{"observed_at":"2026-08-16T11:59:27.914373Z","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-16T11:59:27.890492Z","title":"Wainwright","venue":null,"work_id":"1a22ad83-5f2b-4b7e-89fb-202d346f8b89","year":2005},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.667527Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ba399d79eea29b35e5de4bd31afc06843c60b0aa6f38b6a2e7770dcc67fcf7b3","observation_id":"51e6ca8e-f612-400b-ba5b-d3e0474f14d8","resolution":{"observed_at":"2026-08-16T11:59:27.895720Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:59:27.673548Z","title":"Wang and S","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.673548Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:b3158d25f5021e21a98186ddd8e9f0696f39194566f9c658c5088a8cb12e1b88","observation_id":"141c364b-13cd-4973-980f-3f6b00050183","resolution":{"observed_at":"2026-08-16T11:59:27.673548Z","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-16T11:59:27.860991Z","title":null,"venue":null,"work_id":"7ab736f6-71ae-43ab-9b19-a408bc0686ed","year":2015},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.678676Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:ed52bb4ced0371509547e6fc3294404aa3d0b08308f9e20d79a9f2391dc014c9","observation_id":"7c92f22b-8f6f-452e-be8f-f1131d18f301","resolution":{"observed_at":"2026-08-16T11:59:27.866697Z","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-16T11:59:27.842704Z","title":"Zibulevsky and M","venue":null,"work_id":"5c391d01-1192-49b8-b8fb-4a77cdd594c0","year":2010},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.683833Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:0edaf397fbdc6fd66639bba979c220c5898eec5aab091e35958e773b0690eb7c","observation_id":"204c1bfa-aac1-476f-b4db-37f346a5f179","resolution":{"observed_at":"2026-08-16T11:59:27.848478Z","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-16T11:59:27.825410Z","title":"Zou and T","venue":null,"work_id":"49f959b3-828d-42c6-a85d-22e3e15f1f19","year":2005},"citing_paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-16T11:59:27.689381Z"},"links":{"citing_paper":"/paper/2504.14099"},"observation_digest":"sha256:c71c8f1ab2f7a71b0fed31f6313b37eb38733a921a9a61034ea8f96ab2d67f1f","observation_id":"8a5df7bf-b175-49f8-9db5-3859bfa52cad","resolution":{"observed_at":"2026-08-16T11:59:27.830375Z","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"}}],"paper":{"arxiv_id":"2504.14099","last_updated":"2025-04-18T22:49:17Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T22:59:05.202201Z","submitted_at":"2025-04-18T22:49:17Z","title":"Code generation for solving and differentiating through convex optimization problems"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":71},"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 71 of 71 outbound references and 1 inbound Pith citation observation for arXiv:2504.14099."}