{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZYIRLCRG6VLGECSDE3EMMIQL74","short_pith_number":"pith:ZYIRLCRG","canonical_record":{"source":{"id":"1603.03511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T03:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"3cac8b5528e28c7f172ac5ad13917cf8fd796d2d1d0e7f3a0ce9f851231d96d8","abstract_canon_sha256":"c03c6e3c8804269e19168ee59193e041bf4331c946136aaf2a9a4a89190fd235"},"schema_version":"1.0"},"canonical_sha256":"ce11158a26f556620a4326c8c6220bff28d40b2da6a17ab8ae6089dc4dfd8957","source":{"kind":"arxiv","id":"1603.03511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03511","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03511v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03511","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZYIRLCRG6VLG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZYIRLCRG6VLGECSD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZYIRLCRG","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZYIRLCRG6VLGECSDE3EMMIQL74","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T03:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"3cac8b5528e28c7f172ac5ad13917cf8fd796d2d1d0e7f3a0ce9f851231d96d8","abstract_canon_sha256":"c03c6e3c8804269e19168ee59193e041bf4331c946136aaf2a9a4a89190fd235"},"schema_version":"1.0"},"canonical_sha256":"ce11158a26f556620a4326c8c6220bff28d40b2da6a17ab8ae6089dc4dfd8957","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.456915Z","signature_b64":"7r2CVzTu2jie4G2ozPpgoXsLhy8hAW7hW3ql+iBKxU6XNjU/DMuCJfzN5dBNa9FQqKVQqfjnvLT46TgMESBdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce11158a26f556620a4326c8c6220bff28d40b2da6a17ab8ae6089dc4dfd8957","last_reissued_at":"2026-05-18T01:19:15.456509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.456509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03511","source_version":1,"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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pJJ6aUZ3fa9pF9Fea6LthU3z+Dy/8kqvqkVkE1cdf1a9q6ryAI8tK08lM6HBOH1hnMdLL4sojnyO/HLlfZ3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:33:13.927463Z"},"content_sha256":"e007ca5ab6e481c81d557d7454f9a02eaae2e7602ccbedc8837fe4bef67ccc47","schema_version":"1.0","event_id":"sha256:e007ca5ab6e481c81d557d7454f9a02eaae2e7602ccbedc8837fe4bef67ccc47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZYIRLCRG6VLGECSDE3EMMIQL74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Set Theoretic Approach for Knowledge Representation: the Representation Part","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Yi Zhou","submitted_at":"2016-03-11T03:22:12Z","abstract_excerpt":"In this paper, we propose a set theoretic approach for knowledge representation. While the syntax of an application domain is captured by set theoretic constructs including individuals, concepts and operators, knowledge is formalized by equality assertions. We first present a primitive form that uses minimal assumed knowledge and constructs. Then, assuming naive set theory, we extend it by definitions, which are special kinds of knowledge. Interestingly, we show that the primitive form is expressive enough to define logic operators, not only propositional connectives but also quantifiers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03511","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"},"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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMvGbNDd8DdeIfKBsnbvRmi7pJV/Q2zunS2HptNTRq5jVAKvAvW7ZH8hgkoIdVf5TjvNZN1jAEMHHqw/kSn3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:33:13.928167Z"},"content_sha256":"c9d44c6b624075871429e70f8ae57b74396b9082895a6c6400fa382627dc5f80","schema_version":"1.0","event_id":"sha256:c9d44c6b624075871429e70f8ae57b74396b9082895a6c6400fa382627dc5f80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/bundle.json","state_url":"https://pith.science/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/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-08T03:33:13Z","links":{"resolver":"https://pith.science/pith/ZYIRLCRG6VLGECSDE3EMMIQL74","bundle":"https://pith.science/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/bundle.json","state":"https://pith.science/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYIRLCRG6VLGECSDE3EMMIQL74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZYIRLCRG6VLGECSDE3EMMIQL74","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":"c03c6e3c8804269e19168ee59193e041bf4331c946136aaf2a9a4a89190fd235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T03:22:12Z","title_canon_sha256":"3cac8b5528e28c7f172ac5ad13917cf8fd796d2d1d0e7f3a0ce9f851231d96d8"},"schema_version":"1.0","source":{"id":"1603.03511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03511","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03511v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03511","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZYIRLCRG6VLG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZYIRLCRG6VLGECSD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZYIRLCRG","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:c9d44c6b624075871429e70f8ae57b74396b9082895a6c6400fa382627dc5f80","target":"graph","created_at":"2026-05-18T01:19:15Z","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, we propose a set theoretic approach for knowledge representation. While the syntax of an application domain is captured by set theoretic constructs including individuals, concepts and operators, knowledge is formalized by equality assertions. We first present a primitive form that uses minimal assumed knowledge and constructs. Then, assuming naive set theory, we extend it by definitions, which are special kinds of knowledge. Interestingly, we show that the primitive form is expressive enough to define logic operators, not only propositional connectives but also quantifiers.","authors_text":"Yi Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T03:22:12Z","title":"A Set Theoretic Approach for Knowledge Representation: the Representation Part"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03511","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:e007ca5ab6e481c81d557d7454f9a02eaae2e7602ccbedc8837fe4bef67ccc47","target":"record","created_at":"2026-05-18T01:19:15Z","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":"c03c6e3c8804269e19168ee59193e041bf4331c946136aaf2a9a4a89190fd235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T03:22:12Z","title_canon_sha256":"3cac8b5528e28c7f172ac5ad13917cf8fd796d2d1d0e7f3a0ce9f851231d96d8"},"schema_version":"1.0","source":{"id":"1603.03511","kind":"arxiv","version":1}},"canonical_sha256":"ce11158a26f556620a4326c8c6220bff28d40b2da6a17ab8ae6089dc4dfd8957","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce11158a26f556620a4326c8c6220bff28d40b2da6a17ab8ae6089dc4dfd8957","first_computed_at":"2026-05-18T01:19:15.456509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:15.456509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7r2CVzTu2jie4G2ozPpgoXsLhy8hAW7hW3ql+iBKxU6XNjU/DMuCJfzN5dBNa9FQqKVQqfjnvLT46TgMESBdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:15.456915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e007ca5ab6e481c81d557d7454f9a02eaae2e7602ccbedc8837fe4bef67ccc47","sha256:c9d44c6b624075871429e70f8ae57b74396b9082895a6c6400fa382627dc5f80"],"state_sha256":"a8951b3a656f1233c72f8755c98a4497b16404a085c31aee7bcd83243065b076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06lWptRwr2chLcEYkMt2JPvqKiht9E2KrA2kaTakU4hUTQG4uKMaoJbW3oG3SSFDXY5vJbz6d4DBztkfMlc8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:33:13.931969Z","bundle_sha256":"5da8e534562b03f40ed6e97a6afd00d613d2ca2c3bcedf0ab5514fdbaa562d3a"}}