{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HYI4E7OA4L4Z3RGMRATWG2LG4V","short_pith_number":"pith:HYI4E7OA","canonical_record":{"source":{"id":"2502.12993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:13:46Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"ab1001dac571774af532021082ab519cdbfdc6aff93b8ff5666dd4f27996c3ed","abstract_canon_sha256":"56d5abaebd8a9af59a39dbac1d399cdd44d737b9bec63781ede962738475e0de"},"schema_version":"1.0"},"canonical_sha256":"3e11c27dc0e2f99dc4cc8827636966e575494005079744df88ca2ca88052a8f6","source":{"kind":"arxiv","id":"2502.12993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12993","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12993v1","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12993","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"HYI4E7OA4L4Z","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_16","alias_value":"HYI4E7OA4L4Z3RGM","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_8","alias_value":"HYI4E7OA","created_at":"2026-07-05T10:16:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HYI4E7OA4L4Z3RGMRATWG2LG4V","target":"record","payload":{"canonical_record":{"source":{"id":"2502.12993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:13:46Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"ab1001dac571774af532021082ab519cdbfdc6aff93b8ff5666dd4f27996c3ed","abstract_canon_sha256":"56d5abaebd8a9af59a39dbac1d399cdd44d737b9bec63781ede962738475e0de"},"schema_version":"1.0"},"canonical_sha256":"3e11c27dc0e2f99dc4cc8827636966e575494005079744df88ca2ca88052a8f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:27.669101Z","signature_b64":"zJGUFfvl8rztUR0MDiQ0oC+EYQWRqUPUkdgDRQuSQ0jaXzVOafKBbFYcH8scp/DNWAw/RBbWBtvbiZgM31puAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e11c27dc0e2f99dc4cc8827636966e575494005079744df88ca2ca88052a8f6","last_reissued_at":"2026-07-05T10:16:27.668589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:27.668589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.12993","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-05T10:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkeGcLE+NWbWcNzZCzQs1smSiKGeGndY8CkUz8Wtv7ZfmriAweKQ6ntV2GLiqUMakHdH3BZb4Z04uHr8KUK0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:02:12.766044Z"},"content_sha256":"0b2569843e8f8f7ea44619bae537b5427e6d3108ca531e8944281059ac3e46bf","schema_version":"1.0","event_id":"sha256:0b2569843e8f8f7ea44619bae537b5427e6d3108ca531e8944281059ac3e46bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HYI4E7OA4L4Z3RGMRATWG2LG4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Benjamin W. Priest, Geoffrey Sanders, Keita Iwabuchi, Nate Veldt, Thomas Stanley, Trevor Steil, T.S. Jayram","submitted_at":"2025-02-18T16:13:46Z","abstract_excerpt":"Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\\Omega(n^2)$ time to even approximate. We introduce a framework for metric MSTs that first (1) finds a forest of disconnected components using practical heuristics, and then (2) finds a small weight set of edges to connect disjoint components of the forest into a spanning tree. We prove that optimally solving the second step still takes $\\Omega(n^2)$ time, but we provide a subquadratic 2.62-approximation algorithm. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12993","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/2502.12993/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-05T10:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99nS0w1Ktlxc9fP5bHJi5FU9Vfc7FioJXuwESFLWxl5QUlUJBfPoVyCJ0AbLX9KJesYiR2dYS9PR3/4WtlJ1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:02:12.766436Z"},"content_sha256":"992371f43d879b69269f64222b069a311a54c4a824469d60cefe0a11d926895d","schema_version":"1.0","event_id":"sha256:992371f43d879b69269f64222b069a311a54c4a824469d60cefe0a11d926895d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/bundle.json","state_url":"https://pith.science/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/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-03T19:02:12Z","links":{"resolver":"https://pith.science/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V","bundle":"https://pith.science/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/bundle.json","state":"https://pith.science/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYI4E7OA4L4Z3RGMRATWG2LG4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HYI4E7OA4L4Z3RGMRATWG2LG4V","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":"56d5abaebd8a9af59a39dbac1d399cdd44d737b9bec63781ede962738475e0de","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:13:46Z","title_canon_sha256":"ab1001dac571774af532021082ab519cdbfdc6aff93b8ff5666dd4f27996c3ed"},"schema_version":"1.0","source":{"id":"2502.12993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12993","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12993v1","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12993","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"HYI4E7OA4L4Z","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_16","alias_value":"HYI4E7OA4L4Z3RGM","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_8","alias_value":"HYI4E7OA","created_at":"2026-07-05T10:16:27Z"}],"graph_snapshots":[{"event_id":"sha256:992371f43d879b69269f64222b069a311a54c4a824469d60cefe0a11d926895d","target":"graph","created_at":"2026-07-05T10:16:27Z","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/2502.12993/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\\Omega(n^2)$ time to even approximate. We introduce a framework for metric MSTs that first (1) finds a forest of disconnected components using practical heuristics, and then (2) finds a small weight set of edges to connect disjoint components of the forest into a spanning tree. We prove that optimally solving the second step still takes $\\Omega(n^2)$ time, but we provide a subquadratic 2.62-approximation algorithm. In ","authors_text":"Benjamin W. Priest, Geoffrey Sanders, Keita Iwabuchi, Nate Veldt, Thomas Stanley, Trevor Steil, T.S. Jayram","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:13:46Z","title":"Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12993","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:0b2569843e8f8f7ea44619bae537b5427e6d3108ca531e8944281059ac3e46bf","target":"record","created_at":"2026-07-05T10:16:27Z","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":"56d5abaebd8a9af59a39dbac1d399cdd44d737b9bec63781ede962738475e0de","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:13:46Z","title_canon_sha256":"ab1001dac571774af532021082ab519cdbfdc6aff93b8ff5666dd4f27996c3ed"},"schema_version":"1.0","source":{"id":"2502.12993","kind":"arxiv","version":1}},"canonical_sha256":"3e11c27dc0e2f99dc4cc8827636966e575494005079744df88ca2ca88052a8f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e11c27dc0e2f99dc4cc8827636966e575494005079744df88ca2ca88052a8f6","first_computed_at":"2026-07-05T10:16:27.668589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:27.668589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zJGUFfvl8rztUR0MDiQ0oC+EYQWRqUPUkdgDRQuSQ0jaXzVOafKBbFYcH8scp/DNWAw/RBbWBtvbiZgM31puAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:27.669101Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.12993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b2569843e8f8f7ea44619bae537b5427e6d3108ca531e8944281059ac3e46bf","sha256:992371f43d879b69269f64222b069a311a54c4a824469d60cefe0a11d926895d"],"state_sha256":"5619438eff6dc0cabf6bc8da3659e91797fd9c6d3eddbe72b41cb0e64776f730"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0mxFWWuHzFNG4LQkB2rl+MAEfgwxuL5ijcJMoEtib09Ag+6+M4Gi/aSUMB50scB48v+4RkRNHEs2lwB2BUJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:02:12.769317Z","bundle_sha256":"346ed10165e064c8afb478deabd6bbfc620d7e98b785c71e8f256f27b84f0c38"}}