{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HI7PNKFQSGNFRSFW6MS3CKBVY5","short_pith_number":"pith:HI7PNKFQ","schema_version":"1.0","canonical_sha256":"3a3ef6a8b0919a58c8b6f325b12835c74550022e94298018dcdc708f2c5e2d5d","source":{"kind":"arxiv","id":"1403.3831","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.3831","created_at":"2026-05-18T02:56:13.368590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3831v1","created_at":"2026-05-18T02:56:13.368590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3831","created_at":"2026-05-18T02:56:13.368590+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI7PNKFQSGNF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI7PNKFQSGNFRSFW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI7PNKFQ","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5","json":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5.json","graph_json":"https://pith.science/api/pith-number/HI7PNKFQSGNFRSFW6MS3CKBVY5/graph.json","events_json":"https://pith.science/api/pith-number/HI7PNKFQSGNFRSFW6MS3CKBVY5/events.json","paper":"https://pith.science/paper/HI7PNKFQ"},"agent_actions":{"view_html":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5","download_json":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5.json","view_paper":"https://pith.science/paper/HI7PNKFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3831&json=true","fetch_graph":"https://pith.science/api/pith-number/HI7PNKFQSGNFRSFW6MS3CKBVY5/graph.json","fetch_events":"https://pith.science/api/pith-number/HI7PNKFQSGNFRSFW6MS3CKBVY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/action/storage_attestation","attest_author":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/action/author_attestation","sign_citation":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/action/citation_signature","submit_replication":"https://pith.science/pith/HI7PNKFQSGNFRSFW6MS3CKBVY5/action/replication_record"}},"created_at":"2026-05-18T02:56:13.368590+00:00","updated_at":"2026-05-18T02:56:13.368590+00:00"}