{"as_of":"2026-08-10T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea8d012550a178ee2751a1aa885152df5126ae1ed115507b2665c3c5813cd787","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:13:11.723312Z","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-04T06:19:37.385616Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-09T12:13:11.723312Z","title":"End-to-end constrained optimization learning: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02434","last_updated":"2025-05-26T16:16:03Z","snapshot_observed_at":"2026-08-09T18:51:18.913773Z","submitted_at":"2025-02-04T15:58:12Z","title":"mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T12:13:11.723312Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2502.02434"},"observation_digest":"sha256:ee5d8b817fb8fc9ce9667be3fba00eb5c15cbf9a5baec894503c7eb7fbce7bf5","observation_id":"5d165e36-1c8a-4627-9108-9335055b72ee","resolution":{"observed_at":"2026-08-09T12:13:11.723312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-07T14:22:50.186814Z","title":"End-to-end constrained optimization learning: A survey.arXiv preprint arXiv:2103.16378, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.186814Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ba0dacb901665b3c0d411523df958cec4bc87ada9d62f62f0edeb437e39b699f","observation_id":"894072b8-6bd7-449d-b58b-d6c69986da44","resolution":{"observed_at":"2026-08-07T14:22:50.186814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-06T21:44:28.512006Z","title":"Computer-Aided Civil and Infrastructure Engineering 39, 1452–1468","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.02961","last_updated":"2026-07-01T04:17:35Z","snapshot_observed_at":"2026-08-06T21:35:43.359533Z","submitted_at":"2025-06-30T06:42:23Z","title":"Flow-Through Tensors: A Unified Computational Graph Architecture for Multi-Layer Transportation Network Optimization","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T21:44:28.512006Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2507.02961"},"observation_digest":"sha256:290d07766b851185e38100fb10d78e35a49fb6eae48def902db7b47a16f1f89a","observation_id":"88055e05-e70b-4d0f-8ec9-d3361994bc82","resolution":{"observed_at":"2026-08-06T21:44:28.512006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-05T05:04:21.738965Z","title":"End-to-end constrained optimiza- tion learning: A survey.arXiv preprint arXiv:2103.16378, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05772","last_updated":"2025-09-06T16:54:07Z","snapshot_observed_at":"2026-08-05T05:04:21.171073Z","submitted_at":"2025-09-06T16:54:07Z","title":"Decision-Focused Learning Enhanced by Automated Feature Engineering for Energy Storage Optimisation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T05:04:21.738965Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2509.05772"},"observation_digest":"sha256:3f500e52296a0b35471d48cc7b5eded5f6cd82c94bc7d13d706708517d168543","observation_id":"6a942aff-da65-433f-87b2-93e2f141c2d5","resolution":{"observed_at":"2026-08-05T05:04:21.738965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-03T08:39:36.359340Z","title":null,"venue":null,"work_id":null,"year":2021},"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":103,"source":"pdf_text","source_observed_at":"2026-08-03T08:39:36.359340Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2601.16510"},"observation_digest":"sha256:fa073e46dab8364c5c3378aed58bee7ebe4eec3ac762c69097358251f2521d5a","observation_id":"e31d3d7b-9f4f-451b-97ba-66806ca23329","resolution":{"observed_at":"2026-08-03T08:39:36.359340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":"2103.16378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-07-04T06:19:37.385616Z","title":"The Sample Average Approximation Method for Stochastic Discrete Optimization","venue":null,"work_id":"72db3a46-d598-49f5-8dd6-5073f0228098","year":2021},"citing_paper":{"arxiv_id":"2605.08408","last_updated":"2026-05-08T19:13:15Z","snapshot_observed_at":"2026-07-06T23:20:38.385189Z","submitted_at":"2026-05-08T19:13:15Z","title":"AdamFLIP: Adaptive Momentum Feedback Linearization Optimization for Hard Constrained PINN Training","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-12T00:52:09.897086Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2605.08408"},"observation_digest":"sha256:677b90d6eb1ec7a732710bc2ac1e044e5a121ad0c3dbff3fedc34aecba31e652","observation_id":"0ccc57c2-2f81-4564-a108-6069c8708a88","resolution":{"observed_at":"2026-05-12T08:41:23.910599Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":"2103.16378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-07-04T06:19:37.385616Z","title":"The Sample Average Approximation Method for Stochastic Discrete Optimization","venue":null,"work_id":"72db3a46-d598-49f5-8dd6-5073f0228098","year":2021},"citing_paper":{"arxiv_id":"2605.14019","last_updated":"2026-05-13T18:32:44Z","snapshot_observed_at":"2026-07-06T23:25:29.856145Z","submitted_at":"2026-05-13T18:32:44Z","title":"Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T02:34:19.803167Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2605.14019"},"observation_digest":"sha256:d8b963eb48331862ab0e5c8d902c7adef2c57d3bd78e6bb49ee6eb8acd985d2c","observation_id":"f1878214-8b41-472d-b6c0-a6d98c89ab6d","resolution":{"observed_at":"2026-05-15T02:39:41.691105Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":"2103.16378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-07-04T06:19:37.385616Z","title":"The Sample Average Approximation Method for Stochastic Discrete Optimization","venue":null,"work_id":"72db3a46-d598-49f5-8dd6-5073f0228098","year":2021},"citing_paper":{"arxiv_id":"2605.28340","last_updated":"2026-05-27T11:43:27Z","snapshot_observed_at":"2026-08-08T18:49:05.235801Z","submitted_at":"2026-05-27T11:43:27Z","title":"Decision-focused learning for optimal PV-Battery scheduling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T09:56:30.448334Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2605.28340"},"observation_digest":"sha256:cbfafa1b928fb8b9509ade3dfc2d9661502fb9093a52ccf3f257123adf1ba850","observation_id":"c9b731d4-f817-419e-af23-bd5e47a1732e","resolution":{"observed_at":"2026-06-29T10:03:17.200506Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":"2103.16378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-07-04T06:19:37.385616Z","title":"The Sample Average Approximation Method for Stochastic Discrete Optimization","venue":null,"work_id":"72db3a46-d598-49f5-8dd6-5073f0228098","year":2021},"citing_paper":{"arxiv_id":"2606.21440","last_updated":"2026-06-19T14:02:01Z","snapshot_observed_at":"2026-08-07T08:57:52.454311Z","submitted_at":"2026-06-19T14:02:01Z","title":"Fusing Backdoors, Machine Learning, and Optimization for Large-Scale Parametric Mixed-Integer Programs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T14:41:53.912796Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2606.21440"},"observation_digest":"sha256:dbc924c1bc50e60bde43c403e97df570298b4a6e8807203faed687403c5383ce","observation_id":"ee17a5bb-1d7c-4763-9d75-4619d9b8e3a9","resolution":{"observed_at":"2026-07-04T06:19:37.387524Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-02T07:31:22.093056Z","title":"Kotary, F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20542","last_updated":"2026-07-10T21:31:00Z","snapshot_observed_at":"2026-08-04T07:34:09.607154Z","submitted_at":"2026-07-10T21:31:00Z","title":"Improving Access to Essential Medicines via Decision-Aware Machine Learning","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-02T07:31:22.093056Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2607.20542"},"observation_digest":"sha256:9edbe785a2b13cc67b4c76b5aecf1d25d0d37e0789abb30c0ac2e87f4643fa7a","observation_id":"b457ecb0-5123-4b9a-aa6a-d5da370d56c5","resolution":{"observed_at":"2026-08-02T07:31:22.093056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-07-30T13:42:10.559692Z","title":"End-to- end constrained optimization learning: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23751","last_updated":"2026-07-26T16:52:35Z","snapshot_observed_at":"2026-08-09T13:30:39.643825Z","submitted_at":"2026-07-26T16:52:35Z","title":"Soft-Constrained Optimization of Latent Space in Variational Autoencoders","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-30T13:42:10.559692Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2607.23751"},"observation_digest":"sha256:631a1fd8ef5b603133a4ecefb89bf530dd2e6bae1c152850ee2f638822a0398d","observation_id":"005744ff-b8a3-457b-be34-f5171ea23a83","resolution":{"observed_at":"2026-07-30T13:42:10.559692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-01T01:44:05.266290Z","title":"arXiv preprint arXiv:2103.16378 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.266290Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:6a87be343b30deb8a81914507c4c2c549ebb8474d45fbb3ceb8165b31acb7497","observation_id":"bac331cc-c440-4a0a-8b0f-7d7fbd0f7722","resolution":{"observed_at":"2026-08-01T01:44:05.266290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.16378/citation-record","integrity":"/paper/2103.16378/integrity","json":"/paper/2103.16378/citation-record.json","paper":"/paper/2103.16378"},"outbound":[],"paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2103.16378."}