{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:THIFGL3ZRES3ZF6T63D5WZY5JT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d732fbbcb4aecbc5a70aa289599ccfdb03e01acaed9b4f35b5b3acc9b2bba9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T17:54:15Z","title_canon_sha256":"cc0bdb27306ede0678d6d58e58e13d7e669c0d92d86a82be1062d509617a58d8"},"schema_version":"1.0","source":{"id":"2505.14666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14666","created_at":"2026-07-05T11:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14666v1","created_at":"2026-07-05T11:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14666","created_at":"2026-07-05T11:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"THIFGL3ZRES3","created_at":"2026-07-05T11:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"THIFGL3ZRES3ZF6T","created_at":"2026-07-05T11:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"THIFGL3Z","created_at":"2026-07-05T11:06:17Z"}],"graph_snapshots":[{"event_id":"sha256:ee91e8afbcdaf7dcd3b08f8378574e2ca5cc72e1d18cd49f742d81c373e28ec9","target":"graph","created_at":"2026-07-05T11:06:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.14666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show an $\\widetilde{O}(m^{1.5} \\epsilon^{-1})$ time algorithm that on a graph with $m$ edges and $n$ vertices outputs its spanning tree count up to a multiplicative $(1+\\epsilon)$ factor with high probability, improving on the previous best runtime of $\\widetilde{O}(m + n^{1.875}\\epsilon^{-7/4})$ in sparse graphs. While previous algorithms were based on computing Schur complements and determinantal sparsifiers, our algorithm instead repeatedly removes sets of uncorrelated edges found using the electrical flow localization theorem of Schild-Rao-Srivastava [SODA 2018].","authors_text":"Junzhao Yang, Richard Peng, Yang P. Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T17:54:15Z","title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14666","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc73c70d64d15010d5520d40f067189e1ba0cf20ec0bcb8f7b64aaf4142416fb","target":"record","created_at":"2026-07-05T11:06:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d732fbbcb4aecbc5a70aa289599ccfdb03e01acaed9b4f35b5b3acc9b2bba9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T17:54:15Z","title_canon_sha256":"cc0bdb27306ede0678d6d58e58e13d7e669c0d92d86a82be1062d509617a58d8"},"schema_version":"1.0","source":{"id":"2505.14666","kind":"arxiv","version":1}},"canonical_sha256":"99d0532f798925bc97d3f6c7db671d4cc2ae69f5e2787c7abb0948666c1e4396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99d0532f798925bc97d3f6c7db671d4cc2ae69f5e2787c7abb0948666c1e4396","first_computed_at":"2026-07-05T11:06:17.335125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:17.335125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5pnB+92NHsQWA2163pZEEYZalW34e9qGPeEh/0QXFZ6FqIaO24lAiC2J/Nmnoh76YSgXI8F4Y4XtCt8N+FVAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:17.335705Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc73c70d64d15010d5520d40f067189e1ba0cf20ec0bcb8f7b64aaf4142416fb","sha256:ee91e8afbcdaf7dcd3b08f8378574e2ca5cc72e1d18cd49f742d81c373e28ec9"],"state_sha256":"d2e308cf9efae5a54ce3a3e3f953ad5a7a6a2ace7465b900970ebe7aac44c10f"}