{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KSFFNCSLUJ7JJ3CYK6OS76Y63T","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":"caeab7fc9f20269af2b5ff4f96f88856d0f5fe902bd2c1f19e295f9b1b198575","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-16T11:02:02Z","title_canon_sha256":"b711c1a827c7c1e6b5218f17cac1b1187e44c93599036cc68155afa64ba8a947"},"schema_version":"1.0","source":{"id":"1405.1980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1980","created_at":"2026-05-18T02:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1980v1","created_at":"2026-05-18T02:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1980","created_at":"2026-05-18T02:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"KSFFNCSLUJ7J","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KSFFNCSLUJ7JJ3CY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KSFFNCSL","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:2ca9bc499497926fcbcf5719f445fe9b70590e36d1d3fa5ee628d7c5bad8111a","target":"graph","created_at":"2026-05-18T02:52:15Z","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":"This paper studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible. Given an undirected labeled connected graph (i.e., with a label or color for each edge), the minimum labeling spanning tree problem seeks a spanning tree whose edges have the smallest possible number of distinct labels. The model can represent many real-world problems in telecommunication networks, electric networks, and multimodal transportation networks, among others, and the problem has been shown to be NP-","authors_text":"Jose Andres Moreno-Perez, Kenneth Darby-Dowman, Nenad Mladenovic, Sergio Consoli","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-16T11:02:02Z","title":"Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1980","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:a083d7ad1cf63c27a394378a2d28d5b8b069d28de92ded7051a4c71f3846b393","target":"record","created_at":"2026-05-18T02:52:15Z","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":"caeab7fc9f20269af2b5ff4f96f88856d0f5fe902bd2c1f19e295f9b1b198575","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-16T11:02:02Z","title_canon_sha256":"b711c1a827c7c1e6b5218f17cac1b1187e44c93599036cc68155afa64ba8a947"},"schema_version":"1.0","source":{"id":"1405.1980","kind":"arxiv","version":1}},"canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","first_computed_at":"2026-05-18T02:52:15.002225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:15.002225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHHTXwpjtYcw7cVzWQzib+iu9Om0qWn7rHf8ho5ADuO0s6n8LElnURUmC6WpYBfMJ9HScX0scWi+dneHGFTVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:15.002765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a083d7ad1cf63c27a394378a2d28d5b8b069d28de92ded7051a4c71f3846b393","sha256:2ca9bc499497926fcbcf5719f445fe9b70590e36d1d3fa5ee628d7c5bad8111a"],"state_sha256":"74f80231bac865881110b6a0e51aef4064fd3a0bebf3bade3cc87d831d4a23a3"}