{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CU6RNRWRBW4F236HNYBQBM2MV6","short_pith_number":"pith:CU6RNRWR","canonical_record":{"source":{"id":"1009.3687","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-20T03:55:13Z","cross_cats_sorted":[],"title_canon_sha256":"53c62575994c902c01ca253502a10834ba551c62ec00af7cc471373f387c1b35","abstract_canon_sha256":"63df2190b24dc9967cbb9f0a5276d4673ab0dd71e9645e1d0be377a6f1ca3ae0"},"schema_version":"1.0"},"canonical_sha256":"153d16c6d10db85d6fc76e0300b34caf856fc6966608bff895b90e9ada8d194e","source":{"kind":"arxiv","id":"1009.3687","version":12},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3687","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3687v12","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3687","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"CU6RNRWRBW4F","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CU6RNRWRBW4F236H","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CU6RNRWR","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CU6RNRWRBW4F236HNYBQBM2MV6","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3687","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-20T03:55:13Z","cross_cats_sorted":[],"title_canon_sha256":"53c62575994c902c01ca253502a10834ba551c62ec00af7cc471373f387c1b35","abstract_canon_sha256":"63df2190b24dc9967cbb9f0a5276d4673ab0dd71e9645e1d0be377a6f1ca3ae0"},"schema_version":"1.0"},"canonical_sha256":"153d16c6d10db85d6fc76e0300b34caf856fc6966608bff895b90e9ada8d194e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:38.782806Z","signature_b64":"N6F3UNg9Z52Gkh8b3WIi0gkMxSnQ9RlUE4fpozTLXdSY/O0jPeDMTL0CRuzPfWj5OE6QFNaxI9lvXnz6pS8OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153d16c6d10db85d6fc76e0300b34caf856fc6966608bff895b90e9ada8d194e","last_reissued_at":"2026-05-18T04:33:38.782138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:38.782138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3687","source_version":12,"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-18T04:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0ns6k6v1GHev0Rpv5gtdg+Mqkdu5dgx3JnYqqSPYZBIkm1yFdbX0pGGEQA+lPDkQ6KEWLec/0Qjds0Lb5djCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:33:26.109164Z"},"content_sha256":"f4b797464683c0d2790368c382f6259b3fb68c2c384dc5cf104c05dca293b185","schema_version":"1.0","event_id":"sha256:f4b797464683c0d2790368c382f6259b3fb68c2c384dc5cf104c05dca293b185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CU6RNRWRBW4F236HNYBQBM2MV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"3-SAT Polynomial Solution of Knowledge Recognition Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cuifeng Zhou, David Zhu, Xiaowen Han","submitted_at":"2010-09-20T03:55:13Z","abstract_excerpt":"This paper introduces a knowledge recognition algorithm (KRA) for solving the 3SAT problem in polynomial time. KRA learns member-class relations and retrieves information through deductive and reductive iterative reasoning. It applies the principle of Chinese COVA* (equivalent to a set of eight 3-variable conjunctive clauses) and eliminates the \"OR\" operation to solve 3-SAT problem. That is, KRA does not search the assignment directly. It recognizes the complements as rejections at each level of the set through iterative set relation recognition. KRA recognizes which conjunctive 3-variable-cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3687","kind":"arxiv","version":12},"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-18T04:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZOFOjeONc7HtkzrZDaSwPOaIZYmM+g2NQFl3b3GbqIRdFzCN1wxr+4GkxxXg/bR0BGefukNXViDH54fh30DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:33:26.109534Z"},"content_sha256":"4518265dd7b5910e72263b47448549e9e6621ef0bfa01a7c0aa0b07022ccafc8","schema_version":"1.0","event_id":"sha256:4518265dd7b5910e72263b47448549e9e6621ef0bfa01a7c0aa0b07022ccafc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CU6RNRWRBW4F236HNYBQBM2MV6/bundle.json","state_url":"https://pith.science/pith/CU6RNRWRBW4F236HNYBQBM2MV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CU6RNRWRBW4F236HNYBQBM2MV6/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-20T05:33:26Z","links":{"resolver":"https://pith.science/pith/CU6RNRWRBW4F236HNYBQBM2MV6","bundle":"https://pith.science/pith/CU6RNRWRBW4F236HNYBQBM2MV6/bundle.json","state":"https://pith.science/pith/CU6RNRWRBW4F236HNYBQBM2MV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CU6RNRWRBW4F236HNYBQBM2MV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CU6RNRWRBW4F236HNYBQBM2MV6","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":"63df2190b24dc9967cbb9f0a5276d4673ab0dd71e9645e1d0be377a6f1ca3ae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-20T03:55:13Z","title_canon_sha256":"53c62575994c902c01ca253502a10834ba551c62ec00af7cc471373f387c1b35"},"schema_version":"1.0","source":{"id":"1009.3687","kind":"arxiv","version":12}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3687","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3687v12","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3687","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"CU6RNRWRBW4F","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CU6RNRWRBW4F236H","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CU6RNRWR","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:4518265dd7b5910e72263b47448549e9e6621ef0bfa01a7c0aa0b07022ccafc8","target":"graph","created_at":"2026-05-18T04:33:38Z","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":"This paper introduces a knowledge recognition algorithm (KRA) for solving the 3SAT problem in polynomial time. KRA learns member-class relations and retrieves information through deductive and reductive iterative reasoning. It applies the principle of Chinese COVA* (equivalent to a set of eight 3-variable conjunctive clauses) and eliminates the \"OR\" operation to solve 3-SAT problem. That is, KRA does not search the assignment directly. It recognizes the complements as rejections at each level of the set through iterative set relation recognition. KRA recognizes which conjunctive 3-variable-cla","authors_text":"Cuifeng Zhou, David Zhu, Xiaowen Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-20T03:55:13Z","title":"3-SAT Polynomial Solution of Knowledge Recognition Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3687","kind":"arxiv","version":12},"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:f4b797464683c0d2790368c382f6259b3fb68c2c384dc5cf104c05dca293b185","target":"record","created_at":"2026-05-18T04:33:38Z","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":"63df2190b24dc9967cbb9f0a5276d4673ab0dd71e9645e1d0be377a6f1ca3ae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-20T03:55:13Z","title_canon_sha256":"53c62575994c902c01ca253502a10834ba551c62ec00af7cc471373f387c1b35"},"schema_version":"1.0","source":{"id":"1009.3687","kind":"arxiv","version":12}},"canonical_sha256":"153d16c6d10db85d6fc76e0300b34caf856fc6966608bff895b90e9ada8d194e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"153d16c6d10db85d6fc76e0300b34caf856fc6966608bff895b90e9ada8d194e","first_computed_at":"2026-05-18T04:33:38.782138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:38.782138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N6F3UNg9Z52Gkh8b3WIi0gkMxSnQ9RlUE4fpozTLXdSY/O0jPeDMTL0CRuzPfWj5OE6QFNaxI9lvXnz6pS8OBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:38.782806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3687","source_kind":"arxiv","source_version":12}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4b797464683c0d2790368c382f6259b3fb68c2c384dc5cf104c05dca293b185","sha256:4518265dd7b5910e72263b47448549e9e6621ef0bfa01a7c0aa0b07022ccafc8"],"state_sha256":"606f1c658ed87bd434e4bd6b3314c06fe9f09ca011b42b4f434483c8c33b9c28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1t2dGjn8+memh24fHPsTS/MoXKamPe/2G8ZjUHvkVrJp7VPsa6iCTUqfXSQRXgPOeasgDMPWy+cDz/ce4KTGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:33:26.111568Z","bundle_sha256":"792fbaa80a4904f31ed127695711bdf7db74fecbf05c77cc805dda2bb63e3443"}}