{"as_of":"2026-08-17T03:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97aeddc247516884883856914aebc9b7f6f345d3ff8d6b249f9a676dc7cfc9ad","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:23:33.042352Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01384/citation-record","integrity":"/paper/1908.01384/integrity","json":"/paper/1908.01384/citation-record.json","paper":"/paper/1908.01384"},"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-14T15:23:34.586733Z","title":"Network lasso: Clustering and optimization in large graphs","venue":null,"work_id":"a8cece69-8135-4a11-beb4-7e46e6b11531","year":2015},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.338564Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:ed5a1692df0fa50f68c1bdf52b2c4f930835611660c1a0b32d06f201f2f2bf0e","observation_id":"19aef76e-5c5c-4aeb-9303-ae0a7e482081","resolution":{"observed_at":"2026-08-14T15:23:34.592136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.512059Z","title":"Trian- gle lasso for simultaneous clustering and optimization in graph datasets,","venue":null,"work_id":"297e9af9-8232-4b12-beeb-cb3e358ff2b5","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.440523Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:b490f61f2b89024c18fd99213498191e163e96bd6dd26fa12ef9232196f58705","observation_id":"def72bd4-4170-457b-be61-c7d8aa8266a9","resolution":{"observed_at":"2026-08-14T15:23:34.537844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:32.446142Z","title":"Least squares quantization in pcm,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.446142Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:e0e6ab30bb407abd6ddebb768410bf0701d102d87847ad69e7955751650c22c6","observation_id":"6c2218a1-3ca2-4b46-8576-f31486305058","resolution":{"observed_at":"2026-08-14T15:23:32.446142Z","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-14T15:23:34.396247Z","title":"Convergence properties of the k- means algorithms,","venue":null,"work_id":"4b80c9cd-4285-44a1-92a5-d0ef175052cb","year":1995},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.450510Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:9b2996b706b95d4db53c7d6343000c85fa06ba922f8bf2e981b909d0d1b88879","observation_id":"fbfb6977-761c-4a19-befc-988c87a92b46","resolution":{"observed_at":"2026-08-14T15:23:34.410665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.379556Z","title":"Learning joint affinity graph for multi-view subspace clustering,","venue":null,"work_id":"56e8b8da-b667-4a4f-8155-1bde14cf1332","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.454970Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:0f515f5fbf78f52f3290741bfe5c6be49a54ae70aac7d4414064d484008fe313","observation_id":"731c7856-bbe0-4ba1-a4c4-4656d595b9f3","resolution":{"observed_at":"2026-08-14T15:23:34.384892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.364402Z","title":"Late fusion incomplete multi-view clustering,","venue":null,"work_id":"76c1811e-a430-4cc0-ad03-1216a54ab72b","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.460368Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:5cc61bf9ea2d7434ab11a200bb6a941fe4ed8fda257ef68c679eb29568afa9dc","observation_id":"5986a510-d290-4e3b-be72-68dda8cfab82","resolution":{"observed_at":"2026-08-14T15:23:34.369261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.349679Z","title":"An application of network lasso optimization for ride sharing prediction,","venue":null,"work_id":"86570360-61a7-492f-8623-26d0ce910dc7","year":2016},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.465622Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:379cf2124e2adf74a477caee847e35784c4c502700eb280a60599aba4355e69c","observation_id":"ff75462e-416c-4c00-8064-719a8653dacc","resolution":{"observed_at":"2026-08-14T15:23:34.353859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.334769Z","title":"Splitting methods for convex clustering,","venue":null,"work_id":"52bce2ee-0608-4303-b91a-90ac3883b746","year":2014},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.470301Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:11cdbfca45ad86805ee15c86e74fc974d5f17d12da4c89128103bdee24e1dce6","observation_id":"ef0cabf3-5a56-470d-9674-10e5c8db8621","resolution":{"observed_at":"2026-08-14T15:23:34.339451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.268848Z","title":"Statistical properties of convex cluster- ing,","venue":null,"work_id":"b894ddb1-de83-4873-83a7-87e6ca5a9459","year":2015},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.569725Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:6d045e25abd0d53d73261a25b8a00f1e8f72c6fd8a905b7f748942b6bd1f4ef5","observation_id":"3202608a-5c6d-4c69-a8f7-42c76132c058","resolution":{"observed_at":"2026-08-14T15:23:34.305049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.234846Z","title":"Convex clustering via l1 fusion penalization,","venue":null,"work_id":"61676a76-d9b6-45c0-b8db-1c6cd5d5e4ae","year":2017},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.699480Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:963f7cd9df80e2d9feb169f3806d0a1a19f37a42bed1ef924ef7bb2f9350d5e4","observation_id":"3c333d27-a76d-487e-ae5d-57af4900c41e","resolution":{"observed_at":"2026-08-14T15:23:34.240183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.219951Z","title":"Snap: A general purpose network anal- ysis and graph mining library","venue":null,"work_id":"caf3364e-1ea7-4d18-80ee-072202d5de50","year":2016},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.789995Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:5fe790fa837f6ae142cb3e8cdcc296e7ee53b7f08684c71c7babc6bf1b67e07b","observation_id":"8a437cce-79f7-4896-9218-de916b4a874f","resolution":{"observed_at":"2026-08-14T15:23:34.224787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.173502Z","title":"When is network lasso accurate?","venue":null,"work_id":"a41bbd9f-fdf3-4d35-958c-3050308aacc3","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.830052Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:9cbf7903a1abf49f27722757e6270ae7a21dd2d34df9682d34c699bf19bbdfc1","observation_id":"6b9956e1-2597-4550-9ea8-fc4204c5f18f","resolution":{"observed_at":"2026-08-14T15:23:34.209871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:34.002474Z","title":"Just relax and come clustering! a convexification of k-means clustering,","venue":null,"work_id":"9ee76802-76f9-43e8-b058-decbdd368b4d","year":2011},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.835048Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:f252629108b6e0f32250f8c4eb0f5d44e9338c64c4b8125acad8e9a92afee6e4","observation_id":"9309eac4-0f1e-43df-a612-79a5e2c924b4","resolution":{"observed_at":"2026-08-14T15:23:34.072276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.986423Z","title":"Large-scale k-means clustering via variance reduction,","venue":null,"work_id":"485c4f52-acdb-48ac-8206-35827d436de7","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.840317Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:5c31d95b2f7a773a2e09243e974738426255f7f0dc6e06b70382941c25d1ec21","observation_id":"1a17f73f-7a45-46f3-8477-7a168a13ec3f","resolution":{"observed_at":"2026-08-14T15:23:33.991389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.970740Z","title":"Convex Optimization Procedure for Clustering - Theoretical Revisit","venue":null,"work_id":"cd272059-8bb4-472f-b445-bfcfbbecfada","year":2014},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.845190Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:c212ef6973a18f1d0a914c0128a935f079df849327f6121a69dd768d732fb58c","observation_id":"e4048f59-6ac7-4af8-b393-22f348a61a28","resolution":{"observed_at":"2026-08-14T15:23:33.975900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.850700Z","title":"Clustering by sum of norms: Stochastic incremental algorithm, convergence and cluster recovery,","venue":null,"work_id":"ff0fa999-f796-4e32-84e0-d63aa101ef60","year":2017},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.849408Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:ce6c08d1a405a1c4da2cf91fdf10882f65f264e0056965b0e6903b4818350ba7","observation_id":"0d2a5a53-aed9-452e-9170-04ecc7fe65a7","resolution":{"observed_at":"2026-08-14T15:23:33.906370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.835277Z","title":"An efficient semismooth new- ton based algorithm for convex clustering,","venue":null,"work_id":"04fc30c5-58cc-4249-a658-1dd8baced5a3","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.854752Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:ce5225c90872392c553339615cb37cc6bf062ad382872b6f207db14b56e3fbea","observation_id":"69be14fa-5269-42e5-b690-0657948b0871","resolution":{"observed_at":"2026-08-14T15:23:33.841049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.669443Z","title":"Shalev-Shwartz and S","venue":null,"work_id":"ef9389d1-a1a5-4da4-9d13-d15c293a3b96","year":2014},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.858784Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:567df0cb3a350d1b8a749c661ab52b1b125f1656dc16c51e9b7c5750efec2f47","observation_id":"0fa58c97-9b95-4ae8-8bca-a69ef9c5e35c","resolution":{"observed_at":"2026-08-14T15:23:33.741485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.653848Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers,","venue":null,"work_id":"1358aa90-3c7d-41e2-9260-30dc6e5bad1b","year":2011},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.862799Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:53b314c55a7c36c278aba7fb23573d966792d6a959d3c56c3c123c9596b076f1","observation_id":"cbea2c68-d9a2-443a-a09e-1a4fc0951c2a","resolution":{"observed_at":"2026-08-14T15:23:33.658794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.513098Z","title":"On non-ergodic convergence rate of Douglas- Rachford alternating direction method of multipliers","venue":null,"work_id":"1a401fa3-e7a5-44b3-ada8-301b1559814f","year":2015},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.866807Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:51a4e7b58052cab322cbf5b6e4e7aeea46fb48d019ff7191f5741da6288be7e6","observation_id":"66e26db0-22e2-41c8-a962-bf7d2da4cf7f","resolution":{"observed_at":"2026-08-14T15:23:33.590607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.496314Z","title":"CVX research project,","venue":null,"work_id":"8b9d1c7e-8678-49f2-b986-2ece85b41a3a","year":2018},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.871014Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:78c479bf1e8685f76433705366aa1417d13366dc295595a51b4f5133f513fefb","observation_id":"e372936f-5b92-42c3-8a19-ca7b1db6e8c2","resolution":{"observed_at":"2026-08-14T15:23:33.502099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.478605Z","title":"Convex Clustering - An Attractive Alternative to Hierarchical Clustering","venue":null,"work_id":"b1f9d8b3-678d-497f-8f78-46f447f8b969","year":2015},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.875403Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:11e2e15ff2693f2cc08c364cdac00d0d36bc664b33d5afee247c2e0aac95ef4f","observation_id":"862ad1df-b827-4720-bbcc-cd9be1916c40","resolution":{"observed_at":"2026-08-14T15:23:33.484569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.338476Z","title":"Boyd and L","venue":null,"work_id":"cbc631b4-950d-43eb-a550-a12e12431927","year":2004},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:32.990270Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:eb7219bb60e1e63ebace104c12cd9d4a836ff9fef54a2e399dfe2962f152b4a0","observation_id":"fbe4d070-bec2-4499-9fb3-b774e4ee128b","resolution":{"observed_at":"2026-08-14T15:23:33.445324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.243338Z","title":"Proximal algorithms,","venue":null,"work_id":"2c0dcecb-a246-4bd0-878a-9a5bfe5d9aa6","year":2014},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:33.032804Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:53a0fda44166e8e670387a19d8299c96f75bd050af577d3318cb130af68c8735","observation_id":"f7766b4f-4444-46bd-822c-49bba00746cd","resolution":{"observed_at":"2026-08-14T15:23:33.247773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.229121Z","title":"Bertsekas, A","venue":null,"work_id":"8dc6524b-9852-4511-a11b-5c6d0d2bd666","year":2004},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:33.038108Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:a0ed7b1b1264425c29f5c121aff87c53e777e3e175e10cf5f86c5706f9b2c6de","observation_id":"82c5c773-1a9c-4b6a-88c0-6e960e6c1654","resolution":{"observed_at":"2026-08-14T15:23:33.233068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:23:33.073081Z","title":"Deke Guo received a B.S","venue":null,"work_id":"6266c0c5-9077-4a07-b0a2-2f8fcc4e3361","year":2001},"citing_paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:33.042352Z"},"links":{"citing_paper":"/paper/1908.01384"},"observation_digest":"sha256:d924393b4b271f42df244b0ef7696c687134ccccc1f2547216e8433382221b26","observation_id":"9e7f6ca3-c3f9-40fe-a84a-a8fb53945024","resolution":{"observed_at":"2026-08-14T15:23:33.150731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01384","last_updated":"2019-08-04T18:45:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T10:28:41.681652Z","submitted_at":"2019-08-04T18:45:42Z","title":"Simultaneous Clustering and Optimization for Evolving Datasets"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":26},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.01384."}