{"as_of":"2026-08-21T14:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c385e7c81303cba4747f244ee962c78b334fb4c7b9e88e60779915b80ac117d3","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:52:25.231249Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T05:26:06.829382Z","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-01T22:16:16.372237Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"cited_work":{"arxiv_id":"2501.14912","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.14912","snapshot_observed_at":"2026-07-01T22:16:16.372237Z","title":null,"venue":null,"work_id":"a15e7118-283d-4d7e-af6c-abdf047b707b","year":null},"citing_paper":{"arxiv_id":"2606.01557","last_updated":"2026-06-01T02:02:22Z","snapshot_observed_at":"2026-08-12T19:13:51.006010Z","submitted_at":"2026-06-01T02:02:22Z","title":"Everywhere Learning: Artificial Intelligence with Pointwise Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T15:34:51.581338Z"},"links":{"cited_paper":"/paper/2501.14912","citing_paper":"/paper/2606.01557"},"observation_digest":"sha256:0c7e90d47a036d7b3d54eb5e6b8181704c582c6afd0c644e39baaaf4d6ffc937","observation_id":"297d1a78-f8d3-45ec-9889-a899cc918659","resolution":{"observed_at":"2026-07-01T22:16:16.374382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14912","snapshot_observed_at":"2026-07-13T05:26:06.829382Z","title":"Feasible learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08968","last_updated":"2026-07-09T22:09:16Z","snapshot_observed_at":"2026-08-09T10:00:22.541985Z","submitted_at":"2026-07-09T22:09:16Z","title":"Every Sample Counts: Supervised Fine-Tuning of Language Models with Pointwise Constraints","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-13T05:26:06.829382Z"},"links":{"cited_paper":"/paper/2501.14912","citing_paper":"/paper/2607.08968"},"observation_digest":"sha256:7e41dd7f964c6f70eab6d8981d61701e07e57c875fe669eabe71d6a0c180ac1a","observation_id":"d136d787-d87b-45b3-8129-88f75475e84a","resolution":{"observed_at":"2026-07-13T05:26:06.829382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.14912/citation-record","integrity":"/paper/2501.14912/integrity","json":"/paper/2501.14912/citation-record.json","paper":"/paper/2501.14912"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:52:25.069529Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.069529Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:f3c4fb6cd8c7d0ee7dead39909ffeb87a4775b73efc8ea59d5bafeb28d27b395","observation_id":"0bb5a175-9264-4720-9686-114c9066f112","resolution":{"observed_at":"2026-08-10T14:52:25.069529Z","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-10T14:52:25.815570Z","title":"A Closer Look at Memorization in Deep Networks","venue":null,"work_id":"1c0a08c7-ed46-449b-b194-9ba5729f5c65","year":2017},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.074837Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:db46732517117504fec7bb94ca413de97d2ad3645140aad6ce273965434eae66","observation_id":"7d2f492e-e9bc-4b59-a630-b2f7686bdf4b","resolution":{"observed_at":"2026-08-10T14:52:25.819359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.803970Z","title":"Arrow, L","venue":null,"work_id":"c7b382f1-67c2-4aa2-b0eb-318232939000","year":1958},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.079350Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:91ef8182dc3e3b6dcbb78c2ba25b113bbfb4f0eec148e5904263c3fb5652c254","observation_id":"b1d41d03-1f0d-47c7-baa4-ee73dcae2572","resolution":{"observed_at":"2026-08-10T14:52:25.807907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.791602Z","title":"Conformal Prediction for Reliable Machine Learning: Theory, Adaptations and Applications","venue":null,"work_id":"a96ef077-3ffc-40bd-a4ff-f460753689bd","year":2014},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.083642Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:aa0ec8f97d1de9195760184a6044b866efa4212e669af1b460f4e300a7f06df5","observation_id":"1f001cfc-b1f5-4d96-a7c0-72f20074c864","resolution":{"observed_at":"2026-08-10T14:52:25.795396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.778235Z","title":"Improving Image Generation with Better Captions","venue":null,"work_id":"88b08b1b-b40e-475c-866b-fe59ae77115a","year":2023},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.087894Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:6a2fadf7979ca9ed638095df3b3544510e7bcd0bf177f7a255fadca4fa21503a","observation_id":"3e40183b-083e-4ef7-8d3c-3f342fd2d9e7","resolution":{"observed_at":"2026-08-10T14:52:25.782474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.765847Z","title":"Convergence Rates in Forward--Backward Splitting","venue":null,"work_id":"12dca056-282b-4f97-a7bc-500b719e46db","year":1997},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.091879Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:d9656b83a9a36a067d8e82d585616f38e7a93e7ec4280f10d74d5701ff617639","observation_id":"673170e1-8787-4e2f-8027-3e9e9ea7ea90","resolution":{"observed_at":"2026-08-10T14:52:25.769998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.753963Z","title":"Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals","venue":null,"work_id":"c16999ee-9915-4354-9ad4-c97f4a4f18d8","year":2019},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.095922Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:f52892ca56c78338863acc518fda7dff8a8525588d10a9d0106dea1b1732974e","observation_id":"92a5c594-e00f-4c29-a374-e1fc5ecef153","resolution":{"observed_at":"2026-08-10T14:52:25.758138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.741907Z","title":"An Algorithm for Quadratic Programming","venue":null,"work_id":"8d7cca26-130a-423a-a8c5-f877b5f6e511","year":1956},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.100401Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:8daa93e3e37fb6507cef7ab12d91ab83bb9aeacf70bfe9c0fffaf4a0213d8eff","observation_id":"44370744-bb6d-41ac-b0e4-6a92af5f1104","resolution":{"observed_at":"2026-08-10T14:52:25.745867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.728726Z","title":"Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraints","venue":null,"work_id":"96e5bf25-1e97-485e-8b20-455228ce55fa","year":2022},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.104117Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:8e09cba2cbc442824ecc7a981ec3063475043e9e6d5f3b9e755e700c11ce9efa","observation_id":"08f976fb-7258-4a55-97d0-d12ae5780544","resolution":{"observed_at":"2026-08-10T14:52:25.732520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.716333Z","title":"Cooper: A Library for Constrained Optimization in Deep Learning","venue":null,"work_id":"3a0747eb-079d-4862-b8d9-b723d0fa4efd","year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.107912Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:28a7a542199c502099ea4860005206e9c1fc468a4b888eec41821d9f602273b5","observation_id":"ea10efac-b9f8-4d3a-b721-c3953db30e12","resolution":{"observed_at":"2026-08-10T14:52:25.720528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.703888Z","title":"Convex Programming in Hilbert Space","venue":null,"work_id":"a471aad7-0bef-459e-bfe4-af2f31d522c5","year":1964},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.111752Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:cf91ac511b6d15151e4a63f520b2d7e901b93e9ae1b6d836fb65680434685c79","observation_id":"85caed97-38f3-45aa-8690-c9ddac6e1d9f","resolution":{"observed_at":"2026-08-10T14:52:25.707799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.690924Z","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","venue":null,"work_id":"4b62b4e8-e85c-45cb-a438-5c158c9b7f2b","year":2018},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.115997Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:3fdf460ab0079828230146caf4b907ba5c5ffa43d73a2be87a3c6e325c52fde6","observation_id":"b577bb0b-387b-4e9d-b368-5f7fa0615141","resolution":{"observed_at":"2026-08-10T14:52:25.695341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.678850Z","title":"Deep Residual Learning for Image Recognition","venue":null,"work_id":"624a4b58-9696-4c6a-be60-6325a55a8e40","year":2016},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.119830Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:e92e84e445aee6ed8b9b948099fb582203f42ea13bfd427866183e6481b8af6f","observation_id":"8832c81a-c11d-480c-a9c2-b6cfde9c0a03","resolution":{"observed_at":"2026-08-10T14:52:25.682591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.667588Z","title":"Resilient Constrained Learning","venue":null,"work_id":"645b48d0-93bd-49a1-837a-cfd12be8dfe8","year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.123452Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:00a8f94e9c5fc7df31ed51961524d8ab5574821ce3cd0cc4f27d826e9eeb512e","observation_id":"6530e9bd-e70a-4a18-9405-2cbd4dcc3d23","resolution":{"observed_at":"2026-08-10T14:52:25.671303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.655921Z","title":null,"venue":null,"work_id":"9d424e64-c25c-4ff9-acea-09e983d5fd8a","year":1957},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.127055Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:21fdf47ea2cee3579803aceaa096e05e64b896ecf76ba1dadb636c1fa0fe3f64","observation_id":"22eda168-fa46-4597-bb13-e4cedc25d1d5","resolution":{"observed_at":"2026-08-10T14:52:25.659787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.643772Z","title":"Adam: A Method for Stochastic Optimization","venue":null,"work_id":"7bfd6d85-c90d-4c39-90da-0c7b4c7d84bc","year":2015},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.130857Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:53e71e9a3c3a81eef8d2f6a15cf9d667648bac108586db5fd301edd8f4cdebfb","observation_id":"03e9ca26-9d24-49d1-970f-ae11eb594dde","resolution":{"observed_at":"2026-08-10T14:52:25.647726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.630560Z","title":"Learning Multiple Layers of Features from Tiny Images","venue":null,"work_id":"b52e42d7-3d5c-406e-a883-28f6c302d6f3","year":2009},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.134366Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:820290c905f6be16c3f21c58f537d8bd42e6ae52a12aa3908ff077da963f9c7c","observation_id":"bccb135a-ff04-4d44-9a60-7b88b706fbac","resolution":{"observed_at":"2026-08-10T14:52:25.634463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.618194Z","title":"Lahoti, A","venue":null,"work_id":"27b07639-8096-416e-812b-fba54a059c36","year":2020},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.137937Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:1d670fa2fda52c33ee6975c48d689d27582ad954136ad2f42f0de8e8dce92578","observation_id":"eb67063b-df61-4af5-8571-26998d7a700b","resolution":{"observed_at":"2026-08-10T14:52:25.622503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.605287Z","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","venue":null,"work_id":"c8586572-82c1-4dbe-8e80-d32de5f54fbe","year":2020},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.141399Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:2ba3e81190543e89b9dc9eb1ba931d2cf799525cbbc5b87019a2b99ed1743ea2","observation_id":"685d9354-25f1-4274-b248-b16ecb3de2f2","resolution":{"observed_at":"2026-08-10T14:52:25.609083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-10T14:52:25.145045Z","title":"The Llama 3 Herd of Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.145045Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:c03e0e5f5cccfb8fd754d18286e321c65b3aa7b53440927875eea933022a8c2b","observation_id":"a64411a0-4ee1-4672-b31a-c310f0731b2c","resolution":{"observed_at":"2026-08-10T14:52:25.145045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06083","last_updated":"2019-09-04T18:53:10Z","snapshot_observed_at":"2026-08-07T14:27:46.872660Z","submitted_at":"2017-06-19T17:53:11Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06083","snapshot_observed_at":"2026-08-10T14:52:25.149418Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.149418Z"},"links":{"cited_paper":"/paper/1706.06083","citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:5acf8aa438ef579ae5a182ec32acc3cd85a7c8684833246d9f97fcf370d86241","observation_id":"fccf5c56-98cd-44fa-8a0b-d3b2abecaff8","resolution":{"observed_at":"2026-08-10T14:52:25.149418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-10T14:52:25.153738Z","title":"GPT-4 Technical Report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.153738Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:c18915a0ea8d2075768604ac5d210e0d72bee08c9da26ceb36a87dfc201740db","observation_id":"e73f64b7-59b2-4732-acde-b394a139ca6c","resolution":{"observed_at":"2026-08-10T14:52:25.153738Z","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-10T14:52:25.592928Z","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","venue":null,"work_id":"d69d3422-9a2e-41a4-bbc2-7f1ce67b6fbe","year":2019},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.157712Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:43cc7b140cfa3f245f660dd8534f799924524b38413b0262dc683e3b32b02218","observation_id":"06506caa-0ce3-4ca4-bf0b-411097ba92d5","resolution":{"observed_at":"2026-08-10T14:52:25.596798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.580371Z","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","venue":null,"work_id":"c66870c5-5116-465f-b428-a0cd5cb22ec9","year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.161545Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:6b33be0321612c43a62879f61f7e56725e908671fa3112bad8e0c25a57fc7469","observation_id":"1957e6d0-ec08-437e-97b4-00aa818001ae","resolution":{"observed_at":"2026-08-10T14:52:25.584189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.567016Z","title":"Zhang, Simon Lacoste-Julien, and Jose Gallego-Posada","venue":null,"work_id":"b39a6bc7-dc58-400b-ba4b-63f6b8f8f91b","year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.165275Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:171919251353b9d2a67fe2b917748cf1888e1864b1dfbe394d89a123958070fc","observation_id":"ca9e4a56-b062-4032-abef-e891e56a4915","resolution":{"observed_at":"2026-08-10T14:52:25.571369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.555383Z","title":"The Implicit Bias of Gradient Descent on Separable Data","venue":null,"work_id":"4ae3de82-ebba-480f-a192-1c9ccd4aedc5","year":2018},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.168931Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:ae0a8172b3f1fe59f624b02a41c193738fc8268948a89e003e634c96e98de5c1","observation_id":"2a52d6cd-62a6-4035-abdc-c5cf5ed9868a","resolution":{"observed_at":"2026-08-10T14:52:25.559319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.541733Z","title":"Responsive Safety in Reinforcement Learning by PID Lagrangian Methods","venue":null,"work_id":"81627acf-166f-418a-9e58-b3bd97e745d4","year":2020},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.172923Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:1424ed95de60b6a7e913e7171bbffad5a2dd1c8d5c2236f4933bd7d36b3d1169","observation_id":"5d8ec05b-f47a-4b63-afd6-3964ddf93b18","resolution":{"observed_at":"2026-08-10T14:52:25.545501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.527740Z","title":"Neyman-pearson classification: parametrics and sample size requirement","venue":null,"work_id":"9428c2cb-7400-4764-9508-97079292fb50","year":2020},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.176689Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:02354b4d33962f28d80ed0b50914feedda7a08f9ae948a8e8934d0be20b4227c","observation_id":"be22d074-2b94-4ff5-a2d2-9c830ec1421b","resolution":{"observed_at":"2026-08-10T14:52:25.532509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.515225Z","title":null,"venue":null,"work_id":"7c2f3573-f8ab-41ac-abef-556eeafcd111","year":1991},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.181199Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:83dc02a24734e26afb9804ccb9a54e5c8d1f73f4919d8fdbd196760011cdd6c5","observation_id":"51002b7e-56b1-4ed2-879a-34d3170f0f5d","resolution":{"observed_at":"2026-08-10T14:52:25.519045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.502120Z","title":"Statistical Learning Theory","venue":null,"work_id":"c5833494-2c20-4a82-8943-6890666c0a81","year":1998},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.185216Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:48c4539c4bceea28ce2018283d65bdb71a78609b228a7645848399584068aded","observation_id":"52ef3454-8e2b-4561-af77-482c3d7abafa","resolution":{"observed_at":"2026-08-10T14:52:25.506002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.489316Z","title":"Understanding Deep Learning Requires Rethinking Generalization","venue":null,"work_id":"c6d4a699-e48a-4f78-ac9a-deb5286a7c5e","year":2017},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.189044Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:05bdc5334aa3861cdb8a6693237e829b62ef8231c64d68374e5c025749121e1f","observation_id":"a6f0af27-3f06-4f90-87b0-7f6cc1e5cf33","resolution":{"observed_at":"2026-08-10T14:52:25.493012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.475812Z","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","venue":null,"work_id":"8ab6ec36-4558-4c7a-8384-ee0346798b84","year":2022},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.193070Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:378e6067e52c09eed10b8e1fa21331cb88d9ee05845dfbf8a4532126fc7e768f","observation_id":"3a8b8b3d-378b-4607-90a3-93f2d3af54e7","resolution":{"observed_at":"2026-08-10T14:52:25.480265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.462903Z","title":"Age Progression/Regression by Conditional Adversarial Autoencoder","venue":null,"work_id":"0e894dba-e801-492c-9441-14627543ce0c","year":2017},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.196736Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:2bdf45c0e004b0ce5a4694ac6e942a31c23370afea9e46f3d5bf2be8c4f985b5","observation_id":"474cdea0-c4b6-49c2-b40b-9fe847c2a01d","resolution":{"observed_at":"2026-08-10T14:52:25.467218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.450380Z","title":"Convex Optimization","venue":null,"work_id":"14d7f9f2-67f1-4451-b7b2-efe1ea626c0b","year":2004},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.200233Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:463a2bffd03933053ba9fab3a8fe33336f74b73268e2f9b0981b87d93467f52b","observation_id":"66e3ed3e-b62f-4b60-9c37-c257ff56e54e","resolution":{"observed_at":"2026-08-10T14:52:25.454498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.436101Z","title":"Rank Analysis of Incomplete Block Designs: I","venue":null,"work_id":"88bec5c1-8e7e-473e-b662-8f818927ee15","year":1952},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.204304Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:491740043972ec23365c0f7104722b0ac6334e4cbe629e92bb74694b5a42e62a","observation_id":"8f5cf443-3316-4792-8623-ad147a7544c2","resolution":{"observed_at":"2026-08-10T14:52:25.440847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.421298Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","venue":null,"work_id":"0a0f9b4d-e67e-4198-a901-b484b67dad6a","year":2024},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.208252Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:0dfb0796235dda57b60e3013166b03c48b3aa9f5dd0d7ec3de762e0cff81cd43","observation_id":"89dbf550-9f2f-474b-b184-2c1f55c3e26e","resolution":{"observed_at":"2026-08-10T14:52:25.425517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.408871Z","title":"Convex Analysis and Minimization Algorithms I: Fundamentals","venue":null,"work_id":"053be87a-4c2a-45a5-b667-2bf3432ded8e","year":1996},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.212219Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:a0e4724616a3613310f039a770241443aad7160c0af8e76c17d7f637dae21db6","observation_id":"487437dd-9a9b-4682-97bc-5965cb670790","resolution":{"observed_at":"2026-08-10T14:52:25.413199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.396151Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","venue":null,"work_id":"ccb06d44-2ce5-4f35-8d8b-09d0a78f5816","year":2022},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.215774Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:806b5b9969a65f2081e58f040ffa4e6dc5c2b6f952c84c2fd4a896f846b80420","observation_id":"c6f70048-b6e3-4780-af18-69eff99783fb","resolution":{"observed_at":"2026-08-10T14:52:25.400189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.219653Z","title":"A Survey of Reinforcement Learning from Human Feedback","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.219653Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:e8f15f47d1eb4f6387cfde58c05984778ffc8c2df4b6dd30487cd41667ae7218","observation_id":"6dee78e8-a0b5-4c36-896f-414c4c98856e","resolution":{"observed_at":"2026-08-10T14:52:25.219653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02707","last_updated":"2023-06-05T08:58:39Z","snapshot_observed_at":"2026-08-09T03:29:22.849759Z","submitted_at":"2023-06-05T08:58:39Z","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02707","snapshot_observed_at":"2026-08-10T14:52:25.223325Z","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.223325Z"},"links":{"cited_paper":"/paper/2306.02707","citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:78186f218e64606573b4017acccdfc4539c11fd1baed50c583b1578b76b6aa85","observation_id":"9f785f28-bddf-4c16-a8e7-6a3be28d079b","resolution":{"observed_at":"2026-08-10T14:52:25.223325Z","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-10T14:52:25.383521Z","title":"Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem","venue":null,"work_id":"9164efff-8e63-472c-968a-a79dc8f376d0","year":2021},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.227508Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:c815f6cb5b6b8addb80b764b3bd3b2022e111b9da844897b9cdf5babffe84caf","observation_id":"14ed168f-d457-43e1-ae63-cadf25a818aa","resolution":{"observed_at":"2026-08-10T14:52:25.387465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T14:52:25.367799Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":"bd22f803-3462-47a6-91be-67a60748ac8d","year":2022},"citing_paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T14:52:25.231249Z"},"links":{"citing_paper":"/paper/2501.14912"},"observation_digest":"sha256:c869a09982eb0c9109119e84c01d7f41271e2d57dce0e1705b31178e82ecab84","observation_id":"a53380fb-8838-4f06-8420-344796839c6e","resolution":{"observed_at":"2026-08-10T14:52:25.373640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14912","last_updated":"2025-01-24T20:39:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T00:58:42.504005Z","submitted_at":"2025-01-24T20:39:38Z","title":"Feasible Learning"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":42},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 2 inbound Pith citation observations for arXiv:2501.14912."}