{"as_of":"2026-08-21T04:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8eb9fb00001100f43fc919a5b3ec0d58bc1a31a5e3ff046606777387dd90b924","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:33:58.806729Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.20211/citation-record","integrity":"/paper/2607.20211/integrity","json":"/paper/2607.20211/citation-record.json","paper":"/paper/2607.20211"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:33:56.958692Z","title":"The future is big graphs: a community view on graph processing systems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:56.958692Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:d8cbfef374d91f4c1c6a1c2f3ea3a523115ca874e915ba3739a87ba0e0c1e000","observation_id":"0e71dd10-58f5-498a-a7d5-04972429b2b5","resolution":{"observed_at":"2026-08-01T10:33:56.958692Z","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-01T10:33:57.056899Z","title":"A shared-memory algorithm for updating tree-based properties of large dynamic networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.056899Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:1a006cf4327c1699ef97962e0bcf292a1d5733d0ce3b7bd681a4f72d3907972e","observation_id":"ad0ff6c9-0a59-4c3f-afe8-4c9b86dcb3ab","resolution":{"observed_at":"2026-08-01T10:33:57.056899Z","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-01T10:33:57.211796Z","title":"Shared-memory parallel algorithms for fully dynamic maintenance of 2-connected components,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.211796Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:9131b788cfefa62a5eff697ea29cbcf17a8e03b4fa0005ad98f015791e42add6","observation_id":"006ec780-e6e9-4e75-9561-5ce27c99a566","resolution":{"observed_at":"2026-08-01T10:33:57.211796Z","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-01T10:33:57.349590Z","title":"Scalable gpu graph traver- sal,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.349590Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:a5eb47381c770b8f090bda3d09f4d0eaec4d355283d4f5631421f38cba1cf568","observation_id":"683b29b2-49f5-441d-a41e-63d67b07ff35","resolution":{"observed_at":"2026-08-01T10:33:57.349590Z","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-01T10:33:57.486878Z","title":"Euler meets gpu: practical graph algorithms with theoretical guarantees,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.486878Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:de97465de966f93d5f600060b3eb0a83852ae157436d3661621703ecc76ce07d","observation_id":"6e4a3a40-3dd7-4aa6-9adc-7ccddab94615","resolution":{"observed_at":"2026-08-01T10:33:57.486878Z","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-01T10:33:57.607805Z","title":"The euler tour technique and parallel rooted spanning tree,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.607805Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:a12d0dabc33b37304e9e31449e159ed5b515ce84c5c5b9375af8c6c133867c38","observation_id":"18b248ab-d3df-4098-b439-2df7a917d9c9","resolution":{"observed_at":"2026-08-01T10:33:57.607805Z","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-01T10:33:57.869153Z","title":"Sparsifica- tion—a technique for speeding up dynamic graph algorithms,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.869153Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:036d6a6b7729534128da70c7b379b2cc55d218a07d4e23d62cf8982bce1a1d79","observation_id":"e87b9267-30c2-44dc-acaf-de8a5b4c025d","resolution":{"observed_at":"2026-08-01T10:33:57.869153Z","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-01T10:33:58.017652Z","title":"Application of graph sparsifi- cation in developing parallel algorithms for updating connected compo- nents,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.017652Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:f00897f2944f37022a44a58c5408280f807d2c850fddc956ee94505b4c81940f","observation_id":"6a7b9199-6227-4ed6-8e5c-5f0b4e63169a","resolution":{"observed_at":"2026-08-01T10:33:58.017652Z","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-01T10:33:58.142876Z","title":"A new parallel algorithm for connected components in dynamic graphs,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.142876Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:1f2f6abfb51c2cf32b778986eaa430aa983176dee6b693b2f30a7dc70b3148af","observation_id":"90b72631-f531-44c1-bc4f-fbf56b6acb2a","resolution":{"observed_at":"2026-08-01T10:33:58.142876Z","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-01T10:33:58.254738Z","title":"Parallel batch-dynamic graph connectivity,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.254738Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:2f4a8fac70b03c05b51672e31d2060097791a5d7014a6dde87c60d17ef4ac268","observation_id":"35f9e046-3d0e-4bfb-93e9-118e7cae7b9e","resolution":{"observed_at":"2026-08-01T10:33:58.254738Z","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-01T10:33:58.325994Z","title":"Towards scalable and practical batch-dynamic connectivity,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.325994Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:d77856c5ab15099622c9ec6046ae5a063b9a616278a6796f4fa2bd27c4268f87","observation_id":"a2d42f47-5aa6-4db1-a479-249cd7109da9","resolution":{"observed_at":"2026-08-01T10:33:58.325994Z","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-01T10:33:58.384379Z","title":"A data structure for dynamic trees,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.384379Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:9d2829936c0f5688f86d26e2cadbdc69575c8b20efe2f0f3651c291e8dba2f1c","observation_id":"a7e3bfd7-e619-4c33-9a1d-d0758410ed27","resolution":{"observed_at":"2026-08-01T10:33:58.384379Z","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-01T10:33:58.458230Z","title":"Data structures for on-line updating of minimum spanning trees,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.458230Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:ea86b2cc70719987e63904bc8bb90197984740d16528ae06b99b2f17f17ceecf","observation_id":"0a42cefb-45f1-4b72-9b9f-e0657e74dd02","resolution":{"observed_at":"2026-08-01T10:33:58.458230Z","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-01T10:33:58.541468Z","title":"Randomized fully dynamic graph algorithms with polylogarithmic time per operation,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.541468Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:c391600c624f00f8ece6d14d5c38ae70ebeaee39c90971c19b3129d89595092d","observation_id":"ce4ccfdc-6c13-4948-98f4-4876f3b272e2","resolution":{"observed_at":"2026-08-01T10:33:58.541468Z","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-01T10:33:58.613486Z","title":"Batch-parallel euler tour trees,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.613486Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:bc7cfd6051b4ce5a4aa730bf1e46fffc09cab1045a7f5b35d8550c43fead1dbc","observation_id":"7f3e1757-5882-483b-8ca5-237e1434399b","resolution":{"observed_at":"2026-08-01T10:33:58.613486Z","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-01T10:33:58.671647Z","title":"A fast gpu algorithm for graph connectivity,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.671647Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:8300b8ec4930f7be03191b8ac6b8fe3267b8091daaa0d67a7c1ca54b101d8b89","observation_id":"7588b6ca-e5a1-4ee2-888a-262db96ad1b0","resolution":{"observed_at":"2026-08-01T10:33:58.671647Z","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-01T10:33:58.750730Z","title":"Layered label propaga- tion: A multiresolution coordinate-free ordering for compressing social networks,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.750730Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:60f22512bf6b86ee4d2f25662b89cf0cd048bd74db387dd753388d4e7aca1aa1","observation_id":"441752ac-62e6-4de6-bd80-36d586fa5dac","resolution":{"observed_at":"2026-08-01T10:33:58.750730Z","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-01T10:33:58.806729Z","title":"Snap: A general-purpose network analysis and graph-mining library,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:58.806729Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:f99ca0a3fac50465917a7286a5c87acea3c6d12e86280b55e4055d1688d499f2","observation_id":"7f1cc54f-2d77-474c-843c-7ebf1efe60a2","resolution":{"observed_at":"2026-08-01T10:33:58.806729Z","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-01T10:33:57.723805Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-01T10:33:57.723805Z"},"links":{"citing_paper":"/paper/2607.20211"},"observation_digest":"sha256:9b4c8e8d3846b55e4739fac84fc18366ff9727cf5477521306ea6d999ca393d2","observation_id":"e53f4413-572d-46ff-82f1-6517bb89a97e","resolution":{"observed_at":"2026-08-01T10:33:57.723805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20211","last_updated":"2026-07-22T14:31:03Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T00:32:03.174424Z","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.20211."}