{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BMAWGNFENBY5UAJGFBAVXY7MAA","short_pith_number":"pith:BMAWGNFE","canonical_record":{"source":{"id":"1412.1229","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-03T08:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"e53832e0b7fd838e3fd6e0ac09841f9b084d86c483316026a1c1f14e0a1c8340","abstract_canon_sha256":"cd1267cb729e0ca01a5255559d32369ab0c955d2167b68f39b5db75c7d8ceb04"},"schema_version":"1.0"},"canonical_sha256":"0b016334a46871da012628415be3ec00378602ddb9471a74802e21cf775af092","source":{"kind":"arxiv","id":"1412.1229","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1229","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1229v6","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1229","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMAWGNFENBY5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BMAWGNFENBY5UAJG","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BMAWGNFE","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BMAWGNFENBY5UAJGFBAVXY7MAA","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1229","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-03T08:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"e53832e0b7fd838e3fd6e0ac09841f9b084d86c483316026a1c1f14e0a1c8340","abstract_canon_sha256":"cd1267cb729e0ca01a5255559d32369ab0c955d2167b68f39b5db75c7d8ceb04"},"schema_version":"1.0"},"canonical_sha256":"0b016334a46871da012628415be3ec00378602ddb9471a74802e21cf775af092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.554436Z","signature_b64":"DSSmBp0T8N1F34AMSM+Xdy7fwgXHPH/pLhCtUnBz9FFNr85oMC/Q036GP0fPR2om4sJv8FWBnIcobgtjMJ6dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b016334a46871da012628415be3ec00378602ddb9471a74802e21cf775af092","last_reissued_at":"2026-05-18T01:32:37.553929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.553929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1229","source_version":6,"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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fOzj+6EB3VsvQ+qiPiMxh/JJo4Oe1Bkz+L52tQlPEenALxilKXpfTsLPaLl1DE+Sy+H9aaKeJEprl6DQsFaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:28:16.596757Z"},"content_sha256":"7e67aa59e4da98a468f8879a81bd7321e080ff184cd33caef9fb922610c8e3a4","schema_version":"1.0","event_id":"sha256:7e67aa59e4da98a468f8879a81bd7321e080ff184cd33caef9fb922610c8e3a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BMAWGNFENBY5UAJGFBAVXY7MAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAT is a problem with exponential complexity measured by negentropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Feng Pan","submitted_at":"2014-12-03T08:36:38Z","abstract_excerpt":"In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and informational physics. In the same time the equivalence of computation and information was clearly stated. Then the complexities of three specific problems: logical compare, sorting and SAT, were analyzed and measured. The result showed SAT was a problem with exponential complexity which naturally leads to the conclusion that no efficient algorithm exists to solve it. That's to say: NP!=P."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1229","kind":"arxiv","version":6},"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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Rw8ZRrbL4w4+7K1vnnlXReef+djxI+ASsXDqWnNmR6qufMVLggnppHPFpiwnMCO5NMaj0wb0vM+CwZO5OpyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:28:16.597384Z"},"content_sha256":"b470dc156da0fee76a613c6259bd9b26be66e98452176a6728c88d43838a07a7","schema_version":"1.0","event_id":"sha256:b470dc156da0fee76a613c6259bd9b26be66e98452176a6728c88d43838a07a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/bundle.json","state_url":"https://pith.science/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/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-02T16:28:16Z","links":{"resolver":"https://pith.science/pith/BMAWGNFENBY5UAJGFBAVXY7MAA","bundle":"https://pith.science/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/bundle.json","state":"https://pith.science/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMAWGNFENBY5UAJGFBAVXY7MAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BMAWGNFENBY5UAJGFBAVXY7MAA","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":"cd1267cb729e0ca01a5255559d32369ab0c955d2167b68f39b5db75c7d8ceb04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-03T08:36:38Z","title_canon_sha256":"e53832e0b7fd838e3fd6e0ac09841f9b084d86c483316026a1c1f14e0a1c8340"},"schema_version":"1.0","source":{"id":"1412.1229","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1229","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1229v6","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1229","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMAWGNFENBY5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BMAWGNFENBY5UAJG","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BMAWGNFE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:b470dc156da0fee76a613c6259bd9b26be66e98452176a6728c88d43838a07a7","target":"graph","created_at":"2026-05-18T01:32:37Z","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":"In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and informational physics. In the same time the equivalence of computation and information was clearly stated. Then the complexities of three specific problems: logical compare, sorting and SAT, were analyzed and measured. The result showed SAT was a problem with exponential complexity which naturally leads to the conclusion that no efficient algorithm exists to solve it. That's to say: NP!=P.","authors_text":"Feng Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-03T08:36:38Z","title":"SAT is a problem with exponential complexity measured by negentropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1229","kind":"arxiv","version":6},"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:7e67aa59e4da98a468f8879a81bd7321e080ff184cd33caef9fb922610c8e3a4","target":"record","created_at":"2026-05-18T01:32:37Z","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":"cd1267cb729e0ca01a5255559d32369ab0c955d2167b68f39b5db75c7d8ceb04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-03T08:36:38Z","title_canon_sha256":"e53832e0b7fd838e3fd6e0ac09841f9b084d86c483316026a1c1f14e0a1c8340"},"schema_version":"1.0","source":{"id":"1412.1229","kind":"arxiv","version":6}},"canonical_sha256":"0b016334a46871da012628415be3ec00378602ddb9471a74802e21cf775af092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b016334a46871da012628415be3ec00378602ddb9471a74802e21cf775af092","first_computed_at":"2026-05-18T01:32:37.553929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:37.553929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DSSmBp0T8N1F34AMSM+Xdy7fwgXHPH/pLhCtUnBz9FFNr85oMC/Q036GP0fPR2om4sJv8FWBnIcobgtjMJ6dCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:37.554436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1229","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e67aa59e4da98a468f8879a81bd7321e080ff184cd33caef9fb922610c8e3a4","sha256:b470dc156da0fee76a613c6259bd9b26be66e98452176a6728c88d43838a07a7"],"state_sha256":"da6fa8c5827ea9f42a869bae6c9f3d4df18ddd856392825f37ea30873ebf2dd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TH+fB+C3xkoPpz6V+rqMqHdrssC1zVlfude2lwc2YI8K5pF6L8KO7WB8XBA/vw2bWeKSp+p95y1zGPxgcI7TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:28:16.600422Z","bundle_sha256":"cf7b82cc9992659e445ac979ee31c910e461f43c25b28cdb1654ec0b94983c91"}}