{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KSFFNCSLUJ7JJ3CYK6OS76Y63T","short_pith_number":"pith:KSFFNCSL","schema_version":"1.0","canonical_sha256":"548a568a4ba27e94ec58579d2ffb1edcdfb0efce1da845682df7567a82ba8b3e","source":{"kind":"arxiv","id":"1405.1980","version":1},"attestation_state":"computed","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-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1980","created_at":"2026-05-18T02:52:15.002322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1980v1","created_at":"2026-05-18T02:52:15.002322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1980","created_at":"2026-05-18T02:52:15.002322+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSFFNCSLUJ7J","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSFFNCSLUJ7JJ3CY","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSFFNCSL","created_at":"2026-05-18T12:28:35.611951+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/KSFFNCSLUJ7JJ3CYK6OS76Y63T","json":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T.json","graph_json":"https://pith.science/api/pith-number/KSFFNCSLUJ7JJ3CYK6OS76Y63T/graph.json","events_json":"https://pith.science/api/pith-number/KSFFNCSLUJ7JJ3CYK6OS76Y63T/events.json","paper":"https://pith.science/paper/KSFFNCSL"},"agent_actions":{"view_html":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T","download_json":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T.json","view_paper":"https://pith.science/paper/KSFFNCSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1980&json=true","fetch_graph":"https://pith.science/api/pith-number/KSFFNCSLUJ7JJ3CYK6OS76Y63T/graph.json","fetch_events":"https://pith.science/api/pith-number/KSFFNCSLUJ7JJ3CYK6OS76Y63T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/action/storage_attestation","attest_author":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/action/author_attestation","sign_citation":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/action/citation_signature","submit_replication":"https://pith.science/pith/KSFFNCSLUJ7JJ3CYK6OS76Y63T/action/replication_record"}},"created_at":"2026-05-18T02:52:15.002322+00:00","updated_at":"2026-05-18T02:52:15.002322+00:00"}