{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YUUS5QT5B6V5AY36SJCDMCLC4H","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":"d9f43f1bcfedf2deee4e98bf789cd5a3b25371f3f5f78999e5ddcda18a6048f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T21:36:53Z","title_canon_sha256":"a48c0029219efffd1826a121462dc22f8b4517d915ce50fab868bd93768a1388"},"schema_version":"1.0","source":{"id":"2607.13284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13284","created_at":"2026-07-16T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13284v1","created_at":"2026-07-16T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13284","created_at":"2026-07-16T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"YUUS5QT5B6V5","created_at":"2026-07-16T00:22:07Z"},{"alias_kind":"pith_short_16","alias_value":"YUUS5QT5B6V5AY36","created_at":"2026-07-16T00:22:07Z"},{"alias_kind":"pith_short_8","alias_value":"YUUS5QT5","created_at":"2026-07-16T00:22:07Z"}],"graph_snapshots":[{"event_id":"sha256:b23c89c38eae3468a07b0efafe10216b5f2e126a40c31466a34a2eedf2f203c6","target":"graph","created_at":"2026-07-16T00:22:07Z","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/2607.13284/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum spanning tree (MST) problem is one of the most basic optimization problems on metric spaces and graphs. We study the problem of computing a $(1+\\epsilon)$-approximation to the MST of an $n$-point metric space $(X, \\mathbf{d})$ of doubling dimension $\\mathrm{ddim}$. In doubling metrics, previous deterministic algorithms incur a running time with dependence $\\epsilon^{-O(\\mathrm{ddim})}$.\n  We give a deterministic algorithm that computes a $(1+\\epsilon)$-approximation to MST in time $2^{O(\\mathrm{ddim})} n \\bigl(\\log n + \\epsilon^{-1} \\log^4(1/\\epsilon)\\bigr)$. For bounded doubling d","authors_text":"Christian Sohler, Di Yue, Felix Hommelsheim, Jan H\\\"ockendorff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T21:36:53Z","title":"A Fast and Simple $(1+\\epsilon)$-Approximation for Minimum Spanning Trees in Doubling Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13284","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:dcd529cf862149345346b96b3d58d28a87b3fb028686c994029a5775c4ae7524","target":"record","created_at":"2026-07-16T00:22:07Z","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":"d9f43f1bcfedf2deee4e98bf789cd5a3b25371f3f5f78999e5ddcda18a6048f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T21:36:53Z","title_canon_sha256":"a48c0029219efffd1826a121462dc22f8b4517d915ce50fab868bd93768a1388"},"schema_version":"1.0","source":{"id":"2607.13284","kind":"arxiv","version":1}},"canonical_sha256":"c5292ec27d0fabd0637e9244360962e1ea8c6ba9a7b496d742797ac415be4834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5292ec27d0fabd0637e9244360962e1ea8c6ba9a7b496d742797ac415be4834","first_computed_at":"2026-07-16T00:22:07.635809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T00:22:07.635809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKNPpuZedgD4zRasmfuFlTO9AY+kUe2A2ZMOi0WnXDWuK11Ed8JJftBcrkbhWn+WT3vKQgiT0MEwoJXlf8aoBg==","signature_status":"signed_v1","signed_at":"2026-07-16T00:22:07.636658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcd529cf862149345346b96b3d58d28a87b3fb028686c994029a5775c4ae7524","sha256:b23c89c38eae3468a07b0efafe10216b5f2e126a40c31466a34a2eedf2f203c6"],"state_sha256":"ce3d9ddb44ad34c3598b45949fdc5222beec4359b7e4f7d171a42077fbdce1a9"}