{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IHYUUMVHN7VOBUZ6SN6AYR727R","short_pith_number":"pith:IHYUUMVH","canonical_record":{"source":{"id":"2111.03528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-05T14:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"a924229d094c385824d08478390c5921810670f06b56cc9c3b9222bae15f082e","abstract_canon_sha256":"8e8fa5e40de940191783992cee705fd61d40d97c71359ec0c1734905de8bc13b"},"schema_version":"1.0"},"canonical_sha256":"41f14a32a76feae0d33e937c0c47fafc5a0e8992d7c2c0e160f0f01ea3892a8a","source":{"kind":"arxiv","id":"2111.03528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.03528","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"arxiv_version","alias_value":"2111.03528v1","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.03528","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_12","alias_value":"IHYUUMVHN7VO","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHYUUMVHN7VOBUZ6","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHYUUMVH","created_at":"2026-07-05T03:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IHYUUMVHN7VOBUZ6SN6AYR727R","target":"record","payload":{"canonical_record":{"source":{"id":"2111.03528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-05T14:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"a924229d094c385824d08478390c5921810670f06b56cc9c3b9222bae15f082e","abstract_canon_sha256":"8e8fa5e40de940191783992cee705fd61d40d97c71359ec0c1734905de8bc13b"},"schema_version":"1.0"},"canonical_sha256":"41f14a32a76feae0d33e937c0c47fafc5a0e8992d7c2c0e160f0f01ea3892a8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:25.419031Z","signature_b64":"8wueM92eDIOqL32jlQluaCf5+3fCCKXFHGaCHdcJNWAS6ndpCC+UGu1svCFTa5x4b/LijzwM0/8XPNz3hYozDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f14a32a76feae0d33e937c0c47fafc5a0e8992d7c2c0e160f0f01ea3892a8a","last_reissued_at":"2026-07-05T03:29:25.418551Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:25.418551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.03528","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-05T03:29:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYad5c9bOX6pk4z0k6Way9nBqT6wFV7Cryb06uFzbzZu/rdTwTwnqnTeX4ldcxNTPOL1Wm6yBY9DlkCwUYFCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:32:20.293256Z"},"content_sha256":"5f407861c1990c591c01f3943bad295158a8b50acaf0141dfcbd69d4890c5927","schema_version":"1.0","event_id":"sha256:5f407861c1990c591c01f3943bad295158a8b50acaf0141dfcbd69d4890c5927"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IHYUUMVHN7VOBUZ6SN6AYR727R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Streaming Algorithms for High Dimensional EMD and MST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, Erik Waingarten, Rajesh Jayaram, Xi Chen","submitted_at":"2021-11-05T14:34:39Z","abstract_excerpt":"We study streaming algorithms for two fundamental geometric problems: computing the cost of a Minimum Spanning Tree (MST) of an $n$-point set $X \\subset \\{1,2,\\dots,\\Delta\\}^d$, and computing the Earth Mover Distance (EMD) between two multi-sets $A,B \\subset \\{1,2,\\dots,\\Delta\\}^d$ of size $n$. We consider the turnstile model, where points can be added and removed. We give a one-pass streaming algorithm for MST and a two-pass streaming algorithm for EMD, both achieving an approximation factor of $\\tilde{O}(\\log n)$ and using polylog$(n,d,\\Delta)$-space only. Furthermore, our algorithm for EMD "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.03528","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/2111.03528/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-05T03:29:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCVwwv3WPnpjj1ePM8Pb/z+2oO2vmUpfaXIL/0kmunt6NZewXYgKPrm9hIOUVYfT/eODTnXJvCBXJRsVDlZABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:32:20.293604Z"},"content_sha256":"0fdb03154992d30b119323a0bb0c8b46cb0ba0fe836db59722ef534b43021083","schema_version":"1.0","event_id":"sha256:0fdb03154992d30b119323a0bb0c8b46cb0ba0fe836db59722ef534b43021083"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/bundle.json","state_url":"https://pith.science/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/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-20T15:32:20Z","links":{"resolver":"https://pith.science/pith/IHYUUMVHN7VOBUZ6SN6AYR727R","bundle":"https://pith.science/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/bundle.json","state":"https://pith.science/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHYUUMVHN7VOBUZ6SN6AYR727R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IHYUUMVHN7VOBUZ6SN6AYR727R","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":"8e8fa5e40de940191783992cee705fd61d40d97c71359ec0c1734905de8bc13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-05T14:34:39Z","title_canon_sha256":"a924229d094c385824d08478390c5921810670f06b56cc9c3b9222bae15f082e"},"schema_version":"1.0","source":{"id":"2111.03528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.03528","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"arxiv_version","alias_value":"2111.03528v1","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.03528","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_12","alias_value":"IHYUUMVHN7VO","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHYUUMVHN7VOBUZ6","created_at":"2026-07-05T03:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHYUUMVH","created_at":"2026-07-05T03:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:0fdb03154992d30b119323a0bb0c8b46cb0ba0fe836db59722ef534b43021083","target":"graph","created_at":"2026-07-05T03:29:25Z","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/2111.03528/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study streaming algorithms for two fundamental geometric problems: computing the cost of a Minimum Spanning Tree (MST) of an $n$-point set $X \\subset \\{1,2,\\dots,\\Delta\\}^d$, and computing the Earth Mover Distance (EMD) between two multi-sets $A,B \\subset \\{1,2,\\dots,\\Delta\\}^d$ of size $n$. We consider the turnstile model, where points can be added and removed. We give a one-pass streaming algorithm for MST and a two-pass streaming algorithm for EMD, both achieving an approximation factor of $\\tilde{O}(\\log n)$ and using polylog$(n,d,\\Delta)$-space only. Furthermore, our algorithm for EMD ","authors_text":"Amit Levi, Erik Waingarten, Rajesh Jayaram, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-05T14:34:39Z","title":"New Streaming Algorithms for High Dimensional EMD and MST"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.03528","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:5f407861c1990c591c01f3943bad295158a8b50acaf0141dfcbd69d4890c5927","target":"record","created_at":"2026-07-05T03:29:25Z","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":"8e8fa5e40de940191783992cee705fd61d40d97c71359ec0c1734905de8bc13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-05T14:34:39Z","title_canon_sha256":"a924229d094c385824d08478390c5921810670f06b56cc9c3b9222bae15f082e"},"schema_version":"1.0","source":{"id":"2111.03528","kind":"arxiv","version":1}},"canonical_sha256":"41f14a32a76feae0d33e937c0c47fafc5a0e8992d7c2c0e160f0f01ea3892a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f14a32a76feae0d33e937c0c47fafc5a0e8992d7c2c0e160f0f01ea3892a8a","first_computed_at":"2026-07-05T03:29:25.418551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:29:25.418551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wueM92eDIOqL32jlQluaCf5+3fCCKXFHGaCHdcJNWAS6ndpCC+UGu1svCFTa5x4b/LijzwM0/8XPNz3hYozDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:29:25.419031Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.03528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f407861c1990c591c01f3943bad295158a8b50acaf0141dfcbd69d4890c5927","sha256:0fdb03154992d30b119323a0bb0c8b46cb0ba0fe836db59722ef534b43021083"],"state_sha256":"ed61e898398ae3db95bf6ebe3f06e0912b1b53500e2fe087381b21463ddfe85a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8cEHdY4ZhjiE8zr090Ps1nijCVGYpHsNqeXAtjCfU3rhtquIGXyRweDZ5DQcbNVCow9wwPm7eDCbe0bknkBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T15:32:20.296801Z","bundle_sha256":"d6f1bd0f0c0c1583bb822e00316f0ce81b52dfd3829c3d9534fa25ab386290f7"}}