{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:THIFGL3ZRES3ZF6T63D5WZY5JT","short_pith_number":"pith:THIFGL3Z","canonical_record":{"source":{"id":"2505.14666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T17:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"cc0bdb27306ede0678d6d58e58e13d7e669c0d92d86a82be1062d509617a58d8","abstract_canon_sha256":"d732fbbcb4aecbc5a70aa289599ccfdb03e01acaed9b4f35b5b3acc9b2bba9d8"},"schema_version":"1.0"},"canonical_sha256":"99d0532f798925bc97d3f6c7db671d4cc2ae69f5e2787c7abb0948666c1e4396","source":{"kind":"arxiv","id":"2505.14666","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:THIFGL3ZRES3ZF6T63D5WZY5JT","target":"record","payload":{"canonical_record":{"source":{"id":"2505.14666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T17:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"cc0bdb27306ede0678d6d58e58e13d7e669c0d92d86a82be1062d509617a58d8","abstract_canon_sha256":"d732fbbcb4aecbc5a70aa289599ccfdb03e01acaed9b4f35b5b3acc9b2bba9d8"},"schema_version":"1.0"},"canonical_sha256":"99d0532f798925bc97d3f6c7db671d4cc2ae69f5e2787c7abb0948666c1e4396","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:17.335705Z","signature_b64":"X5pnB+92NHsQWA2163pZEEYZalW34e9qGPeEh/0QXFZ6FqIaO24lAiC2J/Nmnoh76YSgXI8F4Y4XtCt8N+FVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d0532f798925bc97d3f6c7db671d4cc2ae69f5e2787c7abb0948666c1e4396","last_reissued_at":"2026-07-05T11:06:17.335125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:17.335125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.14666","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WiA87b7jopTURsE1A9nu/3wCW5Xw/mKe0eWZHGe+5Au4EOTMJFlsRGl06eqMlezDI5aQUFRpdHsX5sC9xR5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:42:11.831442Z"},"content_sha256":"bc73c70d64d15010d5520d40f067189e1ba0cf20ec0bcb8f7b64aaf4142416fb","schema_version":"1.0","event_id":"sha256:bc73c70d64d15010d5520d40f067189e1ba0cf20ec0bcb8f7b64aaf4142416fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:THIFGL3ZRES3ZF6T63D5WZY5JT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junzhao Yang, Richard Peng, Yang P. Liu","submitted_at":"2025-05-20T17:54:15Z","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]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14666","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.14666/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmg1a2u0CnXA5kH7V95mfTcK9QK2YWopH27t7eQFb1sUpvnLAH+8lbiaLAFgCmwaNbFPR8Uc0BOyWt+I1DIACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:42:11.831806Z"},"content_sha256":"ee91e8afbcdaf7dcd3b08f8378574e2ca5cc72e1d18cd49f742d81c373e28ec9","schema_version":"1.0","event_id":"sha256:ee91e8afbcdaf7dcd3b08f8378574e2ca5cc72e1d18cd49f742d81c373e28ec9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/bundle.json","state_url":"https://pith.science/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-22T05:42:11Z","links":{"resolver":"https://pith.science/pith/THIFGL3ZRES3ZF6T63D5WZY5JT","bundle":"https://pith.science/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/bundle.json","state":"https://pith.science/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THIFGL3ZRES3ZF6T63D5WZY5JT/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnfqEZLsB3mnFpnrnq8arj5+vArnNHHchXc2hMus9rAno7JVAak82Vy1RHOtKWXMjqBzykbvJRjahx0jl9B7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T05:42:11.833839Z","bundle_sha256":"eb16919048a1460cf36213896b3b384b8445f1398cda0cbcdc983b2a855de146"}}