{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LXOPJEE5LWN7ZAP3WYZ4Q5ERB6","short_pith_number":"pith:LXOPJEE5","schema_version":"1.0","canonical_sha256":"5ddcf4909d5d9bfc81fbb633c874910fafd64b1eb18c8f175bb135be468be245","source":{"kind":"arxiv","id":"1601.04125","version":1},"attestation_state":"computed","paper":{"title":"Complexity Analysis of 2-Heterogeneous Minimum Spanning Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Qiang Sun, Zhujun Zhang","submitted_at":"2016-01-16T05:34:09Z","abstract_excerpt":"For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem to prove this problem is NP-hard and spread result to general problem, which determines complexity of this problem. It provides a theoretical basis for the future designing of approximation algorithms for the problem."},"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":"1601.04125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-16T05:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"a53c74e9a8f7777766f3dcd9df6219b60e9d6144c9d5264b0b12d5bf5fb2a2aa","abstract_canon_sha256":"52796b99ccc2847d945cf5a6a00f0dc0e3411f948d40d52f12ea27be4cb6fc76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.838618Z","signature_b64":"oCO9b5KOT7bEJlan8n9eoVzJa7LMiG6Zq2gLf7CRODax5RJ9kexIDQHQFt+AMps5Fow3xyr8Yk5d4RgRcHUqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ddcf4909d5d9bfc81fbb633c874910fafd64b1eb18c8f175bb135be468be245","last_reissued_at":"2026-05-18T01:22:45.838054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.838054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Analysis of 2-Heterogeneous Minimum Spanning Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Qiang Sun, Zhujun Zhang","submitted_at":"2016-01-16T05:34:09Z","abstract_excerpt":"For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem to prove this problem is NP-hard and spread result to general problem, which determines complexity of this problem. It provides a theoretical basis for the future designing of approximation algorithms for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04125","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":"1601.04125","created_at":"2026-05-18T01:22:45.838135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04125v1","created_at":"2026-05-18T01:22:45.838135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04125","created_at":"2026-05-18T01:22:45.838135+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXOPJEE5LWN7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXOPJEE5LWN7ZAP3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXOPJEE5","created_at":"2026-05-18T12:30:29.479603+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/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6","json":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6.json","graph_json":"https://pith.science/api/pith-number/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/graph.json","events_json":"https://pith.science/api/pith-number/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/events.json","paper":"https://pith.science/paper/LXOPJEE5"},"agent_actions":{"view_html":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6","download_json":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6.json","view_paper":"https://pith.science/paper/LXOPJEE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04125&json=true","fetch_graph":"https://pith.science/api/pith-number/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/graph.json","fetch_events":"https://pith.science/api/pith-number/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/action/storage_attestation","attest_author":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/action/author_attestation","sign_citation":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/action/citation_signature","submit_replication":"https://pith.science/pith/LXOPJEE5LWN7ZAP3WYZ4Q5ERB6/action/replication_record"}},"created_at":"2026-05-18T01:22:45.838135+00:00","updated_at":"2026-05-18T01:22:45.838135+00:00"}