{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HI7PNKFQSGNFRSFW6MS3CKBVY5","short_pith_number":"pith:HI7PNKFQ","canonical_record":{"source":{"id":"1403.3831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-15T17:58:59Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"9cc0f31da6770841cb08282c9950f2469110ef523d4c116c8d7de367ec6dfbb4","abstract_canon_sha256":"ecd1dd8cca60d272dd4374be04485d94713f90dc2f7de037aec4c756ba8a45e5"},"schema_version":"1.0"},"canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","source":{"kind":"arxiv","id":"1403.3831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3831","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3831v1","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3831","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"HI7PNKFQSGNF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HI7PNKFQSGNFRSFW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HI7PNKFQ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HI7PNKFQSGNFRSFW6MS3CKBVY5","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-15T17:58:59Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"9cc0f31da6770841cb08282c9950f2469110ef523d4c116c8d7de367ec6dfbb4","abstract_canon_sha256":"ecd1dd8cca60d272dd4374be04485d94713f90dc2f7de037aec4c756ba8a45e5"},"schema_version":"1.0"},"canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:13.368956Z","signature_b64":"QBWbAUytqplXS20TD5H/MGJSOSSyj7miLBVK+TgD4n9Ek4jRfOqUig2TU1WxvZG5emstW5c9/o76B36MukK9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","last_reissued_at":"2026-05-18T02:56:13.368526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:13.368526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3831","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-18T02:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nu5xBya7VtdYfH0cW2OGOm7sS/TQkklc/+vxgZcP1nMQuP/TyV90BeycqqWQFzSEHkacljR2vhg/w8J4liHgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:10:14.365214Z"},"content_sha256":"8e46b669416db0a8b34b987f7f670a007d3b82ccef227d43849e601b2418d636","schema_version":"1.0","event_id":"sha256:8e46b669416db0a8b34b987f7f670a007d3b82ccef227d43849e601b2418d636"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HI7PNKFQSGNFRSFW6MS3CKBVY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Spanning Trees on Infinite Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.MG","authors_text":"A.A.Tuzhilin, A.O.Ivanov","submitted_at":"2014-03-15T17:58:59Z","abstract_excerpt":"Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic description of the set of all infinite metric spaces which a minimal spanning tree exists for. A sufficient condition for a minimal spanning tree existence is obtained in terms of distances achievability between partitions elements of the metric space under consideration. Besides, a concept of locally minimal spanning tree is introduced, several properties "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3831","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-18T02:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQGWVqNBQr7VkVI2ugwGgmROkB9PmjnybagBpEDziHNZHgyG1eFZrIQg/j563Me6grOtTZWhtXfm5jMWGzIlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:10:14.365572Z"},"content_sha256":"e55f6d95a2434bb085070513936b930d86506aa4ff641b2a509bf2ca84e2006a","schema_version":"1.0","event_id":"sha256:e55f6d95a2434bb085070513936b930d86506aa4ff641b2a509bf2ca84e2006a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/bundle.json","state_url":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/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-06-23T20:10:14Z","links":{"resolver":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5","bundle":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/bundle.json","state":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HI7PNKFQSGNFRSFW6MS3CKBVY5","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":"ecd1dd8cca60d272dd4374be04485d94713f90dc2f7de037aec4c756ba8a45e5","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-15T17:58:59Z","title_canon_sha256":"9cc0f31da6770841cb08282c9950f2469110ef523d4c116c8d7de367ec6dfbb4"},"schema_version":"1.0","source":{"id":"1403.3831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3831","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3831v1","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3831","created_at":"2026-05-18T02:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"HI7PNKFQSGNF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HI7PNKFQSGNFRSFW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HI7PNKFQ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:e55f6d95a2434bb085070513936b930d86506aa4ff641b2a509bf2ca84e2006a","target":"graph","created_at":"2026-05-18T02:56:13Z","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":"Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic description of the set of all infinite metric spaces which a minimal spanning tree exists for. A sufficient condition for a minimal spanning tree existence is obtained in terms of distances achievability between partitions elements of the metric space under consideration. Besides, a concept of locally minimal spanning tree is introduced, several properties ","authors_text":"A.A.Tuzhilin, A.O.Ivanov","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-15T17:58:59Z","title":"Minimal Spanning Trees on Infinite Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3831","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:8e46b669416db0a8b34b987f7f670a007d3b82ccef227d43849e601b2418d636","target":"record","created_at":"2026-05-18T02:56:13Z","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":"ecd1dd8cca60d272dd4374be04485d94713f90dc2f7de037aec4c756ba8a45e5","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-15T17:58:59Z","title_canon_sha256":"9cc0f31da6770841cb08282c9950f2469110ef523d4c116c8d7de367ec6dfbb4"},"schema_version":"1.0","source":{"id":"1403.3831","kind":"arxiv","version":1}},"canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","first_computed_at":"2026-05-18T02:56:13.368526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:13.368526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBWbAUytqplXS20TD5H/MGJSOSSyj7miLBVK+TgD4n9Ek4jRfOqUig2TU1WxvZG5emstW5c9/o76B36MukK9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:13.368956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e46b669416db0a8b34b987f7f670a007d3b82ccef227d43849e601b2418d636","sha256:e55f6d95a2434bb085070513936b930d86506aa4ff641b2a509bf2ca84e2006a"],"state_sha256":"123328531552def5c42688a74c8d8217766029e7083636e549d09274f9ff9a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cilVmujbSyo14d75HiRwVczwWcax6E9w+u2AVRPiWy+5YQZDA846uc5rL97YJO3RYwhyM8V95oqg4jEMMxX2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:10:14.367537Z","bundle_sha256":"6c70fa711a72b8ae3d40b79a853d712edd0151a4b2830ab7a4d79de8981671d2"}}