{"as_of":"2026-08-18T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0924a20dd1fc1013e55a7c5d583af606d87ae0612085a6ff3a2a67774014218","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-07T15:45:35.872365Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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-06-30T14:42:45.908201Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T14:44:45.089768Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2505.14666","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14666","snapshot_observed_at":"2026-06-30T14:44:45.089768Z","title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","venue":null,"work_id":"497fcabb-d259-4033-a9a7-51fdabcd2ef4","year":2017},"citing_paper":{"arxiv_id":"2605.24130","last_updated":"2026-05-22T18:48:17Z","snapshot_observed_at":"2026-08-08T08:30:35.337899Z","submitted_at":"2026-05-22T18:48:17Z","title":"A Tight Bound on Localization of Electrical Flows","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T14:42:45.908201Z"},"links":{"cited_paper":"/paper/2505.14666","citing_paper":"/paper/2605.24130"},"observation_digest":"sha256:bb6ac9b0abfb46478aefb2613cb366d26e8b73bdd72005f10dc2b03f32a03e7d","observation_id":"9a35dc6b-3a4e-449b-8fef-e6a8bfca2f0b","resolution":{"observed_at":"2026-06-30T14:44:45.091599Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2505.14666/citation-record","integrity":"/paper/2505.14666/integrity","json":"/paper/2505.14666/citation-record.json","paper":"/paper/2505.14666"},"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-07T15:45:39.475000Z","title":"Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang","venue":null,"work_id":"a91a01f6-c778-45e9-bace-79cbd99ace16","year":2021},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.134741Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:a9bbdfb598719e82ce4693545804fe296439f77c865a7f46b1844cc45a6dd208","observation_id":"b19449dd-499f-4a34-8f62-b22cf586c106","resolution":{"observed_at":"2026-08-07T15:45:39.612295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:39.189820Z","title":"Bipartite matching in nearly-linear time on moderately dense graphs","venue":null,"work_id":"039490dd-5adb-450d-9be3-d7b6152c4a9c","year":2020},"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":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.240590Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:f9aed8ba3ae8836c97235d9c1fed7e069ca97a76c2d6d1f32c6ec3c2ff6b16f9","observation_id":"646ae3ac-9245-4f6a-803d-6aa7aa94bada","resolution":{"observed_at":"2026-08-07T15:45:39.333069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:38.934770Z","title":null,"venue":null,"work_id":"0a0dfef5-563d-4bac-8a34-a7a471a92af4","year":1989},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.297013Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:a9b3a55ec5d271b080d8290a6e8443b9d250dad97c142dcb4f7c5fcc847ed40a","observation_id":"d661e331-4333-473f-afbe-373bacbd8ab0","resolution":{"observed_at":"2026-08-07T15:45:39.033869Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1705.00985","last_updated":"2017-05-02T14:11:59Z","snapshot_observed_at":"2026-08-14T21:03:21.087842Z","submitted_at":"2017-05-02T14:11:59Z","title":"Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees","version":1},"cited_work":{"arxiv_id":"1705.00985","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.00985","snapshot_observed_at":"2026-08-07T15:45:37.291988Z","title":"Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees","venue":"cs.DS","work_id":"e05a0e18-e63b-4f34-b8e2-ec5865dafbf4","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":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.773017Z"},"links":{"cited_paper":"/paper/1705.00985","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:3c4cdb43970ff279c20674b29ee46d34a67926894e2caef8306ab719454e5b7d","observation_id":"c7459970-3b76-41f3-854f-9e3d89ca2c96","resolution":{"observed_at":"2026-08-07T15:45:37.352070Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15675","last_updated":"2022-02-05T20:09:23Z","snapshot_observed_at":"2026-08-16T18:54:56.854279Z","submitted_at":"2020-12-31T15:52:28Z","title":"Minor Sparsifiers and the Distributed Laplacian Paradigm","version":3},"cited_work":{"arxiv_id":"2012.15675","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.15675","snapshot_observed_at":"2026-08-07T15:45:37.128115Z","title":"Minor Sparsifiers and the Distributed Laplacian Paradigm","venue":"cs.DS","work_id":"a5bf8952-a11a-48d3-bb96-5355bd0e24d6","year":2020},"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":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.906523Z"},"links":{"cited_paper":"/paper/2012.15675","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:4c9150961495d9cc652780fece7d9a975a75fc63d9d7cdb1cade1e67fae9d2f2","observation_id":"1886dc79-9335-480e-9225-1ae2a9d941fe","resolution":{"observed_at":"2026-08-07T15:45:37.174810Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07233","last_updated":"2021-06-10T03:19:18Z","snapshot_observed_at":"2026-08-18T17:40:33.431839Z","submitted_at":"2021-01-18T18:38:34Z","title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","version":2},"cited_work":{"arxiv_id":"2101.07233","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.07233","snapshot_observed_at":"2026-08-07T15:45:36.947384Z","title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","venue":"cs.DS","work_id":"cdb11824-1b29-47d1-a44b-2f3e251b5354","year":2021},"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":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.024746Z"},"links":{"cited_paper":"/paper/2101.07233","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:220f676a0737c3fac7b670413bc70f8392cd3d9a902bb71d9e847f099db139e8","observation_id":"82537b80-a2a9-4541-be1f-958d6fbc71bd","resolution":{"observed_at":"2026-08-07T15:45:37.025286Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06455","last_updated":"2017-11-17T08:30:28Z","snapshot_observed_at":"2026-08-18T15:04:54.440860Z","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:eed0bd0b04fc9cfbe7c324cf8b8c6f6f5312a8cff4f730098a1850baaf6f788d","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"}},{"citation":{"cited_paper":{"arxiv_id":"1708.01632","last_updated":"2017-08-04T18:26:03Z","snapshot_observed_at":"2026-08-14T20:43:06.510520Z","submitted_at":"2017-08-04T18:26:03Z","title":"Localization of Electrical Flows","version":1},"cited_work":{"arxiv_id":"1708.01632","doi":null,"metadata_source":"pith","pith_arxiv_id":"1708.01632","snapshot_observed_at":"2026-08-07T15:45:36.382264Z","title":"Localization of Electrical Flows","venue":"cs.DS","work_id":"832c54ee-0e65-477d-af4b-da560b8e5a27","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":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.685034Z"},"links":{"cited_paper":"/paper/1708.01632","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:6e7176284015dcc47a243820cf2e5f23c4ca514263988fb7584b911db0029356","observation_id":"15ee78a5-23a6-4ae0-865a-2a13e535aeeb","resolution":{"observed_at":"2026-08-07T15:45:36.514529Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:38.673722Z","title":"Modified log-sobolev inequalities for strongly log-concave distributions","venue":null,"work_id":"acb02758-d681-49c4-aa74-7ad1135e99c5","year":2019},"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":1989,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.438889Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:4c9d91f364f608ee88298e9f85ad3b9facd55a06688d36cdaa4a7cc1d1a6dbd2","observation_id":"c62afea8-e0bc-4467-8c46-36d582f0d481","resolution":{"observed_at":"2026-08-07T15:45:38.732264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:38.288974Z","title":"Spectral subspace sparsification","venue":null,"work_id":"1bc481cc-31ef-4023-806c-fa5f20c6cfaa","year":2018},"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":1993,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.332073Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:b2ad98fb3835f55a907248984202b1432600ded0b333e34ac842ae8b5da19f21","observation_id":"02b8a6d5-5877-4adc-ae8b-a6eb47881a87","resolution":{"observed_at":"2026-08-07T15:45:38.347679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:38.471922Z","title":"Kelner and Aleksander Madry","venue":null,"work_id":"ad2c0ce8-d96e-4b5d-b1e1-480ba530433f","year":2009},"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":2006,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.185178Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:bf75f3cc1f2d4a212cf56d71f05a1b0d878326508308c14d299a82b391a48098","observation_id":"0e51a701-2140-4d2a-833e-680c7d342ebd","resolution":{"observed_at":"2026-08-07T15:45:38.562253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:35.872365Z","title":"[V+13] Nisheeth K Vishnoi et al","venue":null,"work_id":null,"year":null},"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":2014,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.872365Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:9c4c3233a7d4bf7e138a17132a81e63dff6f5effb26f5eaa8a58f71ebb4b7942","observation_id":"9a1da9d4-e75b-4b52-bf76-abeae3a33e71","resolution":{"observed_at":"2026-08-07T15:45:35.872365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07451","last_updated":"2017-06-20T20:11:43Z","snapshot_observed_at":"2026-08-14T21:29:08.927396Z","submitted_at":"2016-11-22T18:35:03Z","title":"Sampling Random Spanning Trees Faster than Matrix Multiplication","version":2},"cited_work":{"arxiv_id":"1611.07451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.07451","snapshot_observed_at":"2026-08-07T15:45:37.453366Z","title":"Sampling Random Spanning Trees Faster than Matrix Multiplication","venue":"cs.DS","work_id":"9a924f04-97fb-4ebd-8b3f-d3c7a806293e","year":2016},"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":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.667029Z"},"links":{"cited_paper":"/paper/1611.07451","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:76cae86fb09b92d0516fa16425e8eb0f2004031d2bd1561a0f53d52dc2bd7403","observation_id":"556c47f4-8277-46ff-b04f-093554a24c81","resolution":{"observed_at":"2026-08-07T15:45:37.555859Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:38.059094Z","title":"Fast generation of random spanning trees and the effective resistance metric","venue":null,"work_id":"8d1f7bab-304e-4cb3-bad0-8161a47328f3","year":2015},"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":2018,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:35.459520Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:e8195794c3903605744cde00f6ff22b2d2e8027dab94743d5bc9af108eeeb94d","observation_id":"fe315bef-0226-43aa-9109-2b2e1dd0757c","resolution":{"observed_at":"2026-08-07T15:45:38.160698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:39.749195Z","title":"Liu, and Thuy-Duong Vuong","venue":null,"work_id":"a2d1095f-d57f-4e88-920b-0575d674d082","year":2022},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.085182Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:27765cdac4f294cc09b864e5c0943a02a4ec69408b8752fdb36c60b006dea7ca","observation_id":"5426fb60-b72e-4333-ab90-1cbe8788e3e7","resolution":{"observed_at":"2026-08-07T15:45:39.853331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:40.656676Z","title":"Domain spar- sification of discrete distributions using entropic independence","venue":null,"work_id":"040b172d-43df-4355-8f40-6536b8b6e5e4","year":2022},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:33.764743Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:2c6a582ce6572c9c033059ddcfe451d9f55e20cc8ae5d3c523432248ff629864","observation_id":"b8bd2a27-387b-4dc3-ae89-1cfeb9ba23e5","resolution":{"observed_at":"2026-08-07T15:45:40.775412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:40.045999Z","title":"Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid","venue":null,"work_id":"e4a757ba-fa41-4208-ab94-1a0d29a33df6","year":2019},"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":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:33.983757Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:e617b74ee25113af40349e9b213fca1f083ca86298921c9d721ae5f30e87ccd1","observation_id":"a3af403e-04a1-4258-b4c5-ab943b59816b","resolution":{"observed_at":"2026-08-07T15:45:40.324880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:45:40.388911Z","title":"Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests","venue":null,"work_id":"4dbda2e2-893a-4320-bd87-7ec745215c07","year":2021},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:33.915194Z"},"links":{"citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:e59d0609106013c6112431ac73f3e9f9cc95800193cb24335e6a811ff0bfd7dd","observation_id":"6d6aa6d0-c6dc-4c4f-bd14-f0ba3818f706","resolution":{"observed_at":"2026-08-07T15:45:40.475496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12051","last_updated":"2018-05-30T16:14:18Z","snapshot_observed_at":"2026-08-14T19:09:25.721257Z","submitted_at":"2018-05-30T16:14:18Z","title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions","version":1},"cited_work":{"arxiv_id":"1805.12051","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.12051","snapshot_observed_at":"2026-08-07T15:45:37.689030Z","title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions","venue":"cs.DS","work_id":"4c497257-6d68-4539-ba14-22ddcd454efa","year":2018},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:34.565627Z"},"links":{"cited_paper":"/paper/1805.12051","citing_paper":"/paper/2505.14666"},"observation_digest":"sha256:d8c8eeb71c23636a5e7bf6c4379c3b73e2fe60e7b587005aaee7ce4023ed65fb","observation_id":"c53df55a-c08a-4ded-b0e2-b5ccf124829d","resolution":{"observed_at":"2026-08-07T15:45:37.846323Z","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"}}],"paper":{"arxiv_id":"2505.14666","last_updated":"2025-05-20T17:54:15Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":10},"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-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 19 of 19 outbound references and 1 inbound Pith citation observation for arXiv:2505.14666."}