{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LXOPJEE5LWN7ZAP3WYZ4Q5ERB6","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":"52796b99ccc2847d945cf5a6a00f0dc0e3411f948d40d52f12ea27be4cb6fc76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-16T05:34:09Z","title_canon_sha256":"a53c74e9a8f7777766f3dcd9df6219b60e9d6144c9d5264b0b12d5bf5fb2a2aa"},"schema_version":"1.0","source":{"id":"1601.04125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04125","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04125v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04125","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"LXOPJEE5LWN7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXOPJEE5LWN7ZAP3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXOPJEE5","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:a71701b804a4cccad6e8c1e475fee27c26ccd806b170a70517dd6ac91009975b","target":"graph","created_at":"2026-05-18T01:22:45Z","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":"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.","authors_text":"Qiang Sun, Zhujun Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-16T05:34:09Z","title":"Complexity Analysis of 2-Heterogeneous Minimum Spanning Forest Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04125","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:12006f05c311b786a6f1900a6f54d40a0eed29184ef44f59c63ea67b1d502219","target":"record","created_at":"2026-05-18T01:22:45Z","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":"52796b99ccc2847d945cf5a6a00f0dc0e3411f948d40d52f12ea27be4cb6fc76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-16T05:34:09Z","title_canon_sha256":"a53c74e9a8f7777766f3dcd9df6219b60e9d6144c9d5264b0b12d5bf5fb2a2aa"},"schema_version":"1.0","source":{"id":"1601.04125","kind":"arxiv","version":1}},"canonical_sha256":"5ddcf4909d5d9bfc81fbb633c874910fafd64b1eb18c8f175bb135be468be245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ddcf4909d5d9bfc81fbb633c874910fafd64b1eb18c8f175bb135be468be245","first_computed_at":"2026-05-18T01:22:45.838054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:45.838054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCO9b5KOT7bEJlan8n9eoVzJa7LMiG6Zq2gLf7CRODax5RJ9kexIDQHQFt+AMps5Fow3xyr8Yk5d4RgRcHUqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:45.838618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12006f05c311b786a6f1900a6f54d40a0eed29184ef44f59c63ea67b1d502219","sha256:a71701b804a4cccad6e8c1e475fee27c26ccd806b170a70517dd6ac91009975b"],"state_sha256":"67f3854d2505db8841855cba2035c12455051bbdfd54213f3f7e29fcbc83c1af"}