{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3DIRVBHRP4N6KFTBPCGTHBCPSU","short_pith_number":"pith:3DIRVBHR","canonical_record":{"source":{"id":"1209.4976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-22T09:25:50Z","cross_cats_sorted":[],"title_canon_sha256":"649e9183b155ca93084e6bca51304baa28b5998cd7dd8833837c1cbddc6eb519","abstract_canon_sha256":"67edff46762bbdb0e3d8de4d1cea27cceb5ed9054576ad349c5196481b24fd6a"},"schema_version":"1.0"},"canonical_sha256":"d8d11a84f17f1be51661788d33844f95225299ac9b8274a9e362c71f38400171","source":{"kind":"arxiv","id":"1209.4976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4976","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4976v2","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4976","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"pith_short_12","alias_value":"3DIRVBHRP4N6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3DIRVBHRP4N6KFTB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3DIRVBHR","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3DIRVBHRP4N6KFTBPCGTHBCPSU","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-22T09:25:50Z","cross_cats_sorted":[],"title_canon_sha256":"649e9183b155ca93084e6bca51304baa28b5998cd7dd8833837c1cbddc6eb519","abstract_canon_sha256":"67edff46762bbdb0e3d8de4d1cea27cceb5ed9054576ad349c5196481b24fd6a"},"schema_version":"1.0"},"canonical_sha256":"d8d11a84f17f1be51661788d33844f95225299ac9b8274a9e362c71f38400171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:43.268626Z","signature_b64":"ICCKwcERN8fALZNp+C0Ez54K0K9laqGYCS6sOKxjEUJpstYVKSqA523ZB2Qect11skrTRLxu930syIqxItZ3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d11a84f17f1be51661788d33844f95225299ac9b8274a9e362c71f38400171","last_reissued_at":"2026-05-18T03:39:43.268122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:43.268122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4976","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-18T03:39:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/XSwN0xcwazc0ovhlrKXOL82IXM+13d9oKScJFqau/mYYxwd0PtTEYWyvPeywoubG/cwNC5WDIIqgBFii6FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:29:54.031307Z"},"content_sha256":"2fd56a89e71b3a97a5a4e5b820d6bf6b218c7bbad37500a76b38642fcb1772c0","schema_version":"1.0","event_id":"sha256:2fd56a89e71b3a97a5a4e5b820d6bf6b218c7bbad37500a76b38642fcb1772c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3DIRVBHRP4N6KFTBPCGTHBCPSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matroidal structure of rough sets based on serial and transitive relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"William Zhu, Yanfang Liu","submitted_at":"2012-09-22T09:25:50Z","abstract_excerpt":"The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a generalization of linear independence in vector spaces. It has been used in combinatorial optimization and algorithm design. In order to take advantages of both rough sets and matroids, in this paper we propose a matroidal structure of rough sets based on a serial and transitive relation on a universe. We define the family of all minimal neighborhoods of a relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4976","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-18T03:39:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Asmk6yExLQVsKDsSTN0h0aqspfVGj4IidB22DbYf6rWC15E0toNU1fEwqlg2qAk4/IRmZ84AeFHwHtP38JHKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:29:54.031664Z"},"content_sha256":"94543411445db2b3005986b1aaf90b7ee4fed4b5280fb74580bdb40b82bd8225","schema_version":"1.0","event_id":"sha256:94543411445db2b3005986b1aaf90b7ee4fed4b5280fb74580bdb40b82bd8225"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/bundle.json","state_url":"https://pith.science/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/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-23T15:29:54Z","links":{"resolver":"https://pith.science/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU","bundle":"https://pith.science/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/bundle.json","state":"https://pith.science/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DIRVBHRP4N6KFTBPCGTHBCPSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3DIRVBHRP4N6KFTBPCGTHBCPSU","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":"67edff46762bbdb0e3d8de4d1cea27cceb5ed9054576ad349c5196481b24fd6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-22T09:25:50Z","title_canon_sha256":"649e9183b155ca93084e6bca51304baa28b5998cd7dd8833837c1cbddc6eb519"},"schema_version":"1.0","source":{"id":"1209.4976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4976","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4976v2","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4976","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"pith_short_12","alias_value":"3DIRVBHRP4N6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3DIRVBHRP4N6KFTB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3DIRVBHR","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:94543411445db2b3005986b1aaf90b7ee4fed4b5280fb74580bdb40b82bd8225","target":"graph","created_at":"2026-05-18T03:39: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":"The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a generalization of linear independence in vector spaces. It has been used in combinatorial optimization and algorithm design. In order to take advantages of both rough sets and matroids, in this paper we propose a matroidal structure of rough sets based on a serial and transitive relation on a universe. We define the family of all minimal neighborhoods of a relat","authors_text":"William Zhu, Yanfang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-22T09:25:50Z","title":"Matroidal structure of rough sets based on serial and transitive relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4976","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:2fd56a89e71b3a97a5a4e5b820d6bf6b218c7bbad37500a76b38642fcb1772c0","target":"record","created_at":"2026-05-18T03:39: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":"67edff46762bbdb0e3d8de4d1cea27cceb5ed9054576ad349c5196481b24fd6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-09-22T09:25:50Z","title_canon_sha256":"649e9183b155ca93084e6bca51304baa28b5998cd7dd8833837c1cbddc6eb519"},"schema_version":"1.0","source":{"id":"1209.4976","kind":"arxiv","version":2}},"canonical_sha256":"d8d11a84f17f1be51661788d33844f95225299ac9b8274a9e362c71f38400171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8d11a84f17f1be51661788d33844f95225299ac9b8274a9e362c71f38400171","first_computed_at":"2026-05-18T03:39:43.268122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:43.268122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICCKwcERN8fALZNp+C0Ez54K0K9laqGYCS6sOKxjEUJpstYVKSqA523ZB2Qect11skrTRLxu930syIqxItZ3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:43.268626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fd56a89e71b3a97a5a4e5b820d6bf6b218c7bbad37500a76b38642fcb1772c0","sha256:94543411445db2b3005986b1aaf90b7ee4fed4b5280fb74580bdb40b82bd8225"],"state_sha256":"86266bada793068ae4f841993e315333f4708df4d2297e2bfddf77f862e25f08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nW0Q0/MSSe7fcxsagdfpzY9jKLSdWoix6bkda1McCp1xLuwqSffMWqHfltl4TuPlsaC/4lMWrfLuRE5WMuA+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:29:54.033503Z","bundle_sha256":"8affee303d892c1afb5b324b4aab748f36999b8e831afbe38d59021d3abb8656"}}