{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EZYQ2Z33UWKMCGZFMV4W262ZKQ","short_pith_number":"pith:EZYQ2Z33","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"},"canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","source":{"kind":"arxiv","id":"1612.02569","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02569","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02569v2","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02569","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"EZYQ2Z33UWKM","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"EZYQ2Z33UWKMCGZF","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"EZYQ2Z33","created_at":"2026-07-05T00:11:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EZYQ2Z33UWKMCGZFMV4W262ZKQ","target":"record","payload":{"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"},"canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","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"},"source_kind":"arxiv","source_id":"1612.02569","source_version":2,"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-05T00:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7YIH2jyzYwmtOVtIv7U4oR1ieu5niGUIUEhOPIhG1u9In6SUCjgHWpwQmKf/reLUEBB/DEuN1j2z4u6oV7ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:43:31.999559Z"},"content_sha256":"382ed42023636e7f8ba242074d7c851f6f6dbea16c6d3e35d9b987d670b5644d","schema_version":"1.0","event_id":"sha256:382ed42023636e7f8ba242074d7c851f6f6dbea16c6d3e35d9b987d670b5644d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EZYQ2Z33UWKMCGZFMV4W262ZKQ","target":"graph","payload":{"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"},"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-05T00:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTZ7ZEytLV9Ce7drX+s+FdHjPcEsJUyZF/6z4I+SWWhXScUDwC1IIJyxg1Sqj8gRurSJTaUoUD3tGmwUrl6FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:43:32.000100Z"},"content_sha256":"010b7820182f2691877d0becea3ed47ab618411a42e931aea509e4d20399cd9c","schema_version":"1.0","event_id":"sha256:010b7820182f2691877d0becea3ed47ab618411a42e931aea509e4d20399cd9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/bundle.json","state_url":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/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-08-16T00:43:32Z","links":{"resolver":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ","bundle":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/bundle.json","state":"https://pith.science/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZYQ2Z33UWKMCGZFMV4W262ZKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EZYQ2Z33UWKMCGZFMV4W262ZKQ","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":"d42181d81d1cdb38506bdd217d5ae8506f00264735beee729dd9679ecb3972ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-08T09:17:12Z","title_canon_sha256":"3f8f4d418bab3f2584b787e7df2eea0d3665e5417bd986d241b248614b2b1392"},"schema_version":"1.0","source":{"id":"1612.02569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02569","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02569v2","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02569","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"EZYQ2Z33UWKM","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"EZYQ2Z33UWKMCGZF","created_at":"2026-07-05T00:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"EZYQ2Z33","created_at":"2026-07-05T00:11:46Z"}],"graph_snapshots":[{"event_id":"sha256:010b7820182f2691877d0becea3ed47ab618411a42e931aea509e4d20399cd9c","target":"graph","created_at":"2026-07-05T00:11:46Z","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/1612.02569/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Daniel Khankin, Shlomi Dolev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-08T09:17:12Z","title":"Random Spanning Trees for Expanders, Sparsifiers, and Virtual Network Security"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02569","kind":"arxiv","version":2},"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:382ed42023636e7f8ba242074d7c851f6f6dbea16c6d3e35d9b987d670b5644d","target":"record","created_at":"2026-07-05T00:11:46Z","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":"d42181d81d1cdb38506bdd217d5ae8506f00264735beee729dd9679ecb3972ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-08T09:17:12Z","title_canon_sha256":"3f8f4d418bab3f2584b787e7df2eea0d3665e5417bd986d241b248614b2b1392"},"schema_version":"1.0","source":{"id":"1612.02569","kind":"arxiv","version":2}},"canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26710d677ba594c11b2565796d7b595430f7a137e2d33924f47ee7be167371ad","first_computed_at":"2026-07-05T00:11:46.021522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:46.021522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4QuL5IqbCbe4F/j/nMRolyFGje5dUQbspCjIzMi4MtR7kGs0y7hBXBH+s4jTmEmzYD9PD2S5xPu3XQeIA8SMDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:46.021958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:382ed42023636e7f8ba242074d7c851f6f6dbea16c6d3e35d9b987d670b5644d","sha256:010b7820182f2691877d0becea3ed47ab618411a42e931aea509e4d20399cd9c"],"state_sha256":"6e574cdd8a975a9b4795676a2f7cfe89dc102f139a2b320a940f0acaab2f5b19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LN/aBkOHNk5itgQ/VrDtFd0TsHtiK2ItG+imdbDHY8X4F/jgClLgpa4CAZIDWkyXpGOBujH6j9LYGjivRH9LCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T00:43:32.004398Z","bundle_sha256":"8e9e919a9e260c3a10fad220f8326a8ff8b7bfcfb796b9edb2a2971300e43fad"}}