{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZJUSDZZMJDV3NPGKKMQIONB76I","short_pith_number":"pith:ZJUSDZZM","canonical_record":{"source":{"id":"1011.0190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-10-31T18:46:50Z","cross_cats_sorted":[],"title_canon_sha256":"7c9d0b99d02f3cc91947448b8b4c8d98d9627dc2a7b616d1672e44a0b4f7ef62","abstract_canon_sha256":"430f19aeddec8be9d11e800178f37eb2549980d8c547757ee755e4cadef3e7df"},"schema_version":"1.0"},"canonical_sha256":"ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251","source":{"kind":"arxiv","id":"1011.0190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0190","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0190v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0190","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZJUSDZZMJDV3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZJUSDZZMJDV3NPGK","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZJUSDZZM","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZJUSDZZMJDV3NPGKKMQIONB76I","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-10-31T18:46:50Z","cross_cats_sorted":[],"title_canon_sha256":"7c9d0b99d02f3cc91947448b8b4c8d98d9627dc2a7b616d1672e44a0b4f7ef62","abstract_canon_sha256":"430f19aeddec8be9d11e800178f37eb2549980d8c547757ee755e4cadef3e7df"},"schema_version":"1.0"},"canonical_sha256":"ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.017528Z","signature_b64":"fXS3qWEDQFgKO/jVUOU3O3yPrXx6GMgdGrm3lCSu7igpL3jDtlUoKBN4SGUscJQd9xxnrIhT76if6kfA8WPSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251","last_reissued_at":"2026-05-18T02:23:38.016855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.016855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0190","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-18T02:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QrsHM1OcuoY/9T33vH4+9G15Ggp6nDl4QDR9lbCQLjJLnXGNydEWNmuMhiH/bMZrtf+sfGIRfEXFbNl+Ns+dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:34:58.022005Z"},"content_sha256":"a00439eec14ab5588213b8c5e1aca6ba93150d37355a96e64d361c592049d7ef","schema_version":"1.0","event_id":"sha256:a00439eec14ab5588213b8c5e1aca6ba93150d37355a96e64d361c592049d7ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZJUSDZZMJDV3NPGKKMQIONB76I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"\\c{S}ahin Emrah Amrahov, Fatih Aybar, Serhat Do\\u{g}an","submitted_at":"2010-10-31T18:46:50Z","abstract_excerpt":"In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms are well-known. Alternative to these algorithms Pruning Algorithm of Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation (PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRG algorithm is compared with RG and MRG algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0190","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-18T02:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppErcv6kotsKvYt1QtnWrxm+dqP/7TIr9pqhzDMrcRGT/7t3aobCoI2w9DHxcJudWO2ROB821fBh5kBAQrKnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:34:58.022766Z"},"content_sha256":"145a9f98f0c9e941c6ebbbc652b6969a12ea7ac9bc5cfe7c159db3f978f0ad43","schema_version":"1.0","event_id":"sha256:145a9f98f0c9e941c6ebbbc652b6969a12ea7ac9bc5cfe7c159db3f978f0ad43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/bundle.json","state_url":"https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/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-12T00:34:58Z","links":{"resolver":"https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I","bundle":"https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/bundle.json","state":"https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJUSDZZMJDV3NPGKKMQIONB76I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZJUSDZZMJDV3NPGKKMQIONB76I","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":"430f19aeddec8be9d11e800178f37eb2549980d8c547757ee755e4cadef3e7df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-10-31T18:46:50Z","title_canon_sha256":"7c9d0b99d02f3cc91947448b8b4c8d98d9627dc2a7b616d1672e44a0b4f7ef62"},"schema_version":"1.0","source":{"id":"1011.0190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0190","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0190v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0190","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZJUSDZZMJDV3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZJUSDZZMJDV3NPGK","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZJUSDZZM","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:145a9f98f0c9e941c6ebbbc652b6969a12ea7ac9bc5cfe7c159db3f978f0ad43","target":"graph","created_at":"2026-05-18T02:23: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":"In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms are well-known. Alternative to these algorithms Pruning Algorithm of Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation (PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRG algorithm is compared with RG and MRG algorithms","authors_text":"\\c{S}ahin Emrah Amrahov, Fatih Aybar, Serhat Do\\u{g}an","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-10-31T18:46:50Z","title":"Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0190","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:a00439eec14ab5588213b8c5e1aca6ba93150d37355a96e64d361c592049d7ef","target":"record","created_at":"2026-05-18T02:23: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":"430f19aeddec8be9d11e800178f37eb2549980d8c547757ee755e4cadef3e7df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-10-31T18:46:50Z","title_canon_sha256":"7c9d0b99d02f3cc91947448b8b4c8d98d9627dc2a7b616d1672e44a0b4f7ef62"},"schema_version":"1.0","source":{"id":"1011.0190","kind":"arxiv","version":1}},"canonical_sha256":"ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251","first_computed_at":"2026-05-18T02:23:38.016855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:38.016855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXS3qWEDQFgKO/jVUOU3O3yPrXx6GMgdGrm3lCSu7igpL3jDtlUoKBN4SGUscJQd9xxnrIhT76if6kfA8WPSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:38.017528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a00439eec14ab5588213b8c5e1aca6ba93150d37355a96e64d361c592049d7ef","sha256:145a9f98f0c9e941c6ebbbc652b6969a12ea7ac9bc5cfe7c159db3f978f0ad43"],"state_sha256":"1d89dff36f0bc09e98f22b26ff4c5b468592d2acd37bb1576c320d006f3f8896"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyXFe0n04dDbnV1RD637x822I8kU+y4uGdjCcHDOH+gwy9Co8GDPc++5IRdTblY4ldeQbbyM5KZFcwo49jsqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:34:58.027116Z","bundle_sha256":"f0b03bffc7f2c0e78e3685e6929322d317b97cfbd872469e1ab6408a0786c44c"}}