{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YUUS5QT5B6V5AY36SJCDMCLC4H","short_pith_number":"pith:YUUS5QT5","canonical_record":{"source":{"id":"2607.13284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T21:36:53Z","cross_cats_sorted":[],"title_canon_sha256":"a48c0029219efffd1826a121462dc22f8b4517d915ce50fab868bd93768a1388","abstract_canon_sha256":"d9f43f1bcfedf2deee4e98bf789cd5a3b25371f3f5f78999e5ddcda18a6048f9"},"schema_version":"1.0"},"canonical_sha256":"c5292ec27d0fabd0637e9244360962e1ea8c6ba9a7b496d742797ac415be4834","source":{"kind":"arxiv","id":"2607.13284","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YUUS5QT5B6V5AY36SJCDMCLC4H","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T21:36:53Z","cross_cats_sorted":[],"title_canon_sha256":"a48c0029219efffd1826a121462dc22f8b4517d915ce50fab868bd93768a1388","abstract_canon_sha256":"d9f43f1bcfedf2deee4e98bf789cd5a3b25371f3f5f78999e5ddcda18a6048f9"},"schema_version":"1.0"},"canonical_sha256":"c5292ec27d0fabd0637e9244360962e1ea8c6ba9a7b496d742797ac415be4834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:07.636658Z","signature_b64":"ZKNPpuZedgD4zRasmfuFlTO9AY+kUe2A2ZMOi0WnXDWuK11Ed8JJftBcrkbhWn+WT3vKQgiT0MEwoJXlf8aoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5292ec27d0fabd0637e9244360962e1ea8c6ba9a7b496d742797ac415be4834","last_reissued_at":"2026-07-16T00:22:07.635809Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:07.635809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13284","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-16T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXAsYfbJmL7f7ZYEmzcGQhjyHpbreHLmxTpnKjMMCGPOCluP1X+OY03OfhsPovbn6N/331Qjq9DMpttqTPosBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:42:29.865541Z"},"content_sha256":"dcd529cf862149345346b96b3d58d28a87b3fb028686c994029a5775c4ae7524","schema_version":"1.0","event_id":"sha256:dcd529cf862149345346b96b3d58d28a87b3fb028686c994029a5775c4ae7524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YUUS5QT5B6V5AY36SJCDMCLC4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast and Simple $(1+\\epsilon)$-Approximation for Minimum Spanning Trees in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Di Yue, Felix Hommelsheim, Jan H\\\"ockendorff","submitted_at":"2026-07-14T21:36:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13284","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/2607.13284/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-16T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+3b7VgIxpn7/b0PkHPqjHWnaqECUjkHFfFXckTXHkUCVh9L8k342FwUl4C85nw85VWSnk9slBCqx/7Bb4A8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:42:29.866049Z"},"content_sha256":"b23c89c38eae3468a07b0efafe10216b5f2e126a40c31466a34a2eedf2f203c6","schema_version":"1.0","event_id":"sha256:b23c89c38eae3468a07b0efafe10216b5f2e126a40c31466a34a2eedf2f203c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/bundle.json","state_url":"https://pith.science/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/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-04T02:42:29Z","links":{"resolver":"https://pith.science/pith/YUUS5QT5B6V5AY36SJCDMCLC4H","bundle":"https://pith.science/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/bundle.json","state":"https://pith.science/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUUS5QT5B6V5AY36SJCDMCLC4H/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSxAJLxq6XqK5p6gpk/y9FiZjevDbnXZ5ShDMJOkXS5N1InUpbNrr+p06/aVdbKbJDTcNkaVVngY8MF6lyZiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:42:29.871222Z","bundle_sha256":"79688da1cd48ab5f723a31ae92deb5e217b8d132cec33ba59eedf0fb507cde27"}}