{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EURWK6S2CIISZIKMOL2VORFBEG","short_pith_number":"pith:EURWK6S2","schema_version":"1.0","canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","source":{"kind":"arxiv","id":"1402.1379","version":1},"attestation_state":"computed","paper":{"title":"A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Jin-Kao Hao, Zhang-Hua Fu","submitted_at":"2014-02-06T15:31:49Z","abstract_excerpt":"Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning tree of minimum total cost. This problem can be used to model many real-life network design applications, in which both routing and interference costs should be considered. For this problem, we propose a three-phase search approach named TPS, which integrates 1) a descent-based neighborhood search phase using two different move operators to reach a local optimum from a given starting solution, 2) a local optima expl"},"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":"1402.1379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T15:31:49Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"f75d33bcd7b78c856a64ba30e4fedfa63d75b0d124b98533656f65220e021bfc","abstract_canon_sha256":"9611712b96a9f410c0abceb8997b3cad93bd46dbb41223c26fcce3955bcbb68d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:59.156682Z","signature_b64":"1JbzprmLquCrCmborPLikxiIqzadG7HhelTKnKZ4siDmr8C8TwYEaDABPPcKCtMusSO9Qo/pie5TuvKXpXuDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","last_reissued_at":"2026-05-18T02:59:59.155372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:59.155372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Jin-Kao Hao, Zhang-Hua Fu","submitted_at":"2014-02-06T15:31:49Z","abstract_excerpt":"Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning tree of minimum total cost. This problem can be used to model many real-life network design applications, in which both routing and interference costs should be considered. For this problem, we propose a three-phase search approach named TPS, which integrates 1) a descent-based neighborhood search phase using two different move operators to reach a local optimum from a given starting solution, 2) a local optima expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1379","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":"1402.1379","created_at":"2026-05-18T02:59:59.155496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1379v1","created_at":"2026-05-18T02:59:59.155496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1379","created_at":"2026-05-18T02:59:59.155496+00:00"},{"alias_kind":"pith_short_12","alias_value":"EURWK6S2CIIS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EURWK6S2CIISZIKM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EURWK6S2","created_at":"2026-05-18T12:28:28.263976+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/EURWK6S2CIISZIKMOL2VORFBEG","json":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG.json","graph_json":"https://pith.science/api/pith-number/EURWK6S2CIISZIKMOL2VORFBEG/graph.json","events_json":"https://pith.science/api/pith-number/EURWK6S2CIISZIKMOL2VORFBEG/events.json","paper":"https://pith.science/paper/EURWK6S2"},"agent_actions":{"view_html":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG","download_json":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG.json","view_paper":"https://pith.science/paper/EURWK6S2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1379&json=true","fetch_graph":"https://pith.science/api/pith-number/EURWK6S2CIISZIKMOL2VORFBEG/graph.json","fetch_events":"https://pith.science/api/pith-number/EURWK6S2CIISZIKMOL2VORFBEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/action/storage_attestation","attest_author":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/action/author_attestation","sign_citation":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/action/citation_signature","submit_replication":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/action/replication_record"}},"created_at":"2026-05-18T02:59:59.155496+00:00","updated_at":"2026-05-18T02:59:59.155496+00:00"}