{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:35XU5JBFFNCGBI2PBHU73KDBI4","short_pith_number":"pith:35XU5JBF","canonical_record":{"source":{"id":"2411.13334","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"cd81256e775b462c01c34c5d560ea0f853f876be478e9518080d23ef7ff0549e","abstract_canon_sha256":"c3876ebb129cf216a39719992a20a7c3cf9e166bb49861aaf57513ab7432ac2d"},"schema_version":"1.0"},"canonical_sha256":"df6f4ea4252b4460a34f09e9fda861472afcd31a0e30d2d5ae77ab9934f93ab8","source":{"kind":"arxiv","id":"2411.13334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13334","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13334v2","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13334","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"35XU5JBFFNCG","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_16","alias_value":"35XU5JBFFNCGBI2P","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_8","alias_value":"35XU5JBF","created_at":"2026-07-05T11:00:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:35XU5JBFFNCGBI2PBHU73KDBI4","target":"record","payload":{"canonical_record":{"source":{"id":"2411.13334","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"cd81256e775b462c01c34c5d560ea0f853f876be478e9518080d23ef7ff0549e","abstract_canon_sha256":"c3876ebb129cf216a39719992a20a7c3cf9e166bb49861aaf57513ab7432ac2d"},"schema_version":"1.0"},"canonical_sha256":"df6f4ea4252b4460a34f09e9fda861472afcd31a0e30d2d5ae77ab9934f93ab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:40.372950Z","signature_b64":"SVtM/riVcYEGOxRgRyvlR2dfFXfq0PRISw3RXtQrPoh3vwuvsa5PPQ7x/0i180F08gc6Y85NrdbBaPpdHo1NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df6f4ea4252b4460a34f09e9fda861472afcd31a0e30d2d5ae77ab9934f93ab8","last_reissued_at":"2026-07-05T11:00:40.372376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:40.372376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.13334","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-05T11:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QaqzMtkCYJ4wztl1ctE8RL6ONYyipRcVtQVaxCwmeuZ5bPFS5FICfFClJuygQWC3rK9OgbyDXPbEtSn21taKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:35:07.651995Z"},"content_sha256":"34f7c1e815d44448150fd618f04440c94344efda5f269b6b5da97c92d420d17a","schema_version":"1.0","event_id":"sha256:34f7c1e815d44448150fd618f04440c94344efda5f269b6b5da97c92d420d17a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:35XU5JBFFNCGBI2PBHU73KDBI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joshua Z. Sobel, Sourya Roy, Sriram V. Pemmaraju","submitted_at":"2024-11-20T14:07:23Z","abstract_excerpt":"We present the first sublinear-in-$n$ round algorithm for sampling an approximately uniform spanning tree of an $n$-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires $\\Tilde{O}(n^{0.657})$ rounds for sampling a spanning tree within total variation distance $1/n^c$, for arbitrary constant $c > 0$, from the uniform distribution. More precisely, our algorithm requires $\\Tilde{O}(n^{1/2 + \\alpha})$ rounds, where $O(n^\\alpha)$ is the running time of matrix multiplication in the CongestedClique model (currently $\\alpha = 1 - 2/\\omega = 0.157$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13334","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/2411.13334/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:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KOQ/occB5Wqrswl3RcxNj4n7AaW5geSUO98r3o6tBulXkRIlzV5U8EmKRxoZuTfeTKkKK7c1DwCSok/aHRMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:35:07.652380Z"},"content_sha256":"810e4e7a7730310e491d457e031d7765f7438abce6574aa3958458b3c3d3ed8f","schema_version":"1.0","event_id":"sha256:810e4e7a7730310e491d457e031d7765f7438abce6574aa3958458b3c3d3ed8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35XU5JBFFNCGBI2PBHU73KDBI4/bundle.json","state_url":"https://pith.science/pith/35XU5JBFFNCGBI2PBHU73KDBI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35XU5JBFFNCGBI2PBHU73KDBI4/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-12T23:35:07Z","links":{"resolver":"https://pith.science/pith/35XU5JBFFNCGBI2PBHU73KDBI4","bundle":"https://pith.science/pith/35XU5JBFFNCGBI2PBHU73KDBI4/bundle.json","state":"https://pith.science/pith/35XU5JBFFNCGBI2PBHU73KDBI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35XU5JBFFNCGBI2PBHU73KDBI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:35XU5JBFFNCGBI2PBHU73KDBI4","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":"c3876ebb129cf216a39719992a20a7c3cf9e166bb49861aaf57513ab7432ac2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:07:23Z","title_canon_sha256":"cd81256e775b462c01c34c5d560ea0f853f876be478e9518080d23ef7ff0549e"},"schema_version":"1.0","source":{"id":"2411.13334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13334","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13334v2","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13334","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"35XU5JBFFNCG","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_16","alias_value":"35XU5JBFFNCGBI2P","created_at":"2026-07-05T11:00:40Z"},{"alias_kind":"pith_short_8","alias_value":"35XU5JBF","created_at":"2026-07-05T11:00:40Z"}],"graph_snapshots":[{"event_id":"sha256:810e4e7a7730310e491d457e031d7765f7438abce6574aa3958458b3c3d3ed8f","target":"graph","created_at":"2026-07-05T11:00:40Z","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/2411.13334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the first sublinear-in-$n$ round algorithm for sampling an approximately uniform spanning tree of an $n$-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires $\\Tilde{O}(n^{0.657})$ rounds for sampling a spanning tree within total variation distance $1/n^c$, for arbitrary constant $c > 0$, from the uniform distribution. More precisely, our algorithm requires $\\Tilde{O}(n^{1/2 + \\alpha})$ rounds, where $O(n^\\alpha)$ is the running time of matrix multiplication in the CongestedClique model (currently $\\alpha = 1 - 2/\\omega = 0.157$, ","authors_text":"Joshua Z. Sobel, Sourya Roy, Sriram V. Pemmaraju","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13334","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:34f7c1e815d44448150fd618f04440c94344efda5f269b6b5da97c92d420d17a","target":"record","created_at":"2026-07-05T11:00:40Z","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":"c3876ebb129cf216a39719992a20a7c3cf9e166bb49861aaf57513ab7432ac2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:07:23Z","title_canon_sha256":"cd81256e775b462c01c34c5d560ea0f853f876be478e9518080d23ef7ff0549e"},"schema_version":"1.0","source":{"id":"2411.13334","kind":"arxiv","version":2}},"canonical_sha256":"df6f4ea4252b4460a34f09e9fda861472afcd31a0e30d2d5ae77ab9934f93ab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df6f4ea4252b4460a34f09e9fda861472afcd31a0e30d2d5ae77ab9934f93ab8","first_computed_at":"2026-07-05T11:00:40.372376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:40.372376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVtM/riVcYEGOxRgRyvlR2dfFXfq0PRISw3RXtQrPoh3vwuvsa5PPQ7x/0i180F08gc6Y85NrdbBaPpdHo1NCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:40.372950Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f7c1e815d44448150fd618f04440c94344efda5f269b6b5da97c92d420d17a","sha256:810e4e7a7730310e491d457e031d7765f7438abce6574aa3958458b3c3d3ed8f"],"state_sha256":"2b59d8142e45a5a2f32177f13e8ee4ec9561231a6e2e0134ca4b448d7cd0aa9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+oLoZMZ/ra1DfFcUuMKdj/OwYiHWUULiY3xX6FykzoqhAeZSrg4qBKA+N4WxQIBEuB1mqNd8BxDbGpDL1d/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:35:07.655830Z","bundle_sha256":"2d31c740d668ff921ccb6ea0817253f8b3003b943a7de7b10d48d9f0c2bb3ba1"}}