{"as_of":"2026-08-19T06:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94e909ed97d701e17486d3a7cfaa2e71e41c985e85e5921595cee53ce78254d7","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:17:20.547913Z","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-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.16270/citation-record","integrity":"/paper/2504.16270/integrity","json":"/paper/2504.16270/citation-record.json","paper":"/paper/2504.16270"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.08937","last_updated":"2024-01-17T14:15:48Z","snapshot_observed_at":"2026-08-16T16:31:32.182748Z","submitted_at":"2022-09-19T11:43:30Z","title":"Limit theorems for mixed-norm sequence spaces with applications to volume distribution","version":2},"cited_work":{"arxiv_id":"2209.08937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.08937","snapshot_observed_at":"2026-08-16T11:17:20.641243Z","title":"Limit theorems for mixed-norm sequence spaces with applications to volume distribution","venue":"math.PR","work_id":"441f7131-0b71-465f-9ba1-0ad5a0dc5acb","year":2022},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.527711Z"},"links":{"cited_paper":"/paper/2209.08937","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:3d6f0bc76b86af5bb6181e57e852fd8165200f868f836adaae53f8f60387be29","observation_id":"a914bb28-572b-4f99-887a-5d3a54eabe45","resolution":{"observed_at":"2026-08-16T11:17:20.644846Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00669","last_updated":"2016-08-09T18:48:47Z","snapshot_observed_at":"2026-08-14T22:46:12.245474Z","submitted_at":"2015-06-01T20:42:28Z","title":"Concentration and regularization of random graphs","version":2},"cited_work":{"arxiv_id":"1506.00669","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.00669","snapshot_observed_at":"2026-08-16T11:17:20.618223Z","title":"Concentration and regularization of random graphs","venue":"math.PR","work_id":"35ab09e8-d075-468c-a50c-2878f318aabd","year":2015},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.533729Z"},"links":{"cited_paper":"/paper/1506.00669","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:ed9277e4b8e09948a2eb4d6d9b75a2e14001015022670ae966979d180f00a453","observation_id":"230993f3-e210-4135-8179-8101b04ea7e0","resolution":{"observed_at":"2026-08-16T11:17:20.621167Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.04539","last_updated":"2022-09-23T22:57:42Z","snapshot_observed_at":"2026-08-16T16:33:32.716580Z","submitted_at":"2022-09-09T22:07:25Z","title":"Spectral hypergraph sparsification via chaining","version":3},"cited_work":{"arxiv_id":"2209.04539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.04539","snapshot_observed_at":"2026-08-16T11:17:20.607234Z","title":"Spectral hypergraph sparsification via chaining","venue":"math.PR","work_id":"340f2a2c-ee54-4923-9550-2ffe312c6d3c","year":2022},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.537193Z"},"links":{"cited_paper":"/paper/2209.04539","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:f296f2bfd84fa4edd7b2394516f974fbdd2931e18d5f1535618573be3197c738","observation_id":"dc598150-40e8-49ca-8aaa-ae1f3fecfcfa","resolution":{"observed_at":"2026-08-16T11:17:20.610218Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07250","last_updated":"2022-06-15T02:22:09Z","snapshot_observed_at":"2026-08-19T05:24:55.307267Z","submitted_at":"2022-06-15T02:22:09Z","title":"Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes","version":1},"cited_work":{"arxiv_id":"2206.07250","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.07250","snapshot_observed_at":"2026-08-16T11:17:20.593463Z","title":"Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes","venue":"cs.DS","work_id":"34f434a1-8afe-4b63-9245-65fc04ca31a8","year":2022},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.540604Z"},"links":{"cited_paper":"/paper/2206.07250","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:150c2f825c9fd6a93291526aa3fad031dcde517e2cb7b06506cb9a82df346b29","observation_id":"9b6ca058-9598-425f-8e0b-acd7f191630e","resolution":{"observed_at":"2026-08-16T11:17:20.598778Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:17:20.906615Z","title":"[JS00] William Johnson and Gideon Schechtman","venue":null,"work_id":"e4d5dae8-d508-410c-8a88-5cd5f47b3191","year":1948},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":204,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.525105Z"},"links":{"citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:b27c1fa4a42e2c68946bc54811deb584ef1903b9d0e4a6d754d0d327ef92fb16","observation_id":"2162182f-3c13-433f-9363-8d20a3e18ee0","resolution":{"observed_at":"2026-08-16T11:17:20.909514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02353","last_updated":"2021-06-04T09:06:35Z","snapshot_observed_at":"2026-08-16T18:19:42.859579Z","submitted_at":"2021-06-04T09:06:35Z","title":"Spectral Hypergraph Sparsifiers of Nearly Linear Size","version":1},"cited_work":{"arxiv_id":"2106.02353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.02353","snapshot_observed_at":"2026-08-16T11:17:20.629206Z","title":"Spectral Hypergraph Sparsifiers of Nearly Linear Size","venue":"cs.DS","work_id":"671ac451-945a-4993-817a-cf66e7309665","year":2021},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":1170,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.530967Z"},"links":{"cited_paper":"/paper/2106.02353","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:7cdaf2fe50c5eaed690d2c3ef1c4ba242bd2e450ed1bcd9ff42c7776f9f31f84","observation_id":"87adcc76-5814-4a6c-a003-f00367db3c5a","resolution":{"observed_at":"2026-08-16T11:17:20.632572Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:17:20.513671Z","title":"[Dat14] Big Data","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.513671Z"},"links":{"citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:84149bf3bc857a5c9bab6a636cde19c1f2b5a2b9b00688768a94f088222a59de","observation_id":"81acf1c5-8615-4c82-81aa-b35f5f710544","resolution":{"observed_at":"2026-08-16T11:17:20.513671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.06733","last_updated":"2019-03-11T20:45:33Z","snapshot_observed_at":"2026-08-12T15:43:59.037380Z","submitted_at":"2017-08-22T17:31:54Z","title":"BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.06733","snapshot_observed_at":"2026-08-16T11:17:20.519150Z","title":"[GLDG19] Tianyu Gu, Kang Liu, Brendan Dolan-Gavitt, and Siddharth Garg","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.519150Z"},"links":{"cited_paper":"/paper/1708.06733","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:eacf3356a885e9f2e847bc5a1d2636bf19bdab3222164d4a00eb6cdd9ba93f65","observation_id":"7cc06722-b2bf-4fa8-b6c0-dcba6d4febe9","resolution":{"observed_at":"2026-08-16T11:17:20.519150Z","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":"2018.86359","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:17:20.801286Z","title":"[GC23] XingGaoandYuCheng.Robustmatrixsensinginthesemi-randommodel","venue":null,"work_id":"2cae8460-7c1d-40e8-acd8-ff373890cbc6","year":2018},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.516496Z"},"links":{"citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:d5dea792583fa3f23594a5a6126679ffdd1cffdd38b0a64dc88c466f5b40483c","observation_id":"51155c3a-3587-42f4-8daf-a180bfae0de0","resolution":{"observed_at":"2026-08-16T11:17:20.806684Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02954","last_updated":"2021-10-07T17:51:10Z","snapshot_observed_at":"2026-08-16T17:51:03.531592Z","submitted_at":"2021-10-07T17:51:10Z","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","version":1},"cited_work":{"arxiv_id":"2110.02954","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02954","snapshot_observed_at":"2026-08-16T11:17:20.875052Z","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","venue":"math.OC","work_id":"563f139f-7693-436c-a03c-af772397db8e","year":2021},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.510267Z"},"links":{"cited_paper":"/paper/2110.02954","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:e13d7262bcec2d3e959ea51b07759203832f85c6f7ac186cfc1539a10fee6ee1","observation_id":"25d932f6-1b39-425d-8e9a-d9e8a2e4625e","resolution":{"observed_at":"2026-08-16T11:17:20.878068Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.01848","last_updated":"2021-11-10T18:18:32Z","snapshot_observed_at":"2026-08-19T05:41:30.910161Z","submitted_at":"2021-11-02T19:10:19Z","title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.01848","snapshot_observed_at":"2026-08-16T11:17:20.522094Z","title":"[JLS23] ArunJambulapati,YangPLiu,andAaronSidford.Chaining,groupleverage score overestimates, and fast spectral hypergraph sparsification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.522094Z"},"links":{"cited_paper":"/paper/2111.01848","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:46d44f29b3c72b19cd5d830968a59eb71eeaf459a0df4896e9e68084147a3936","observation_id":"4f83eca0-1b01-4a7c-afce-af30327d893d","resolution":{"observed_at":"2026-08-16T11:17:20.522094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.05619","last_updated":"2023-06-06T08:05:14Z","snapshot_observed_at":"2026-08-16T16:09:26.275666Z","submitted_at":"2022-12-11T22:23:10Z","title":"Algorithms approaching the threshold for semi-random planted clique","version":2},"cited_work":{"arxiv_id":"2212.05619","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.05619","snapshot_observed_at":"2026-08-16T11:17:20.887847Z","title":"Algorithms approaching the threshold for semi-random planted clique","venue":"cs.DS","work_id":"afa4f617-881e-4df2-88da-a831aeed19ad","year":2022},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.507152Z"},"links":{"cited_paper":"/paper/2212.05619","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:829c6e9738486bc54327c2269b781c85c7fa49ad8fb03fa8c9ccb6b1a37441e7","observation_id":"15beeb72-97be-47fa-8c66-41a48a005c0c","resolution":{"observed_at":"2026-08-16T11:17:20.890617Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09460","last_updated":"2023-11-15T23:49:18Z","snapshot_observed_at":"2026-08-16T14:42:52.977572Z","submitted_at":"2023-11-15T23:49:18Z","title":"Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.09460","snapshot_observed_at":"2026-08-16T11:17:20.544162Z","title":"[MB21] Naren Sarayu Manoj and Avrim Blum","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.544162Z"},"links":{"cited_paper":"/paper/2311.09460","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:353351b2e84f100a2033ab85b84a985b32384528034943af3b048d38fa026a6a","observation_id":"80e64c2a-5702-402c-9066-460ebc3aa026","resolution":{"observed_at":"2026-08-16T11:17:20.544162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00146","last_updated":"2019-02-01T01:34:49Z","snapshot_observed_at":"2026-08-14T17:22:37.813705Z","submitted_at":"2019-02-01T01:34:49Z","title":"Agnostic Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.00146","snapshot_observed_at":"2026-08-16T11:17:20.547913Z","title":"why should I trust you?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":4625,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.547913Z"},"links":{"cited_paper":"/paper/1902.00146","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:22ed4849b65b9dba07f38391de53f06251c04cf5caeae14090e0d4e99bc28921","observation_id":"66ea5029-a750-4297-81be-3a8cc0b07d71","resolution":{"observed_at":"2026-08-16T11:17:20.547913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.09527","last_updated":"2020-11-18T20:18:50Z","snapshot_observed_at":"2026-08-16T19:04:51.432843Z","submitted_at":"2020-11-18T20:18:50Z","title":"Strong Data Augmentation Sanitizes Poisoning and Backdoor Attacks Without an Accuracy Tradeoff","version":1},"cited_work":{"arxiv_id":"2011.09527","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.09527","snapshot_observed_at":"2026-08-16T11:17:20.898157Z","title":"Strong Data Augmentation Sanitizes Poisoning and Backdoor Attacks Without an Accuracy Tradeoff","venue":"cs.CR","work_id":"b6a393cc-edbf-440d-9058-c80513d7c2b0","year":2020},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":6774,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.503117Z"},"links":{"cited_paper":"/paper/2011.09527","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:027fc172a8771de8ecae800b7c42a7fddcc4bdcf7d7b62e3eaf91b5bfffe2b1f","observation_id":"e6eeda20-f524-4694-a709-149b4e9506bc","resolution":{"observed_at":"2026-08-16T11:17:20.901132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T09:49:06.993675Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":8,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":15},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2504.16270."}