{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EURWK6S2CIISZIKMOL2VORFBEG","short_pith_number":"pith:EURWK6S2","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"},"canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","source":{"kind":"arxiv","id":"1402.1379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1379","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1379v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1379","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"EURWK6S2CIIS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EURWK6S2CIISZIKM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EURWK6S2","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EURWK6S2CIISZIKMOL2VORFBEG","target":"record","payload":{"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"},"canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","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"},"source_kind":"arxiv","source_id":"1402.1379","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unbeZtNNPIuH0jz4TpvLh+Wqk1v9GJCXAlaiik0is8NWgqhfxRhJcaCLQHKkCfK9oWBvJS5o/Edgwu4WCDhLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:16.397123Z"},"content_sha256":"66ff27f091ddd817af4fe0ed6d9b838276df02c6418ccb8a4b557ae30b73cbe6","schema_version":"1.0","event_id":"sha256:66ff27f091ddd817af4fe0ed6d9b838276df02c6418ccb8a4b557ae30b73cbe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EURWK6S2CIISZIKMOL2VORFBEG","target":"graph","payload":{"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"},"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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYL1qxZm/v1t/PZspCX40IYxcp1YwxOKduIUZufoHuf1yh3wsA+cc75QUg5iwb9Vc4cGIepr1qafp3SfYlApBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:16.397476Z"},"content_sha256":"3021b9180d08f5b22d872c1c9fbb7926ce0d38d75ad9703800d2fb4aabbc6525","schema_version":"1.0","event_id":"sha256:3021b9180d08f5b22d872c1c9fbb7926ce0d38d75ad9703800d2fb4aabbc6525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/bundle.json","state_url":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EURWK6S2CIISZIKMOL2VORFBEG/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-01T14:39:16Z","links":{"resolver":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG","bundle":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/bundle.json","state":"https://pith.science/pith/EURWK6S2CIISZIKMOL2VORFBEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EURWK6S2CIISZIKMOL2VORFBEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EURWK6S2CIISZIKMOL2VORFBEG","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":"9611712b96a9f410c0abceb8997b3cad93bd46dbb41223c26fcce3955bcbb68d","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T15:31:49Z","title_canon_sha256":"f75d33bcd7b78c856a64ba30e4fedfa63d75b0d124b98533656f65220e021bfc"},"schema_version":"1.0","source":{"id":"1402.1379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1379","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1379v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1379","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"EURWK6S2CIIS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EURWK6S2CIISZIKM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EURWK6S2","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:3021b9180d08f5b22d872c1c9fbb7926ce0d38d75ad9703800d2fb4aabbc6525","target":"graph","created_at":"2026-05-18T02:59:59Z","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":"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","authors_text":"Jin-Kao Hao, Zhang-Hua Fu","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T15:31:49Z","title":"A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1379","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:66ff27f091ddd817af4fe0ed6d9b838276df02c6418ccb8a4b557ae30b73cbe6","target":"record","created_at":"2026-05-18T02:59:59Z","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":"9611712b96a9f410c0abceb8997b3cad93bd46dbb41223c26fcce3955bcbb68d","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T15:31:49Z","title_canon_sha256":"f75d33bcd7b78c856a64ba30e4fedfa63d75b0d124b98533656f65220e021bfc"},"schema_version":"1.0","source":{"id":"1402.1379","kind":"arxiv","version":1}},"canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2523657a5a12112ca14c72f55744a121a18c9c671715d644f31ab9caff74cd5a","first_computed_at":"2026-05-18T02:59:59.155372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:59.155372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1JbzprmLquCrCmborPLikxiIqzadG7HhelTKnKZ4siDmr8C8TwYEaDABPPcKCtMusSO9Qo/pie5TuvKXpXuDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:59.156682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66ff27f091ddd817af4fe0ed6d9b838276df02c6418ccb8a4b557ae30b73cbe6","sha256:3021b9180d08f5b22d872c1c9fbb7926ce0d38d75ad9703800d2fb4aabbc6525"],"state_sha256":"5d3d49a94940255261d28fc71db15d215d6897f166ccde87b90866d7f0a053fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OpbDLUYlDqmI+2b8g8T+w02fQjjyTsS5U6fyjhagtz6Bzfskm/2KQvuDf2dOXUyhSeuKOsGWlNBSMlbbQ5mBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:39:16.399291Z","bundle_sha256":"965ad3926721f0bb418a6ce705ff43c847f084bf20c2f3bb5f77833c9c4843b6"}}