{"as_of":"2026-08-18T13:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c37ccc4abf86476efcded09818aab34e75dc0da6fcf6eac1fbc466a4ce52a7a0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:45:35.598260Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:45:36.671362Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.06455","last_updated":"2017-11-17T08:30:28Z","snapshot_observed_at":"2026-08-14T20:12:40.991725Z","submitted_at":"2017-11-17T08:30:28Z","title":"An almost-linear time algorithm for uniform random spanning tree generation","version":1},"cited_work":{"arxiv_id":"1711.06455","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.06455","snapshot_observed_at":"2026-08-07T15:45:36.671362Z","title":"An almost-linear time algorithm for uniform random spanning tree generation","venue":"cs.DS","work_id":"675cce35-0814-4a24-bb91-c1e5bfdd456a","year":2017},"citing_paper":{"arxiv_id":"2505.14666","last_updated":"2025-05-20T17:54:15Z","snapshot_observed_at":"2026-08-07T20:41:31.799017Z","submitted_at":"2025-05-20T17:54:15Z","title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.598260Z"},"links":{"cited_paper":"/paper/1711.06455","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:d26edc6e15b952e6d41c254b1cc0b1d7f27d581c45aad2d13ef6ba5b05feaf91","observation_id":"048ecc44-8d90-4dfd-bafa-22e6b752bc13","resolution":{"observed_at":"2026-08-07T15:45:36.767882Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.06455/citation-record","integrity":"/paper/1711.06455/integrity","json":"/paper/1711.06455/citation-record.json","paper":"/paper/1711.06455"},"outbound":[],"paper":{"arxiv_id":"1711.06455","last_updated":"2017-11-17T08:30:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T20:12:40.991725Z","submitted_at":"2017-11-17T08:30:28Z","title":"An almost-linear time algorithm for uniform random spanning tree generation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1711.06455."}