{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EZYQ2Z33UWKMCGZFMV4W262ZKQ","short_pith_number":"pith:EZYQ2Z33","schema_version":"1.0","canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","source":{"kind":"arxiv","id":"1612.02569","version":2},"attestation_state":"computed","paper":{"title":"Random Spanning Trees for Expanders, Sparsifiers, and Virtual Network Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel Khankin, Shlomi Dolev","submitted_at":"2016-12-08T09:17:12Z","abstract_excerpt":"This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we generalize the method by Goyal et al. for weighted graphs and show that it is possible to approximate the expansion of every cut in a weighted graph with the union of random spanning trees generated by a random walk on a weighted graph. Second, we show that our union of random spanning trees is a spectral sparsifier of the graph. Moreover, we show that $O(\\log "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1612.02569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-08T09:17:12Z","cross_cats_sorted":[],"title_canon_sha256":"3f8f4d418bab3f2584b787e7df2eea0d3665e5417bd986d241b248614b2b1392","abstract_canon_sha256":"d42181d81d1cdb38506bdd217d5ae8506f00264735beee729dd9679ecb3972ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:46.021958Z","signature_b64":"4QuL5IqbCbe4F/j/nMRolyFGje5dUQbspCjIzMi4MtR7kGs0y7hBXBH+s4jTmEmzYD9PD2S5xPu3XQeIA8SMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","last_reissued_at":"2026-07-05T00:11:46.021522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:46.021522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Spanning Trees for Expanders, Sparsifiers, and Virtual Network Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel Khankin, Shlomi Dolev","submitted_at":"2016-12-08T09:17:12Z","abstract_excerpt":"This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we generalize the method by Goyal et al. for weighted graphs and show that it is possible to approximate the expansion of every cut in a weighted graph with the union of random spanning trees generated by a random walk on a weighted graph. Second, we show that our union of random spanning trees is a spectral sparsifier of the graph. Moreover, we show that $O(\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02569","kind":"arxiv","version":2},"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/1612.02569/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02569","created_at":"2026-07-05T00:11:46.021579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02569v2","created_at":"2026-07-05T00:11:46.021579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02569","created_at":"2026-07-05T00:11:46.021579+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZYQ2Z33UWKM","created_at":"2026-07-05T00:11:46.021579+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZYQ2Z33UWKMCGZF","created_at":"2026-07-05T00:11:46.021579+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZYQ2Z33","created_at":"2026-07-05T00:11:46.021579+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ","json":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ.json","graph_json":"https://pith.science/api/pith-number/EZYQ2Z33UWKMCGZFMV4W262ZKQ/graph.json","events_json":"https://pith.science/api/pith-number/EZYQ2Z33UWKMCGZFMV4W262ZKQ/events.json","paper":"https://pith.science/paper/EZYQ2Z33"},"agent_actions":{"view_html":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ","download_json":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ.json","view_paper":"https://pith.science/paper/EZYQ2Z33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02569&json=true","fetch_graph":"https://pith.science/api/pith-number/EZYQ2Z33UWKMCGZFMV4W262ZKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EZYQ2Z33UWKMCGZFMV4W262ZKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/action/storage_attestation","attest_author":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/action/author_attestation","sign_citation":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/action/citation_signature","submit_replication":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/action/replication_record"}},"created_at":"2026-07-05T00:11:46.021579+00:00","updated_at":"2026-07-05T00:11:46.021579+00:00"}