{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KSFFNCSLUJ7JJ3CYK6OS76Y63T","short_pith_number":"pith:KSFFNCSL","canonical_record":{"source":{"id":"1405.1980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-16T11:02:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b711c1a827c7c1e6b5218f17cac1b1187e44c93599036cc68155afa64ba8a947","abstract_canon_sha256":"caeab7fc9f20269af2b5ff4f96f88856d0f5fe902bd2c1f19e295f9b1b198575"},"schema_version":"1.0"},"canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","source":{"kind":"arxiv","id":"1405.1980","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KSFFNCSLUJ7JJ3CYK6OS76Y63T","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-16T11:02:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b711c1a827c7c1e6b5218f17cac1b1187e44c93599036cc68155afa64ba8a947","abstract_canon_sha256":"caeab7fc9f20269af2b5ff4f96f88856d0f5fe902bd2c1f19e295f9b1b198575"},"schema_version":"1.0"},"canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:15.002765Z","signature_b64":"KHHTXwpjtYcw7cVzWQzib+iu9Om0qWn7rHf8ho5ADuO0s6n8LElnURUmC6WpYBfMJ9HScX0scWi+dneHGFTVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","last_reissued_at":"2026-05-18T02:52:15.002225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:15.002225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1980","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyNc3XCE2pvBzQ9KXHPJiZvWavQp74ddI8VS1MsCbS7wbiONPpMRejTFRfMDApB+VsWLziK673GFX49y3QwUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:21:34.059224Z"},"content_sha256":"a083d7ad1cf63c27a394378a2d28d5b8b069d28de92ded7051a4c71f3846b393","schema_version":"1.0","event_id":"sha256:a083d7ad1cf63c27a394378a2d28d5b8b069d28de92ded7051a4c71f3846b393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KSFFNCSLUJ7JJ3CYK6OS76Y63T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jose Andres Moreno-Perez, Kenneth Darby-Dowman, Nenad Mladenovic, Sergio Consoli","submitted_at":"2014-04-16T11:02:02Z","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-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1980","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18z40Uigdxn041MooVWOWPR9a2iU4SxRz0Y/iA0HHZXF5cu6L4cVBp/HNkD3AiQWryt5lt6tAQ/yHXR1LJVPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:21:34.059583Z"},"content_sha256":"2ca9bc499497926fcbcf5719f445fe9b70590e36d1d3fa5ee628d7c5bad8111a","schema_version":"1.0","event_id":"sha256:2ca9bc499497926fcbcf5719f445fe9b70590e36d1d3fa5ee628d7c5bad8111a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/bundle.json","state_url":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/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-29T05:21:34Z","links":{"resolver":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T","bundle":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/bundle.json","state":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVspiJ5uII+zHhOtGnqsFmC5Mn6EUdlP4lMYrkDqbXVWSESs2tgU/fkiNz9Rrcpf3ACYj1L291ax8yhCsfzUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:21:34.061570Z","bundle_sha256":"4f4f4254c36e40c7fb3b2bcb626571a3035dd233428df2a095d498b2baf0dff9"}}