{"as_of":"2026-08-17T08:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb2174251a28520f7326f563cd1b8386b97c147749e16ce25bf61d5e51da4420","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:59:27.310225Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T15:57:07.583193Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2307.08336","last_updated":"2026-04-20T11:06:32Z","snapshot_observed_at":"2026-08-16T22:11:32.775187Z","submitted_at":"2023-07-17T09:12:05Z","title":"RAYEN: Imposition of Hard Convex Constraints on Neural Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T07:24:31.376748Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2307.08336"},"observation_digest":"sha256:ce1ca6c01f7dba90801a19d2baa7313ac6ca4f5c2584ca74226c34f8b52e6e4a","observation_id":"3372fd67-0b84-4ed2-b3ae-ae8b22744ad4","resolution":{"observed_at":"2026-05-24T07:26:03.689332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-12T10:28:09.724403Z","title":"Differenti- ating through a cone program","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-16T05:42:08.300926Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.724403Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:4f2344caa4f4dfbdac4a1fe340d20671687674bbe9f09a43cf7b142c36ae5f74","observation_id":"ffdbd41f-8d72-43d0-8442-e25e270c268c","resolution":{"observed_at":"2026-08-12T10:28:09.724403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T19:42:05.800088Z","title":"Brockman, V","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.06481","last_updated":"2025-05-29T12:44:13Z","snapshot_observed_at":"2026-08-12T09:30:15.869741Z","submitted_at":"2024-12-09T13:30:59Z","title":"DeePC-Hunt: Data-enabled Predictive Control Hyperparameter Tuning via Differentiable Optimization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:05.800088Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2412.06481"},"observation_digest":"sha256:1e9dde67832c93001b7ec7e4ed53463f062e86d7d9a281f17aa6ccf4fe395ae8","observation_id":"8d3450d1-769a-46ca-9246-6a1319aad4f3","resolution":{"observed_at":"2026-08-11T19:42:05.800088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-10T23:21:41.436444Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.20679","last_updated":"2024-12-30T03:18:24Z","snapshot_observed_at":"2026-08-14T03:10:52.035327Z","submitted_at":"2024-12-30T03:18:24Z","title":"Differentiable Convex Optimization Layers in Neural Architectures: Foundations and Perspectives","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T23:21:41.436444Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2412.20679"},"observation_digest":"sha256:5bd7083d9c4ea41319504a93fcb0c9ad331e8b773799cce3cca2597127759336","observation_id":"325fc8ac-8990-4a04-aed9-a919cf83981b","resolution":{"observed_at":"2026-08-10T23:21:41.436444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-10T04:33:43.063373Z","title":"Differentiating through a cone p rogram","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.17963","last_updated":"2025-01-29T19:53:14Z","snapshot_observed_at":"2026-08-16T20:27:02.717585Z","submitted_at":"2025-01-29T19:53:14Z","title":"Physics-Grounded Differentiable Simulation for Soft Growing Robots","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T04:33:43.063373Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2501.17963"},"observation_digest":"sha256:6cae5bd3ff9a30c32d9c531ff479e56c7262c6dfff9fd02b6eecbdfeacc0f83a","observation_id":"f5acec36-c73d-4892-a09b-2055b4f72eb1","resolution":{"observed_at":"2026-08-10T04:33:43.063373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2602.09368","last_updated":"2026-05-12T15:35:19Z","snapshot_observed_at":"2026-08-13T08:36:32.959891Z","submitted_at":"2026-02-10T03:19:42Z","title":"Certified Gradient-Based Contact-Rich Manipulation via Smoothing-Error Reachable Tubes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T06:05:14.593870Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2602.09368"},"observation_digest":"sha256:6ecbddfb0971e97a0f6e6228f0c62bb8e18ac5d48ccf40503e9c4d988339e8db","observation_id":"c152bfb0-4c10-49ea-8bcb-bb3979ab8b74","resolution":{"observed_at":"2026-05-16T06:07:25.738531Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2605.01361","last_updated":"2026-05-19T13:19:05Z","snapshot_observed_at":"2026-08-11T00:12:21.954780Z","submitted_at":"2026-05-02T10:10:16Z","title":"Decision-Focused Learning via Tangent-Space Projection of Prediction Error","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-09T14:18:14.551453Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2605.01361"},"observation_digest":"sha256:ecd4d447acb4ce000cf45aec4f2be4edbdcf2a6c7664d0a6fb537bc50428cea6","observation_id":"f5b6d94b-acb8-40d3-a0c0-43c54c41d5ec","resolution":{"observed_at":"2026-05-11T17:01:08.054349Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2605.01361","last_updated":"2026-05-19T13:19:05Z","snapshot_observed_at":"2026-08-11T00:12:21.954780Z","submitted_at":"2026-05-02T10:10:16Z","title":"Decision-Focused Learning via Tangent-Space Projection of Prediction Error","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T23:37:11.202725Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2605.01361"},"observation_digest":"sha256:c91e77a9a0e9f3b6ed0ef62e081e3d197f20ff744555d14abc059e4772985f2a","observation_id":"7e00b250-1dda-45a0-80fc-34f428e0137f","resolution":{"observed_at":"2026-05-20T23:39:13.177601Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2605.11352","last_updated":"2026-05-12T00:15:36Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-12T00:15:36Z","title":"Parameter Estimation of Mutual Information Maximized Channels","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T02:34:21.924725Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2605.11352"},"observation_digest":"sha256:7fb02c495c985208a25c207af179bbe6973c1afbec634ccd976423db4c08ea43","observation_id":"b540eca6-3628-4b57-b41e-d4cbf57e5561","resolution":{"observed_at":"2026-05-13T02:37:07.923691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2605.17913","last_updated":"2026-05-18T06:21:39Z","snapshot_observed_at":"2026-08-15T01:59:26.087034Z","submitted_at":"2026-05-18T06:21:39Z","title":"A Differentiable Interior-Point Method in Single Precision","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-20T09:59:38.981655Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2605.17913"},"observation_digest":"sha256:4b1f50e2e85a69dc375112731e5e4dfb895ce46a0b34a6f2ab8fa35a4e48905e","observation_id":"a0e30b42-caac-4816-8302-42f772f632f9","resolution":{"observed_at":"2026-05-20T10:03:14.651447Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"1904.09043","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-07-02T15:57:07.583193Z","title":"Differentiating through a cone program","venue":null,"work_id":"9c2b1ffc-3797-4315-85a4-be8a9af50082","year":1904},"citing_paper":{"arxiv_id":"2606.05649","last_updated":"2026-06-04T03:27:51Z","snapshot_observed_at":"2026-08-13T18:36:48.731642Z","submitted_at":"2026-06-04T03:27:51Z","title":"Diff2SP: Diffusion Models for Correlated Scenario Generation in Stochastic Programming","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-06-27T23:05:34.563849Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2606.05649"},"observation_digest":"sha256:40590f1845d8e07a08883e68b0e2734f0a0ba93a798db6a4ed212e598fd46202","observation_id":"04a9477e-9fe2-4221-ad76-805879bfc243","resolution":{"observed_at":"2026-07-02T15:57:07.584825Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-01T09:44:53.087202Z","title":"arXiv preprint arXiv:1904.09043 , year=","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2607.20674","last_updated":"2026-07-22T19:17:11Z","snapshot_observed_at":"2026-08-08T15:46:24.561086Z","submitted_at":"2026-07-22T19:17:11Z","title":"End-to-End Learning of Safe Optimal Feedback Control in High Dimensions with Control Barrier Function Layers","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T09:44:53.087202Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2607.20674"},"observation_digest":"sha256:fc296ab849e5a089c3a2c3231aad94393e2aad4d4350b6da8e6a070046d13f23","observation_id":"0f502aa4-4ab1-4e46-8e30-fe28e7a10434","resolution":{"observed_at":"2026-08-01T09:44:53.087202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T04:57:43.145481Z","title":"Moursi , title =","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2607.27600","last_updated":"2026-07-30T02:42:51Z","snapshot_observed_at":"2026-08-17T04:40:49.077171Z","submitted_at":"2026-07-30T02:42:51Z","title":"Back from the Future: Key-Value Cache Management by Counter-Causal Surprise","version":1},"reference_index":120,"source":"arxiv_source","source_observed_at":"2026-08-01T04:57:43.145481Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2607.27600"},"observation_digest":"sha256:f7b43262c628ec96938de3f175eddc5520d7a3cd555465bdce06de00ec782a6d","observation_id":"7b35a651-6a29-4c1c-afab-c534e626f133","resolution":{"observed_at":"2026-08-01T04:57:43.145481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T14:47:33.440169Z","title":"Dif- ferentiating through a cone program,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2608.04189","last_updated":"2026-08-04T19:46:55Z","snapshot_observed_at":"2026-08-15T14:39:52.382355Z","submitted_at":"2026-08-04T19:46:55Z","title":"Structured Differentiable Optimization for Efficient Decision-focused Learning in Power Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T14:47:33.440169Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2608.04189"},"observation_digest":"sha256:03f40ae2606db0bcd764e1b3532e728139eaf1b460deb26dbb0a87643bda529c","observation_id":"3a0485bc-d38f-457a-ae99-269e6d642cba","resolution":{"observed_at":"2026-08-15T14:47:33.440169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1904.09043/citation-record","integrity":"/paper/1904.09043/integrity","json":"/paper/1904.09043/citation-record.json","paper":"/paper/1904.09043"},"outbound":[],"paper":{"arxiv_id":"1904.09043","last_updated":"2020-05-20T00:59:53Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T16:44:11.326772Z","submitted_at":"2019-04-19T00:33:25Z","title":"Differentiating Through a Cone Program"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:1904.09043."}