{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BVCKUPDFGY3AFEII4SVEX3BSEA","short_pith_number":"pith:BVCKUPDF","canonical_record":{"source":{"id":"1712.01178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-04T16:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"34a1033224484fdecf3fb889642332c2cbf1bbcee14475cab2f757f2f9185356","abstract_canon_sha256":"dc556b3a50a243c4e5f020c62e35887bc26f6b816a902c6419569debcd031350"},"schema_version":"1.0"},"canonical_sha256":"0d44aa3c653636029108e4aa4bec322022d96da547f0a52d357122658bf8b218","source":{"kind":"arxiv","id":"1712.01178","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01178","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01178v3","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01178","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"pith_short_12","alias_value":"BVCKUPDFGY3A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BVCKUPDFGY3AFEII","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BVCKUPDF","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BVCKUPDFGY3AFEII4SVEX3BSEA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-04T16:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"34a1033224484fdecf3fb889642332c2cbf1bbcee14475cab2f757f2f9185356","abstract_canon_sha256":"dc556b3a50a243c4e5f020c62e35887bc26f6b816a902c6419569debcd031350"},"schema_version":"1.0"},"canonical_sha256":"0d44aa3c653636029108e4aa4bec322022d96da547f0a52d357122658bf8b218","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:43.263405Z","signature_b64":"ehN8vU4RkAoA3h4RDqDKXecpQnvftn6W7jIbM615tMYUnCp/7RNQoozjls5Co56JE5otYiA3vztrtif+gYqkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d44aa3c653636029108e4aa4bec322022d96da547f0a52d357122658bf8b218","last_reissued_at":"2026-05-18T00:26:43.262706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:43.262706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01178","source_version":3,"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-18T00:26:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+/+SwsseKD9zyMMLEyz3hR3H+mwiqiB8muI/DfHv2T0iUgE0JoFQVM9N6RG0S+iC+YQjxnbCblJq9FuNbFtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:10.707841Z"},"content_sha256":"747aa4bf6cad685c3ab0cae36fa4f0017f0b5f7296a2c7b5954646bf91c4680b","schema_version":"1.0","event_id":"sha256:747aa4bf6cad685c3ab0cae36fa4f0017f0b5f7296a2c7b5954646bf91c4680b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BVCKUPDFGY3AFEII4SVEX3BSEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Principle of Conservation of Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alfredo Metere, Gerald Friedland","submitted_at":"2017-12-04T16:25:42Z","abstract_excerpt":"In this manuscript, we derive the principle of conservation of computational complexity. We measure computational complexity as the number of binary computations (decisions) required to solve a problem. Every problem then defines a unique solution space measurable in bits. For an exact result, decisions in the solution space can neither be predicted nor discarded, only transferred between input and algorithm. We demonstrate and explain this principle using the example of the propositional logic satisfiability problem ($SAT$). It inevitably follows that $SAT \\not\\in P \\Rightarrow P\\neq NP$. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01178","kind":"arxiv","version":3},"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-18T00:26:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os2dpDcprae81ZKSHPBZvYHzj0L5MCDh3Qpb/Uz9z9MjbgpbHE4NW29ZlBFqHiyRfXHxV/CjSpcHJKmeX20KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:10.708204Z"},"content_sha256":"2fcba3b6762a9bd266aa8680648ff6792fedf033a2e3aa0f252dde890b94f9f8","schema_version":"1.0","event_id":"sha256:2fcba3b6762a9bd266aa8680648ff6792fedf033a2e3aa0f252dde890b94f9f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/bundle.json","state_url":"https://pith.science/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/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-05-30T06:22:10Z","links":{"resolver":"https://pith.science/pith/BVCKUPDFGY3AFEII4SVEX3BSEA","bundle":"https://pith.science/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/bundle.json","state":"https://pith.science/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVCKUPDFGY3AFEII4SVEX3BSEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BVCKUPDFGY3AFEII4SVEX3BSEA","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":"dc556b3a50a243c4e5f020c62e35887bc26f6b816a902c6419569debcd031350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-04T16:25:42Z","title_canon_sha256":"34a1033224484fdecf3fb889642332c2cbf1bbcee14475cab2f757f2f9185356"},"schema_version":"1.0","source":{"id":"1712.01178","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01178","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01178v3","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01178","created_at":"2026-05-18T00:26:43Z"},{"alias_kind":"pith_short_12","alias_value":"BVCKUPDFGY3A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BVCKUPDFGY3AFEII","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BVCKUPDF","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:2fcba3b6762a9bd266aa8680648ff6792fedf033a2e3aa0f252dde890b94f9f8","target":"graph","created_at":"2026-05-18T00:26:43Z","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 manuscript, we derive the principle of conservation of computational complexity. We measure computational complexity as the number of binary computations (decisions) required to solve a problem. Every problem then defines a unique solution space measurable in bits. For an exact result, decisions in the solution space can neither be predicted nor discarded, only transferred between input and algorithm. We demonstrate and explain this principle using the example of the propositional logic satisfiability problem ($SAT$). It inevitably follows that $SAT \\not\\in P \\Rightarrow P\\neq NP$. We ","authors_text":"Alfredo Metere, Gerald Friedland","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-04T16:25:42Z","title":"Principle of Conservation of Computational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01178","kind":"arxiv","version":3},"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:747aa4bf6cad685c3ab0cae36fa4f0017f0b5f7296a2c7b5954646bf91c4680b","target":"record","created_at":"2026-05-18T00:26:43Z","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":"dc556b3a50a243c4e5f020c62e35887bc26f6b816a902c6419569debcd031350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-04T16:25:42Z","title_canon_sha256":"34a1033224484fdecf3fb889642332c2cbf1bbcee14475cab2f757f2f9185356"},"schema_version":"1.0","source":{"id":"1712.01178","kind":"arxiv","version":3}},"canonical_sha256":"0d44aa3c653636029108e4aa4bec322022d96da547f0a52d357122658bf8b218","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d44aa3c653636029108e4aa4bec322022d96da547f0a52d357122658bf8b218","first_computed_at":"2026-05-18T00:26:43.262706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:43.262706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehN8vU4RkAoA3h4RDqDKXecpQnvftn6W7jIbM615tMYUnCp/7RNQoozjls5Co56JE5otYiA3vztrtif+gYqkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:43.263405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01178","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:747aa4bf6cad685c3ab0cae36fa4f0017f0b5f7296a2c7b5954646bf91c4680b","sha256:2fcba3b6762a9bd266aa8680648ff6792fedf033a2e3aa0f252dde890b94f9f8"],"state_sha256":"714993442185bb6516a13fb0546822d1fb227b61c12f389efd2d607012328300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUXLaE6co2QqP0NaAutLADA0QBOWBL5M7Jcq3xkjIcvPIvGuxOlJ/88XvL1FIVD2hDACoz/o0pp98UxdZ7J4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:22:10.711756Z","bundle_sha256":"49c3c40a7524decff1802ddc7140d64276e5e0aab0bfb9c7ac4db594287a2a9d"}}