{"as_of":"2026-08-16T19:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b8ffa731c6ef848cf00c1d213c31d0837190f9faa488a8485a175401deac529","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:55:57.305366Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"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.02370/citation-record","integrity":"/paper/1908.02370/integrity","json":"/paper/1908.02370/citation-record.json","paper":"/paper/1908.02370"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:57.147073Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.147073Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:7619f27751d5bb9e5bdfc8e0cdf681ca81cbc8f3e49880731680d5963d4ec646","observation_id":"fe144fac-0e42-43e6-a76c-3233187d4e06","resolution":{"observed_at":"2026-08-14T14:55:57.147073Z","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-14T14:55:57.152492Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.152492Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:db79d7ddd0a68264f9b78d74fa70e449f07722547b4928397f78e7cd4e9fd128","observation_id":"3f0b452a-3333-4760-9d54-1eb054b44598","resolution":{"observed_at":"2026-08-14T14:55:57.152492Z","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-14T14:55:57.158788Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.158788Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:6db3ccba907d7821303c89c1116593330612aa18f3343bf4bdd5e3b0b838821a","observation_id":"ba7f1ed8-8207-4a41-8105-a9158a299926","resolution":{"observed_at":"2026-08-14T14:55:57.158788Z","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-14T14:55:57.163964Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.163964Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:3993beb95bd4af3b1d0fb95fdb1582186074d82125742576c69bc579ad0f5302","observation_id":"a6a9bebe-c4ab-4fe9-aef5-e6990adc0cef","resolution":{"observed_at":"2026-08-14T14:55:57.163964Z","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-14T14:55:57.169809Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.169809Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:aa2ee9429930b1e96e7f5063342334b0b7a731d427748213f09f0b4f76e471d1","observation_id":"a639b4ef-ab89-444d-9943-bb8f72cf04b2","resolution":{"observed_at":"2026-08-14T14:55:57.169809Z","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-14T14:55:57.665738Z","title":null,"venue":null,"work_id":"4f6e0ea1-4177-44c4-b7d9-f0c1dd7b6670","year":2016},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.175577Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:758a4c258dbf1cd8f53aaa615d85b1d002a181f79f0fa1ae71d4d88567cd604c","observation_id":"4376b748-f0e3-4ba0-baca-b00b6ad551a6","resolution":{"observed_at":"2026-08-14T14:55:57.670177Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.654494Z","title":null,"venue":null,"work_id":"a8824925-c228-4050-aa8f-a34dca1ab72a","year":2014},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.180169Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:f2bad8914aea808245592557a8ecca00811457c4765b0e6d3a7a68d3696a21fa","observation_id":"0762ab3b-6530-47fd-b812-917593fca1e8","resolution":{"observed_at":"2026-08-14T14:55:57.658295Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.643539Z","title":"and J.-P","venue":null,"work_id":"5edfd643-094d-4902-b365-b8acb1b8def4","year":2011},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.184730Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:c33b57360b6927895f5ef7d8b939974793ec64857e65f2b2bb6d66aad0e75ebb","observation_id":"31ca674d-2506-4a46-b90f-18331ac5e106","resolution":{"observed_at":"2026-08-14T14:55:57.647801Z","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-14T14:55:57.632025Z","title":"Parikh, E","venue":null,"work_id":"1f6ebde5-81c1-4e9f-a82a-e372aea7cb13","year":2011},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.189790Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:30f84352f74c42c37dbd0fde0311baa8050c999a521dec045c9e797adc23452f","observation_id":"ff5a8f4c-5dd3-4e0a-8304-e4f5f296ccf4","resolution":{"observed_at":"2026-08-14T14:55:57.635686Z","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-14T14:55:57.620018Z","title":null,"venue":null,"work_id":"588e5f42-4d20-4128-86a5-d6d402c91afa","year":2009},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.195638Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:1eb82f7c2f5a521293d98c891cab2cd0e4f7ab2860cb42667f76cd0c9794fc62","observation_id":"403da500-e150-4821-974e-10c88779c610","resolution":{"observed_at":"2026-08-14T14:55:57.624652Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.607793Z","title":null,"venue":null,"work_id":"5316395a-2d5f-48a7-b51c-1a7186adae2a","year":2012},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.201693Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:dedd11af477aeec571e7dc3f7d17119b1b58da28d603f974f569670e4dbc8a78","observation_id":"700972a3-1dcb-4d76-9fdc-e60a37611685","resolution":{"observed_at":"2026-08-14T14:55:57.611601Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.596207Z","title":"(2013, Nov)","venue":null,"work_id":"8edbfcf1-96f7-404d-9d8c-64fe32bd7f1f","year":2013},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.208184Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:51be7db9f3683b1984b4395184ddb794bafd11bc23bab0d96f8e4c075831ee0f","observation_id":"5b02ed70-16d3-4ff5-bf63-bf392f29b0c2","resolution":{"observed_at":"2026-08-14T14:55:57.599996Z","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-14T14:55:57.585097Z","title":null,"venue":null,"work_id":"e2218b51-9cb5-40d1-8531-b8d310390e71","year":2001},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.215167Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:1cc55697027452aede025fda3226efba7dd0ef15d202d5b838aff5ad854cdd1d","observation_id":"8c1c9799-a8c5-4ba8-8d3d-08baafaf708d","resolution":{"observed_at":"2026-08-14T14:55:57.588836Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.572005Z","title":null,"venue":null,"work_id":"43351f32-13f0-459a-a9ff-6afd05d4b9eb","year":1992},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.219763Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:ce03dca9f831e55ffe1c7fc24036df3ff2761a0cfd91c44ec6889edb90ca4eb7","observation_id":"78ca4fae-1901-40c4-aad5-fe24c21eed58","resolution":{"observed_at":"2026-08-14T14:55:57.577981Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.561330Z","title":"Hastie, H","venue":null,"work_id":"eff079b4-f2a6-4ac2-b706-43a1c0e1a6ee","year":2007},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.223703Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:b24bb5aeeeb98694e46a0265414f03273b815e2daef26821d67ffade574ebdfd","observation_id":"c020be61-0690-483c-b998-43dc42ede500","resolution":{"observed_at":"2026-08-14T14:55:57.564957Z","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-14T14:55:57.551275Z","title":"Leskovec, and S","venue":null,"work_id":"7902edc1-40e0-488c-beca-1a557e731f53","year":2015},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.228675Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:a0ecc4b973a3916802cb629316f52c5c4317322236946c2cc8596e5656f71a01","observation_id":"36893506-43bc-4e25-9a26-0438b0383834","resolution":{"observed_at":"2026-08-14T14:55:57.554524Z","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-14T14:55:57.541162Z","title":null,"venue":null,"work_id":"292c52c6-4c40-4a8c-8a54-5c1dc4925c79","year":2013},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.232951Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:78468bb167902e5be143b80f2cf10569624a44591b8a88501e4402c6ac0ae5cf","observation_id":"6bd17665-1c0c-4d00-9434-23b8fa0757a9","resolution":{"observed_at":"2026-08-14T14:55:57.544746Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.529926Z","title":"Pock, and M","venue":null,"work_id":"3a7642e1-86bd-42b3-8bfe-142799c72fbb","year":2016},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.238112Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:863dd7d4cfd6d963050e9cf467a7aa6d28ae31a615b1e5b7601b983b5f0900a0","observation_id":"f9e87ac3-a8ab-4ce9-9195-3d6aeec7ed9d","resolution":{"observed_at":"2026-08-14T14:55:57.533492Z","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-14T14:55:57.519301Z","title":null,"venue":null,"work_id":"0899cf9c-7b2d-47cb-8a08-d6af5c964c6a","year":2011},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.243063Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:3e8c895b65508eb4ecf8ae1200e5307b4bfa40d196ff57ce9d106d9479dc2eee","observation_id":"745b3492-f666-4f7a-8505-9795ffa5a432","resolution":{"observed_at":"2026-08-14T14:55:57.522804Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.509035Z","title":null,"venue":null,"work_id":"2d97ac01-9b92-4fc1-91e9-68a68641ea6e","year":2017},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.247302Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:f192c00a60b792dc76c91caa696cdd54614d954f117cb217f3e83f5443c6f6ff","observation_id":"c63d266b-6812-4c3c-8814-a010260005cd","resolution":{"observed_at":"2026-08-14T14:55:57.512494Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.497853Z","title":"Pham, and A","venue":null,"work_id":"92691c29-24f1-4dcc-8224-0e7e7fb51f85","year":2014},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.252016Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:f97192e989d8256c49043ce1ec6b0217a0c5f26888fcaf519d4f1d504e25ecad","observation_id":"d6ee71ff-66b7-47d9-a63b-2c3503967026","resolution":{"observed_at":"2026-08-14T14:55:57.501701Z","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-14T14:55:57.486125Z","title":"Yuan, and J","venue":null,"work_id":"fe6899dd-7f86-4749-8b94-5da376e67ee7","year":2010},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.255978Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:4ced594414bd573c77c9f6d69bf3b6d3d9b15e7f75e412ec58234542f40731db","observation_id":"dcd5f0ef-d7e9-4a71-985f-f8b2e4d9fee1","resolution":{"observed_at":"2026-08-14T14:55:57.490468Z","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-14T14:55:57.474484Z","title":null,"venue":null,"work_id":"d3f5a08a-fdc0-4df9-ae18-9de375fed4d6","year":2015},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.260538Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:105e40d287c533a147bb6f36d16f27936b72aa3abd9fd1cbb311dd246c3b2b8a","observation_id":"e89d3e5c-ddf3-4bee-825f-755d4a5d84f1","resolution":{"observed_at":"2026-08-14T14:55:57.478006Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.462185Z","title":null,"venue":null,"work_id":"7ca71f9a-7387-43d2-a9fa-0fab7efc5f35","year":1992},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.264518Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:0b6989ff321cc806dc39f4ac183f4f955e554a6d4ac7fa4b11d89158945cfe53","observation_id":"7722606c-516c-4cd1-b2ed-ed6b8b0a705e","resolution":{"observed_at":"2026-08-14T14:55:57.466091Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.450118Z","title":null,"venue":null,"work_id":"52aa002c-ad73-4882-b0d7-870284adf09d","year":2015},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.268958Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:2dee0d69ee954097d32259e238a8af8d60000d4bb5b0232d0f5ac30faff78d0a","observation_id":"5d7abc3a-625f-421f-bbaf-1f8a824d39ce","resolution":{"observed_at":"2026-08-14T14:55:57.454170Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.434766Z","title":"Saunders, S","venue":null,"work_id":"36e26b42-dd5f-4e33-b24b-29d05ec853bc","year":2005},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.274096Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:25ea7592a7be7216e128fdb0098fc4324c03c62fe8925c63c02e4d4492d514d6","observation_id":"d1d77b91-71cc-4f75-95bd-dc7fb5aaa9cb","resolution":{"observed_at":"2026-08-14T14:55:57.439188Z","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-14T14:55:57.422578Z","title":null,"venue":null,"work_id":"e5c54e9c-2b2b-4c1e-8127-f14bd6d05da0","year":2012},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.278724Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:0e59d080a9f01f8c10adf78efe9e0fe9e1aa9e4f788a3b8090373ee9c2c3ee18","observation_id":"f4ed909e-ec77-45b0-8339-e4cf727f0438","resolution":{"observed_at":"2026-08-14T14:55:57.426253Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.409599Z","title":null,"venue":null,"work_id":"7e241b74-c621-41b3-9425-eff7b505c49a","year":2017},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.282675Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:d376234848f3d4910734aee90339f74a02429f135af03b276f08725e539fb3c1","observation_id":"f3e00dc3-e20e-4a14-9e9b-24317e932041","resolution":{"observed_at":"2026-08-14T14:55:57.413973Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.393984Z","title":null,"venue":null,"work_id":"168dff69-e3ec-4a69-a068-03a8e6edc488","year":2011},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.287192Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:6d5ea6e0778db3da76386d8d455e6663a6f489ad066c34ddc95bb0d8ea089af3","observation_id":"78176c32-b934-4cf5-a9e2-6f283a25f3a6","resolution":{"observed_at":"2026-08-14T14:55:57.399212Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.373753Z","title":null,"venue":null,"work_id":"87c2d828-f7f8-48e3-ac1f-658117574980","year":2015},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.291304Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:c9779c406e4110d44ba79df71d09ddd89d973071c4e9ca3d80164186233a1cf0","observation_id":"5058922c-5b70-46e4-985f-da0f782fe855","resolution":{"observed_at":"2026-08-14T14:55:57.381137Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.353587Z","title":null,"venue":null,"work_id":"54b345db-abaa-4f9f-9d14-0a41589547a6","year":2017},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.296065Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:ed58aa1f1313c324663c5dc830c3d81353f544f5d546d06f50149db458b05b0c","observation_id":"7cd56c86-d7ab-45c7-9dc3-841e3ad76a6d","resolution":{"observed_at":"2026-08-14T14:55:57.360227Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:55:57.299955Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.299955Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:2d349094d6f2b85ffb990963dceb433e2c127685c889bf48730237a1e3e51815","observation_id":"d73da97e-d208-482e-ac57-dc3790a526c7","resolution":{"observed_at":"2026-08-14T14:55:57.299955Z","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-14T14:55:57.305366Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:55:57.305366Z"},"links":{"citing_paper":"/paper/1908.02370"},"observation_digest":"sha256:b5380340c73c0170643b7cbcf706e7e72424ed9ec7b227ece4897905ff9f7582","observation_id":"83dda8ff-d6ad-4fbd-aeaa-96fa20a8dc20","resolution":{"observed_at":"2026-08-14T14:55:57.305366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.02370","last_updated":"2019-08-06T21:14:42Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T08:52:53.645439Z","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":33},"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 16 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.02370."}