{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:75LM2IQIUGMR3GWV75R73E7RPR","short_pith_number":"pith:75LM2IQI","canonical_record":{"source":{"id":"1605.01566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-05-05T12:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"b73a5a762b7cc9a252d10ad7992978a08db514690ba8780571f3c6a1c2d9de6d","abstract_canon_sha256":"42aa7c04e37442ab614cf651294ac17416c81dc6b8a9ef956f650069f2cc94fe"},"schema_version":"1.0"},"canonical_sha256":"ff56cd2208a1991d9ad5ff63fd93f17c551eb4cd9e55c66c8e41f675ab381ffc","source":{"kind":"arxiv","id":"1605.01566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01566","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01566v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01566","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"75LM2IQIUGMR","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"75LM2IQIUGMR3GWV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"75LM2IQI","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:75LM2IQIUGMR3GWV75R73E7RPR","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-05-05T12:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"b73a5a762b7cc9a252d10ad7992978a08db514690ba8780571f3c6a1c2d9de6d","abstract_canon_sha256":"42aa7c04e37442ab614cf651294ac17416c81dc6b8a9ef956f650069f2cc94fe"},"schema_version":"1.0"},"canonical_sha256":"ff56cd2208a1991d9ad5ff63fd93f17c551eb4cd9e55c66c8e41f675ab381ffc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.327401Z","signature_b64":"Zz/Ei/PxC1Q5sj+z7l6o7nkC2WB8LxfraM3siv59GB9IIVIzW7C48HwT5qKF8Tdvb1qxOuuAgmPsOatpUQN2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff56cd2208a1991d9ad5ff63fd93f17c551eb4cd9e55c66c8e41f675ab381ffc","last_reissued_at":"2026-05-18T01:15:33.326667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.326667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01566","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-05-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkZxdkdq1R5xOw4OldbCOAGaW95e14H/JcTNObzmwV916z4sYm75bPScimIDg/sHvZ7p0PvWDF4WOeUiv/a9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:19:32.146275Z"},"content_sha256":"e86e9031cbdefe975ef5b3400b056f9c9b654b49ab02a415cc7e1f254debb3b5","schema_version":"1.0","event_id":"sha256:e86e9031cbdefe975ef5b3400b056f9c9b654b49ab02a415cc7e1f254debb3b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:75LM2IQIUGMR3GWV75R73E7RPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Calculation of Minimum Spanning Tree Edges Lengths using Gromov--Hausdorff Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexey A. Tuzhilin","submitted_at":"2016-05-05T12:05:52Z","abstract_excerpt":"In the present paper we show how one can calculate the lengths of edges of a minimum spanning tree constructed for a finite metric space, in terms of the Gromov-Hausdorff distances from this space to simplices of sufficiently large diameter. Here by simplices we mean finite metric spaces all of whose nonzero distances are the same. As an application, we reduce the problems of finding a Steiner minimal tree length or a minimal filling length to maximization of the total distance to some finite number of simplices considered as points of the Gromov-Hausdorff space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01566","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":""},"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-05-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rhfa0q6JpN543KG782oMt/npRWqpH0A/EA8/2gsEoQjpHYQR7qh/5r2z05dfh3ebU896IxltjxR/LrkFUtWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:19:32.146772Z"},"content_sha256":"6c8d36446a1cfbca7a8929f992b3c17d16aab5469e70f7974b5c487f5ca86912","schema_version":"1.0","event_id":"sha256:6c8d36446a1cfbca7a8929f992b3c17d16aab5469e70f7974b5c487f5ca86912"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75LM2IQIUGMR3GWV75R73E7RPR/bundle.json","state_url":"https://pith.science/pith/75LM2IQIUGMR3GWV75R73E7RPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75LM2IQIUGMR3GWV75R73E7RPR/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-05-25T19:19:32Z","links":{"resolver":"https://pith.science/pith/75LM2IQIUGMR3GWV75R73E7RPR","bundle":"https://pith.science/pith/75LM2IQIUGMR3GWV75R73E7RPR/bundle.json","state":"https://pith.science/pith/75LM2IQIUGMR3GWV75R73E7RPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75LM2IQIUGMR3GWV75R73E7RPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:75LM2IQIUGMR3GWV75R73E7RPR","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":"42aa7c04e37442ab614cf651294ac17416c81dc6b8a9ef956f650069f2cc94fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-05-05T12:05:52Z","title_canon_sha256":"b73a5a762b7cc9a252d10ad7992978a08db514690ba8780571f3c6a1c2d9de6d"},"schema_version":"1.0","source":{"id":"1605.01566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01566","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01566v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01566","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"75LM2IQIUGMR","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"75LM2IQIUGMR3GWV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"75LM2IQI","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:6c8d36446a1cfbca7a8929f992b3c17d16aab5469e70f7974b5c487f5ca86912","target":"graph","created_at":"2026-05-18T01:15:33Z","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"},"paper":{"abstract_excerpt":"In the present paper we show how one can calculate the lengths of edges of a minimum spanning tree constructed for a finite metric space, in terms of the Gromov-Hausdorff distances from this space to simplices of sufficiently large diameter. Here by simplices we mean finite metric spaces all of whose nonzero distances are the same. As an application, we reduce the problems of finding a Steiner minimal tree length or a minimal filling length to maximization of the total distance to some finite number of simplices considered as points of the Gromov-Hausdorff space.","authors_text":"Alexey A. Tuzhilin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-05-05T12:05:52Z","title":"Calculation of Minimum Spanning Tree Edges Lengths using Gromov--Hausdorff Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01566","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:e86e9031cbdefe975ef5b3400b056f9c9b654b49ab02a415cc7e1f254debb3b5","target":"record","created_at":"2026-05-18T01:15:33Z","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":"42aa7c04e37442ab614cf651294ac17416c81dc6b8a9ef956f650069f2cc94fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-05-05T12:05:52Z","title_canon_sha256":"b73a5a762b7cc9a252d10ad7992978a08db514690ba8780571f3c6a1c2d9de6d"},"schema_version":"1.0","source":{"id":"1605.01566","kind":"arxiv","version":1}},"canonical_sha256":"ff56cd2208a1991d9ad5ff63fd93f17c551eb4cd9e55c66c8e41f675ab381ffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff56cd2208a1991d9ad5ff63fd93f17c551eb4cd9e55c66c8e41f675ab381ffc","first_computed_at":"2026-05-18T01:15:33.326667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.326667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zz/Ei/PxC1Q5sj+z7l6o7nkC2WB8LxfraM3siv59GB9IIVIzW7C48HwT5qKF8Tdvb1qxOuuAgmPsOatpUQN2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.327401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e86e9031cbdefe975ef5b3400b056f9c9b654b49ab02a415cc7e1f254debb3b5","sha256:6c8d36446a1cfbca7a8929f992b3c17d16aab5469e70f7974b5c487f5ca86912"],"state_sha256":"2ece505cb23d2f486cbdec621caadd9f4011f394de409887f57b1ef8b7617b54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwYCJOkenypZkmu+ucdzA/ZoZWEnIqGxqMWLP0NVknCk1I5j3FzjDO4TWXrs7JtEF0aVLfpvJRr0e2fYgTmCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:19:32.149632Z","bundle_sha256":"c47b35cae842003088c1ef2b9f409a5ebefb8369563dedc9306fd6ee3434296e"}}