{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:76R7LTXKUJ4QKR65VP7H6DAIMC","short_pith_number":"pith:76R7LTXK","canonical_record":{"source":{"id":"2212.06546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T12:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"19fc4c26dec53907710b015577f1c850de93f1eea54eb4e873d142aeec18b781","abstract_canon_sha256":"b90a28e35d527c763efde85be5f12ab741af6d20fd6f944538c269af8463e41e"},"schema_version":"1.0"},"canonical_sha256":"ffa3f5ceeaa2790547ddabfe7f0c0860a40b583d79acc1a45f98d16341405ba4","source":{"kind":"arxiv","id":"2212.06546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.06546","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"arxiv_version","alias_value":"2212.06546v1","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06546","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_12","alias_value":"76R7LTXKUJ4Q","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_16","alias_value":"76R7LTXKUJ4QKR65","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_8","alias_value":"76R7LTXK","created_at":"2026-07-05T05:24:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:76R7LTXKUJ4QKR65VP7H6DAIMC","target":"record","payload":{"canonical_record":{"source":{"id":"2212.06546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T12:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"19fc4c26dec53907710b015577f1c850de93f1eea54eb4e873d142aeec18b781","abstract_canon_sha256":"b90a28e35d527c763efde85be5f12ab741af6d20fd6f944538c269af8463e41e"},"schema_version":"1.0"},"canonical_sha256":"ffa3f5ceeaa2790547ddabfe7f0c0860a40b583d79acc1a45f98d16341405ba4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:51.723435Z","signature_b64":"iBic9/egdXccWh9cdTDDewPyZDe4aHI9kMKCgdpHxgrEO5kt1DK7YoCWrSobwooQUvzbVeN9cByT0Vm7TiWkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffa3f5ceeaa2790547ddabfe7f0c0860a40b583d79acc1a45f98d16341405ba4","last_reissued_at":"2026-07-05T05:24:51.723035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:51.723035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.06546","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-05T05:24:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dDvruG2hq+R87xLJxS74saQLQwH7aVfNg8zz1YC4/uAHVyVrWJM2+9vGG0xFLFfydLS7u+8WxfwM33mXbglBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:21:41.725759Z"},"content_sha256":"edafb97a1ac585b9520441d0f1210884f64c78f66e97b800e803256a3614f464","schema_version":"1.0","event_id":"sha256:edafb97a1ac585b9520441d0f1210884f64c78f66e97b800e803256a3614f464"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:76R7LTXKUJ4QKR65VP7H6DAIMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Euclidean MST to a Constant Factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, Erik Waingarten, Rajesh Jayaram, Vincent Cohen-Addad, Xi Chen","submitted_at":"2022-12-13T12:58:17Z","abstract_excerpt":"We study streaming algorithms for the fundamental geometric problem of computing the cost of the Euclidean Minimum Spanning Tree (MST) on an $n$-point set $X \\subset \\mathbb{R}^d$. In the streaming model, the points in $X$ can be added and removed arbitrarily, and the goal is to maintain an approximation in small space. In low dimensions, $(1+\\epsilon)$ approximations are possible in sublinear space [Frahling, Indyk, Sohler, SoCG '05]. However, for high dimensional spaces the best known approximation for this problem was $\\tilde{O}(\\log n)$, due to [Chen, Jayaram, Levi, Waingarten, STOC '22], "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06546","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/2212.06546/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-05T05:24:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFVz1zLhibLTg/fcFazze6a66fVI5XM+giI8pGdEV3zXrezKxkw6MVLrcrY8BYhpA3Ud8WJFUHCiCbtPBNEoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:21:41.726580Z"},"content_sha256":"b97471f8347f23b5a373daeaa257bfa18a9304907f6bdbd21c1d8795770c8d62","schema_version":"1.0","event_id":"sha256:b97471f8347f23b5a373daeaa257bfa18a9304907f6bdbd21c1d8795770c8d62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/bundle.json","state_url":"https://pith.science/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/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-11T08:21:41Z","links":{"resolver":"https://pith.science/pith/76R7LTXKUJ4QKR65VP7H6DAIMC","bundle":"https://pith.science/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/bundle.json","state":"https://pith.science/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76R7LTXKUJ4QKR65VP7H6DAIMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:76R7LTXKUJ4QKR65VP7H6DAIMC","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":"b90a28e35d527c763efde85be5f12ab741af6d20fd6f944538c269af8463e41e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T12:58:17Z","title_canon_sha256":"19fc4c26dec53907710b015577f1c850de93f1eea54eb4e873d142aeec18b781"},"schema_version":"1.0","source":{"id":"2212.06546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.06546","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"arxiv_version","alias_value":"2212.06546v1","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06546","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_12","alias_value":"76R7LTXKUJ4Q","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_16","alias_value":"76R7LTXKUJ4QKR65","created_at":"2026-07-05T05:24:51Z"},{"alias_kind":"pith_short_8","alias_value":"76R7LTXK","created_at":"2026-07-05T05:24:51Z"}],"graph_snapshots":[{"event_id":"sha256:b97471f8347f23b5a373daeaa257bfa18a9304907f6bdbd21c1d8795770c8d62","target":"graph","created_at":"2026-07-05T05:24:51Z","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/2212.06546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study streaming algorithms for the fundamental geometric problem of computing the cost of the Euclidean Minimum Spanning Tree (MST) on an $n$-point set $X \\subset \\mathbb{R}^d$. In the streaming model, the points in $X$ can be added and removed arbitrarily, and the goal is to maintain an approximation in small space. In low dimensions, $(1+\\epsilon)$ approximations are possible in sublinear space [Frahling, Indyk, Sohler, SoCG '05]. However, for high dimensional spaces the best known approximation for this problem was $\\tilde{O}(\\log n)$, due to [Chen, Jayaram, Levi, Waingarten, STOC '22], ","authors_text":"Amit Levi, Erik Waingarten, Rajesh Jayaram, Vincent Cohen-Addad, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T12:58:17Z","title":"Streaming Euclidean MST to a Constant Factor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06546","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:edafb97a1ac585b9520441d0f1210884f64c78f66e97b800e803256a3614f464","target":"record","created_at":"2026-07-05T05:24:51Z","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":"b90a28e35d527c763efde85be5f12ab741af6d20fd6f944538c269af8463e41e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T12:58:17Z","title_canon_sha256":"19fc4c26dec53907710b015577f1c850de93f1eea54eb4e873d142aeec18b781"},"schema_version":"1.0","source":{"id":"2212.06546","kind":"arxiv","version":1}},"canonical_sha256":"ffa3f5ceeaa2790547ddabfe7f0c0860a40b583d79acc1a45f98d16341405ba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffa3f5ceeaa2790547ddabfe7f0c0860a40b583d79acc1a45f98d16341405ba4","first_computed_at":"2026-07-05T05:24:51.723035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:24:51.723035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iBic9/egdXccWh9cdTDDewPyZDe4aHI9kMKCgdpHxgrEO5kt1DK7YoCWrSobwooQUvzbVeN9cByT0Vm7TiWkDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:24:51.723435Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.06546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edafb97a1ac585b9520441d0f1210884f64c78f66e97b800e803256a3614f464","sha256:b97471f8347f23b5a373daeaa257bfa18a9304907f6bdbd21c1d8795770c8d62"],"state_sha256":"582eb0a6106fef8506a29d84c371325ea94df703714e4511cc3ca27404f84ab4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsd7A1Yix9B/ygTPKPSr5f5h+qOO8cZVuPrRztwxiWLzf9/WpT1BE8f8emgwddX+ut10iervfXmeYPF7y3f4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:21:41.732599Z","bundle_sha256":"cf7d14816c32361031b0a973a719d28c0551ac0edf20f87dcaf09162abf75a78"}}