{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DHNDFYSFSZUMXAFDC65ZZM67ST","short_pith_number":"pith:DHNDFYSF","canonical_record":{"source":{"id":"0911.5394","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2009-11-28T11:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"0f125d16bfbcc1fe22e59e76c6554f6a8ca52c27d22a5812ba7c9ec2f224612c","abstract_canon_sha256":"487598a993c9860504286826d25e315580ba891ac5f6599ba59d59fb4a6b3174"},"schema_version":"1.0"},"canonical_sha256":"19da32e2459668cb80a317bb9cb3df94f01318044cce7d2a42bbfbcaf993c2a8","source":{"kind":"arxiv","id":"0911.5394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.5394","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"0911.5394v2","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5394","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"DHNDFYSFSZUM","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DHNDFYSFSZUMXAFD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DHNDFYSF","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DHNDFYSFSZUMXAFDC65ZZM67ST","target":"record","payload":{"canonical_record":{"source":{"id":"0911.5394","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2009-11-28T11:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"0f125d16bfbcc1fe22e59e76c6554f6a8ca52c27d22a5812ba7c9ec2f224612c","abstract_canon_sha256":"487598a993c9860504286826d25e315580ba891ac5f6599ba59d59fb4a6b3174"},"schema_version":"1.0"},"canonical_sha256":"19da32e2459668cb80a317bb9cb3df94f01318044cce7d2a42bbfbcaf993c2a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:46.075798Z","signature_b64":"730SQcVDuSEoHq5jB2MHwcbZXgUcCmaNAA1IfVRn5QsYaOStAlmqpw02lyX1bPHjMetfQt1i+RxFWk2+TPZoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19da32e2459668cb80a317bb9cb3df94f01318044cce7d2a42bbfbcaf993c2a8","last_reissued_at":"2026-05-18T02:24:46.075203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:46.075203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.5394","source_version":2,"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:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLPtIWyMG7uvvfVax0Vv+guewlLrhg9GyPLvoD/BvVcB6bEaVz6V/0bU+Ae7IG6j/7K/CDLkFeiCaUPJITSdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:11:56.560802Z"},"content_sha256":"0bd2404b26eae068f2624f6e87db0490f181c9cfe3d4b4c053f10f496bf37376","schema_version":"1.0","event_id":"sha256:0bd2404b26eae068f2624f6e87db0490f181c9cfe3d4b4c053f10f496bf37376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DHNDFYSFSZUMXAFDC65ZZM67ST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering rough sets based on neighborhoods: An approach without using neighborhoods","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ping Zhu","submitted_at":"2009-11-28T11:04:06Z","abstract_excerpt":"Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.5394","kind":"arxiv","version":2},"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:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrsINrtsh7j0R9xU7iQYUEhP7y234v8NHbCn2NleAbexgZ3adg0fEgpkpaKbojGJ+OHtdeo4keSzQJHCbEnvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:11:56.561149Z"},"content_sha256":"3d10713df5fbd929570f841eb610de9899291e700548da0d7401689f48715022","schema_version":"1.0","event_id":"sha256:3d10713df5fbd929570f841eb610de9899291e700548da0d7401689f48715022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/bundle.json","state_url":"https://pith.science/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/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-03T23:11:56Z","links":{"resolver":"https://pith.science/pith/DHNDFYSFSZUMXAFDC65ZZM67ST","bundle":"https://pith.science/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/bundle.json","state":"https://pith.science/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHNDFYSFSZUMXAFDC65ZZM67ST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DHNDFYSFSZUMXAFDC65ZZM67ST","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":"487598a993c9860504286826d25e315580ba891ac5f6599ba59d59fb4a6b3174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2009-11-28T11:04:06Z","title_canon_sha256":"0f125d16bfbcc1fe22e59e76c6554f6a8ca52c27d22a5812ba7c9ec2f224612c"},"schema_version":"1.0","source":{"id":"0911.5394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.5394","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"0911.5394v2","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5394","created_at":"2026-05-18T02:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"DHNDFYSFSZUM","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DHNDFYSFSZUMXAFD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DHNDFYSF","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d10713df5fbd929570f841eb610de9899291e700548da0d7401689f48715022","target":"graph","created_at":"2026-05-18T02:24:46Z","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":"Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighbo","authors_text":"Ping Zhu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2009-11-28T11:04:06Z","title":"Covering rough sets based on neighborhoods: An approach without using neighborhoods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.5394","kind":"arxiv","version":2},"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:0bd2404b26eae068f2624f6e87db0490f181c9cfe3d4b4c053f10f496bf37376","target":"record","created_at":"2026-05-18T02:24:46Z","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":"487598a993c9860504286826d25e315580ba891ac5f6599ba59d59fb4a6b3174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2009-11-28T11:04:06Z","title_canon_sha256":"0f125d16bfbcc1fe22e59e76c6554f6a8ca52c27d22a5812ba7c9ec2f224612c"},"schema_version":"1.0","source":{"id":"0911.5394","kind":"arxiv","version":2}},"canonical_sha256":"19da32e2459668cb80a317bb9cb3df94f01318044cce7d2a42bbfbcaf993c2a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19da32e2459668cb80a317bb9cb3df94f01318044cce7d2a42bbfbcaf993c2a8","first_computed_at":"2026-05-18T02:24:46.075203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:46.075203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"730SQcVDuSEoHq5jB2MHwcbZXgUcCmaNAA1IfVRn5QsYaOStAlmqpw02lyX1bPHjMetfQt1i+RxFWk2+TPZoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:46.075798Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.5394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bd2404b26eae068f2624f6e87db0490f181c9cfe3d4b4c053f10f496bf37376","sha256:3d10713df5fbd929570f841eb610de9899291e700548da0d7401689f48715022"],"state_sha256":"9d5776cacb656941f3cb77114ee0a2340f94ed7e1eb890bfbcf571d30e9991bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcAmaDD3kEW+MmumOrjqOmPUsRQvprCmYDn7twI0SVBTUkEjIYj+hv6s22B4c/L6ame3RySPrRoYeohfk591BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:11:56.563119Z","bundle_sha256":"8871784eedde3275dc59a7f0ad24aa9a50e0a6a4d6888e2760f7b82d6ba31e88"}}