{"as_of":"2026-08-23T15:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0d03b93dca17e8751afd306407d544986c584dd6d40b094102ef2b2dbba16ab","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:58:52.497022Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2608.12757/citation-record","integrity":"/paper/2608.12757/integrity","json":"/paper/2608.12757/citation-record.json","paper":"/paper/2608.12757"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:53.209236Z","title":"Distributed majorization-minimization for Laplacian regularized problems,","venue":null,"work_id":"550a4ffc-2cc2-49a9-92f4-57383d571079","year":2019},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.321724Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:9a0a43a7c9066559628e00e09c728db77bde0c04eeba2fd75d63f60e9b026bb3","observation_id":"ea2f7b92-d9d4-4e87-9dd0-f09e68b9aef1","resolution":{"observed_at":"2026-08-15T23:58:53.212650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.197479Z","title":"Laplacian regularized low-rank represen- tation and its applications,","venue":null,"work_id":"a33da53e-4727-4ed3-a811-fc39726fffdc","year":2016},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.325651Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:225f499f704ea7ff02e5ed24d58a8d3eeaea24e38eed1e6ff89a208259d030ad","observation_id":"2aa6dc77-4d30-453c-af54-b1960233e3b5","resolution":{"observed_at":"2026-08-15T23:58:53.202259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.186103Z","title":"Semi-supervised ranking on very large graphs with rich metadata,","venue":null,"work_id":"9c101431-cf2d-4bf0-88ca-3adef96c115a","year":2011},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.329047Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:480643e03401edadd28d17e57099f0c8525c474c267d5e3f681cb72c86a6fbb9","observation_id":"ff02d519-5cbb-4e26-84c1-cdde8549aee3","resolution":{"observed_at":"2026-08-15T23:58:53.189875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.174732Z","title":"Representing docu- ments through their readers,","venue":null,"work_id":"1c4e7207-ec19-444e-9d37-d93ae312108e","year":2013},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.332236Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:a48da84ebfbc620149f682f9c8e88d5143e9f8ea941ea2c41ae69fd401db4820","observation_id":"2a6d619f-dda1-4c0c-8a91-c9151c7b15e3","resolution":{"observed_at":"2026-08-15T23:58:53.179285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.163360Z","title":"A graph Laplacian regular- ization for hyperspectral data unmixing,","venue":null,"work_id":"095c4048-610e-4efe-91b3-185160354853","year":2015},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.335937Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:30a4d22cd2e223d6483902da6e5eb068cfe5e7b43bb82869684c9870cd2852ba","observation_id":"38410fb0-176b-4128-b53e-3aed69310898","resolution":{"observed_at":"2026-08-15T23:58:53.167780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.151981Z","title":"Graph regularized nonnegative matrix factorization for data representation,","venue":null,"work_id":"94546346-1266-4aea-b3f7-937761b5dc6b","year":2010},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.339229Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:f5e3db26f720c6549b292e8c7a793bd77fd53640e5d1752405a1d56a0d32856d","observation_id":"ceff8516-79fd-4f4f-aa8c-8e6912dd5edb","resolution":{"observed_at":"2026-08-15T23:58:53.156666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.141147Z","title":"Laplacian regularized nonnegative representation for clustering and dimensionality reduction,","venue":null,"work_id":"64519d79-11c5-4099-9a44-f51ea19d8353","year":2020},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.342702Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:6d14d28c5bb5fd311db91900e725cd3925b9870eefc4a69245787057fdee3cda","observation_id":"ba99fc32-4b2e-4436-ae65-acf0eb3f3d91","resolution":{"observed_at":"2026-08-15T23:58:53.145021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.345930Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.345930Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:e169ff794d3f9b7c721a8cd5f550b6816bc28486f44c94f7bc6b71e973bea2ef","observation_id":"dcc8b562-41aa-4445-9e3d-102c731a199a","resolution":{"observed_at":"2026-08-15T23:58:52.345930Z","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-15T23:58:53.124596Z","title":"Incremental computation of pseudoinverse of Laplacian,","venue":null,"work_id":"7667223c-bafe-4eda-a3e9-afec6bab08cf","year":2014},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.349040Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:b298f180c1a14ee10ab10f89a4a132007b638366ad0267eee5ae051c8f0eb3ef","observation_id":"2d324787-621b-4af5-b2f4-b590835b04a3","resolution":{"observed_at":"2026-08-15T23:58:53.128092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.114663Z","title":"Maintainability and scal- ability in machine learning: Challenges and solutions,","venue":null,"work_id":"10a5420b-1578-449a-ba3b-5a7b6b3c0ff6","year":2025},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.352221Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:4984ce26d4fd80250fcb422799e4d9eb152f975a9ba42b9316fcbd772614ef66","observation_id":"191f6881-45ad-427d-b28e-54ae58d95aad","resolution":{"observed_at":"2026-08-15T23:58:53.118081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.104180Z","title":"Wavelets on graphs via spectral graph theory,","venue":null,"work_id":"d32c2e3c-b960-4cf3-8130-a5b724356419","year":2011},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.355344Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:6f86c9f19b299b9f4071e923ea6b5dc7e08fdb4ceb6ee7e3e158453612149ff0","observation_id":"4367e388-4c7f-4053-8c99-7eed513ae823","resolution":{"observed_at":"2026-08-15T23:58:53.107660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.094358Z","title":"Dis- tributed signal processing via Chebyshev polynomial approximation,","venue":null,"work_id":"6395ac09-bf4d-4d54-8692-27ab4b830304","year":2018},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.358705Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:3b3c5d55ee6d22358a96980039cbef07a31316de5d46f95329dcc93502368669","observation_id":"5213af12-955d-4b0d-8985-cdb0ba8e2f32","resolution":{"observed_at":"2026-08-15T23:58:53.097950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.083410Z","title":"Iterative polynomial approximation algorithms for inverse graph filters,","venue":null,"work_id":"bb94c8e3-b0a1-4bb5-885f-541f057c6ac1","year":2025},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.361871Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:40db652e88c55db5a7feae7c9a17c759cfad139547a7ac6d1ef5767a71a011ef","observation_id":"c44f03cc-17eb-4d0d-a0ff-0097150da05f","resolution":{"observed_at":"2026-08-15T23:58:53.087433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.073164Z","title":"Graph convolutions enrich the self-attention in transformers!","venue":null,"work_id":"97605a7e-b619-4f4f-bf0c-e4486e5db5b6","year":2024},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.364637Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:8750a1dfbb45bfe7bbabd1b1783cc18aec3ff053cf7c23a763fad98428fd2347","observation_id":"a8349594-efbc-411b-b3fd-8a6a06737981","resolution":{"observed_at":"2026-08-15T23:58:53.076577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.062345Z","title":"Learning spectral graph transforma- tions for link prediction,","venue":null,"work_id":"18d0e253-2095-4042-81c2-6da165782151","year":2009},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.367645Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:13de78c06001e0897b7d4da3b36e77af13d124d61bc3b258f7918af9937d9bdb","observation_id":"2310c029-7ed0-428f-8493-e280b2b110a0","resolution":{"observed_at":"2026-08-15T23:58:53.066185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.051231Z","title":"Learning the kernel via convex optimization,","venue":null,"work_id":"498111bf-d1c2-4776-a77c-8d5af98b4e75","year":2008},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.371521Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:d4c02a278c21a57273b1630e592968d383455b5fd0a8fcd70d6679ed5726bb1e","observation_id":"c5039071-b6da-4af0-9d97-318cbc8c0622","resolution":{"observed_at":"2026-08-15T23:58:53.055246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.039665Z","title":"Graph learning,","venue":null,"work_id":"10014d76-e743-4f81-a4f8-d86d82534140","year":2026},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.374625Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:57590bd422834dccb13ed7c615d2a3f1281385890effb93d6e0e06e46453144d","observation_id":"39670cbf-ee30-45bd-9597-7402daafd483","resolution":{"observed_at":"2026-08-15T23:58:53.043217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.028101Z","title":"Duality in DC (difference of convex functions) optimization. Subgradient methods,","venue":null,"work_id":"d8504578-364e-4b03-adc6-3cb2f3bbcf51","year":1988},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.377501Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:b4de7d15c09ff91ab2ca6685ce6b0c875e7b9b0fbb0fee862fab18762b9b373f","observation_id":"777dd9af-8ec1-4f75-b30e-3cbf9cab18d8","resolution":{"observed_at":"2026-08-15T23:58:53.032323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.380465Z","title":"Disciplined convex-concave programming,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.380465Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:26508a632d3e45dffa40219eca214c0f9e919ac022b89c0e8b3b9fd9f0188d95","observation_id":"14bf5f03-239e-4cab-9980-ce62a719304f","resolution":{"observed_at":"2026-08-15T23:58:52.380465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02001","last_updated":"2023-06-03T04:50:51Z","snapshot_observed_at":"2026-08-17T13:49:12.677998Z","submitted_at":"2023-06-03T04:50:51Z","title":"A globally convergent difference-of-convex algorithmic framework and application to log-determinant optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02001","snapshot_observed_at":"2026-08-15T23:58:52.383649Z","title":"A globally convergent difference-of-convex algorithmic framework and application to log-determinant optimization problems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.383649Z"},"links":{"cited_paper":"/paper/2306.02001","citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:9262bb2e548d4e49a4521e208a892a43a549f9b5ef6abe53b01c59fb8930798d","observation_id":"fe2a435a-126f-46a6-9aa5-54afd3304429","resolution":{"observed_at":"2026-08-15T23:58:52.383649Z","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-15T23:58:53.011470Z","title":"Minimizing oracle-structured composite functions,","venue":null,"work_id":"7a0389d2-7a97-4e86-b3d4-505f8206ed74","year":2023},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.388047Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:87023f1577dd8d2c1d8da5a90f05295d67cf11d8dd645c37660ac9ad8dc22f20","observation_id":"b5c768e0-bdd3-4156-a6d3-2c6100e9ead9","resolution":{"observed_at":"2026-08-15T23:58:53.015170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:53.000003Z","title":"Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate,","venue":null,"work_id":"c2d26360-4d2c-4269-8aad-0c74a151cf29","year":2025},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.391214Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:d4ae94a5804019e2bd04dbaf25228bb5dc46ea711b748f80c3e52eec9563ece7","observation_id":"2b4a2364-9eed-4f8c-897d-1f76d2b0b773","resolution":{"observed_at":"2026-08-15T23:58:53.004038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.986787Z","title":"Direct-optimization-based DC dictionary learning with the MCP regularizer,","venue":null,"work_id":"a51caac0-b34f-482b-9ea2-ba6d22ab8a33","year":2021},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.394745Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:bf2b7304edbe8371575940ec47ce403da7f32eebf34fce39d4daa0d77667b383","observation_id":"4a45bee4-bf6c-4844-9857-3a7e5a687a6a","resolution":{"observed_at":"2026-08-15T23:58:52.990934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.973958Z","title":"A DC optimization algorithm for solving the trust-region subproblem,","venue":null,"work_id":"0818758c-240c-43ad-a10c-e806803ba1fe","year":1998},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.397878Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:c4d2eedf5844df5f3ff6c06f6ddbfb1e72572a982d8498949c3973396fc5167d","observation_id":"169e6962-b63c-41ab-a9bb-378269f4e105","resolution":{"observed_at":"2026-08-15T23:58:52.978135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.400758Z","title":"Duality in nonconvex optimization,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.400758Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:d7062a2de8a5aafdf6a8d3a05a100bdbe1dedbc9404458676aa5945fadb29a7f","observation_id":"2b680b2a-39c5-40c5-98e7-d275a33167ef","resolution":{"observed_at":"2026-08-15T23:58:52.400758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.403776Z","title":"The concave-convex procedure,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.403776Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:01239f36b62a324b8072877e819e52d7543d05cefd6d996791f10f6574440543","observation_id":"a16e5309-f076-4d9c-9bf7-7ba1d19ec061","resolution":{"observed_at":"2026-08-15T23:58:52.403776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.407601Z","title":"Variations and extension of the convex–concave procedure,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.407601Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:48027602d9b054b1bfbbb9fb4bb2360b6eeece0b1d4e8d71447140f2e5e8fdd3","observation_id":"940ac22d-db51-46ed-ab84-620855b9e77a","resolution":{"observed_at":"2026-08-15T23:58:52.407601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.411582Z","title":"The concave-convex procedure (CCCP),","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.411582Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:77c4c4129d4020eacf8e42f099070d7f0d2912c1e9479bc7083eb15a23b0bbd9","observation_id":"b027ce80-6f13-4e6f-85b3-5cc7811856bb","resolution":{"observed_at":"2026-08-15T23:58:52.411582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.25138","last_updated":"2026-04-28T02:27:40Z","snapshot_observed_at":"2026-08-13T09:27:32.512156Z","submitted_at":"2026-04-28T02:27:40Z","title":"Accelerating Regularized Attention Kernel Regression for Spectrum Cartography","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.25138","snapshot_observed_at":"2026-08-15T23:58:52.414924Z","title":"Accelerating regularized attention kernel regression for spectrum cartography,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.414924Z"},"links":{"cited_paper":"/paper/2604.25138","citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:b5e4aabf41dd6657eaf02ccc20003bfda9c4fcc9745c2086fe335a22668d6faa","observation_id":"0c076383-e052-42bf-817e-548a58e25ae0","resolution":{"observed_at":"2026-08-15T23:58:52.414924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14606","last_updated":"2026-08-03T02:53:27Z","snapshot_observed_at":"2026-08-16T14:07:35.095735Z","submitted_at":"2024-03-21T17:55:16Z","title":"The Elements of Differentiable Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14606","snapshot_observed_at":"2026-08-15T23:58:52.418280Z","title":"The elements of differentiable program- ming,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.418280Z"},"links":{"cited_paper":"/paper/2403.14606","citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:50b052d28fcdee5c4dff010ee3a5537d78dec6f59634101ec80c09419efe7609","observation_id":"275cc612-8b24-4a4e-965e-6b5316a3a111","resolution":{"observed_at":"2026-08-15T23:58:52.418280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.16510","snapshot_observed_at":"2026-08-15T23:58:52.421634Z","title":"Learning to optimize by differentiable programming,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.421634Z"},"links":{"cited_paper":"/paper/2601.16510","citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:333faf6d134233d5a0071f0ae0df7acfcfcced451dd8573fd0a9c593b3c78f0f","observation_id":"e475ec58-a0ca-4db8-94de-1d4584f1615e","resolution":{"observed_at":"2026-08-15T23:58:52.421634Z","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-15T23:58:52.937225Z","title":"A multivariate regression approach to association analysis of a quantitative trait network,","venue":null,"work_id":"97cc3099-5de8-430b-a6c1-8c51e9a2179a","year":2009},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.424982Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:dc5134980055405c0dba4f8ab9247608114ff3247cfbaf16bf08f008f6a58707","observation_id":"f10dc339-ce0e-4fa9-b06f-c83b57754daf","resolution":{"observed_at":"2026-08-15T23:58:52.940503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.927254Z","title":"Smoothing proximal gradient method for general structured sparse regression,","venue":null,"work_id":"0005bdda-e43e-47de-b1b4-f3e7ba969aad","year":2012},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.428528Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:c7f5b4c33f316ba4becf3260803c7733841578a4febd29cf817ae728193f8282","observation_id":"81bdc2bc-e399-4412-8a1b-a905572d677c","resolution":{"observed_at":"2026-08-15T23:58:52.930823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.917199Z","title":"Generalized Laplacian precision matrix estima- tion for graph signal processing,","venue":null,"work_id":"ce4606e1-d00a-471c-84a3-f583acab0630","year":2016},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.431367Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:28d1923aa1e79186930ef1a8e485ca20099f5a223b79217d3ab0f7d49138ac7c","observation_id":"e1a079ce-83e7-4ec1-bd87-25d6441b0b2f","resolution":{"observed_at":"2026-08-15T23:58:52.921193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.907341Z","title":"Non-negative low rank and sparse graph for semi-supervised learning,","venue":null,"work_id":"dfff5f0c-4de3-4569-9878-495d896e79aa","year":2012},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.434584Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:9c83cf15974388fb3c45ba1493ccd05965bb68611555115130138abab11c67c2","observation_id":"4bc5c169-778c-42e8-9d0a-2fbe459e19f4","resolution":{"observed_at":"2026-08-15T23:58:52.910891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.896229Z","title":"Forging the graphs: A low rank and positive semidefinite graph learning approach,","venue":null,"work_id":"ecdbf923-07f9-49d3-b746-3f163fbad734","year":2012},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.437795Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:700f73979c4978b7c0076c72850989a8c3bce7ac41e6f05d54a99bcf96e211ff","observation_id":"47ed2e87-4be2-4e0d-ad32-c7eaa6feb694","resolution":{"observed_at":"2026-08-15T23:58:52.899753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.885672Z","title":"Pseudoinverse graph convolutional networks,","venue":null,"work_id":"4cdae3aa-d1b0-41d0-95d5-b5fc405101e8","year":2021},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.440974Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:de747150ac481626d5e6a7b0048f5a9396dc11127b081ce25adb6906c8c05dbf","observation_id":"59320890-027e-48e6-88bc-de800e568cdc","resolution":{"observed_at":"2026-08-15T23:58:52.889424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.874660Z","title":"An efficient implementation to compute the pseudoinverse for the incremental broad learning system on added inputs,","venue":null,"work_id":"330122bb-00e4-4aa4-b86a-850efd43c276","year":2024},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.444511Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:eb5eca993c5fca87f71fd94c4a91ed21e91f5748e2c6e5b22a9eefb8b1c4cd05","observation_id":"41c21cc1-8f03-4724-b195-e4b75824a7ed","resolution":{"observed_at":"2026-08-15T23:58:52.878366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.864050Z","title":"Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results,","venue":null,"work_id":"055834e7-1b7d-4cb2-9152-5755dc87ccc2","year":2025},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.447744Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:43f16927d311db37b57ad648c659cceabc1729cab757be3ef5f0716f4801a523","observation_id":"331bc17b-9aed-424f-b255-969275ab8f0b","resolution":{"observed_at":"2026-08-15T23:58:52.868022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.853679Z","title":"Strang,Introduction to Linear Algebra","venue":null,"work_id":"af8eeab2-781d-4a48-bcf6-03b0c30d3178","year":2022},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.450656Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:bdaa765dc679a1e3307fa9dd5f457c16a40b7d883d55aa9e26d4588d0155244f","observation_id":"97171ebb-bb6e-4d8d-87be-d3d270d8e727","resolution":{"observed_at":"2026-08-15T23:58:52.857567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.453998Z","title":"CVXPY: A Python-embedded modeling lan- guage for convex optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.453998Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:e95f33411f5e92db91d7df2271a86b83771c0a4a74125545f85062635800b99e","observation_id":"a5d97888-79db-4b64-bfef-1d667340776c","resolution":{"observed_at":"2026-08-15T23:58:52.453998Z","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-15T23:58:52.836431Z","title":"A distribution-free M-estimator of multivariate scatter,","venue":null,"work_id":"2b2fc2f6-0664-4dd8-aac1-0a89c7e2ccfc","year":1987},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.457032Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:4870f8d883efd50d74b83972bf56188fb335b1c5782e97cb556c6e669d814902","observation_id":"fda17bb1-28d0-478e-a7b0-e51308e8932a","resolution":{"observed_at":"2026-08-15T23:58:52.840252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.460689Z","title":"Regularized Tyler’s scatter estimator: Existence, uniqueness, and algorithms,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.460689Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:60296aa73e16d1b013320e77f278a4001f423c371108b66063e727eb11b1b15e","observation_id":"bfcd8a65-4b0e-4c35-ac7a-b160c29b64d6","resolution":{"observed_at":"2026-08-15T23:58:52.460689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.463872Z","title":"Tyler’s estimator performance analysis,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.463872Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:d6671c106b6f2e4ad9a779c54ae0c3e01867c00f4b893181c6c897f853c71210","observation_id":"47691297-91bf-4ee2-ada4-77bcfb1b85a8","resolution":{"observed_at":"2026-08-15T23:58:52.463872Z","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-15T23:58:52.814007Z","title":null,"venue":null,"work_id":"ca5d346b-18e4-4aca-a90e-42eda0d3c5c9","year":2025},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.467052Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:763ccb3d7bff315cdf6b5481f52a3bd4af20316a1faddfdb6fca86d00ceb9375","observation_id":"be4549f7-af53-44b0-bcdd-6b413287e94e","resolution":{"observed_at":"2026-08-15T23:58:52.818147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.803875Z","title":"On the mathematical foundations of theoretical statistics,","venue":null,"work_id":"45eb161c-dbc6-4706-ad00-fa8247c8d32c","year":1922},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.470269Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:2377769103fb21788c34206380b099eb43cd0814123ea4bc7c0a4d8e5cda14a8","observation_id":"09b59966-56e4-45ed-9d4b-bb5fdc8c2c93","resolution":{"observed_at":"2026-08-15T23:58:52.807408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.473784Z","title":"An algorithm for quadratic programming,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.473784Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:076455dedc0355103622d40ea5699754f68c7b487fc31f28dd5047ba930348e1","observation_id":"d74b04f8-9c43-40e3-a407-7a7bc7aba75f","resolution":{"observed_at":"2026-08-15T23:58:52.473784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.477265Z","title":"Frank-Wolfe algorithm for DC optimization problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.477265Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:5d86e9407fa33da1c9b9d561797374d36b326020b85a230e711f43b8e1d7a578","observation_id":"645dc3ce-00da-454b-be5e-f98f2c4bb3f4","resolution":{"observed_at":"2026-08-15T23:58:52.477265Z","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-15T23:58:52.787994Z","title":"CCCP is Frank-Wolfe in disguise,","venue":null,"work_id":"6ad7fc76-0a87-4fea-ba84-12c54377c135","year":2022},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.480331Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:e314baa3ac8a6696bf9a87318aa82bd988fd8108c16a12c061fab519cac1161d","observation_id":"1f7895d5-64ae-4b9e-a0ca-9a2150d8c3c7","resolution":{"observed_at":"2026-08-15T23:58:52.791559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.777201Z","title":"Wireless network optimization by Perron-Frobenius theory,","venue":null,"work_id":"cb6ffef6-5cab-4213-a5d2-58f61e29221c","year":2015},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.483583Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:d08d59e48dd34e8da67a989954fd9c17aa5490c5e171506bdeb1017fe937c92f","observation_id":"927bf709-fef2-4f2d-ba47-163a89f06233","resolution":{"observed_at":"2026-08-15T23:58:52.781625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.767240Z","title":"Lemmens and R","venue":null,"work_id":"87094c42-9765-4fd6-aa22-2a7cd7fcd61c","year":2012},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.486590Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:e035e02a31241ed3e10d2632d560f37723c0d3b595294e491ccc2d02b48a3a81","observation_id":"5a37d476-9970-4a4c-916a-a925373d4eaf","resolution":{"observed_at":"2026-08-15T23:58:52.770468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:58:52.489577Z","title":"Unified framework to regularized covariance estimation in scaled Gaussian models,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.489577Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:17314754e10493670f03635716f7cad5c062a1756113dd0fecffd7df7f89d4e5","observation_id":"825ade49-4ccb-407a-abe6-f4aac4bb38d9","resolution":{"observed_at":"2026-08-15T23:58:52.489577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:58:52.493693Z","title":"Robust shrinkage estimation of high-dimensional covariance matrices,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.493693Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:5979b0da7eac7ffa2d87c7169baddb133819b67a75ef326b768ab95e67114884","observation_id":"91f845db-edcf-44c7-9f0d-9448781ceec3","resolution":{"observed_at":"2026-08-15T23:58:52.493693Z","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-15T23:58:52.625976Z","title":"Granas, J","venue":null,"work_id":"9d84de01-d89b-4993-9b0d-e1298831c28e","year":2003},"citing_paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T23:58:52.497022Z"},"links":{"citing_paper":"/paper/2608.12757"},"observation_digest":"sha256:1cd9b0a7a889c01a9351aafb77ee165eeec11c784d4a90a74f75d3bd9c187747","observation_id":"11dbd301-bb9e-49df-ae46-698541e027d2","resolution":{"observed_at":"2026-08-15T23:58:52.630365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12757","last_updated":"2026-08-13T03:10:05Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T17:47:02.508737Z","submitted_at":"2026-08-13T03:10:05Z","title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":54},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2608.12757."}