{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KPFWY2GQJJYBRBBGHLAC2AID2G","short_pith_number":"pith:KPFWY2GQ","canonical_record":{"source":{"id":"1711.07321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-16T08:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"d5b3b826ea7bba11ff1f6f45b0290cdd1108383e1459336792701c8cc0964b70","abstract_canon_sha256":"40e8bd539587869793f4b78a23f25f577911efd34e1c2a4d7bfe9e612ce85d4a"},"schema_version":"1.0"},"canonical_sha256":"53cb6c68d04a701884263ac02d0103d18673a76070d271267b8d9c94b953a599","source":{"kind":"arxiv","id":"1711.07321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07321","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07321v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07321","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"KPFWY2GQJJYB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPFWY2GQJJYBRBBG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPFWY2GQ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KPFWY2GQJJYBRBBGHLAC2AID2G","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-16T08:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"d5b3b826ea7bba11ff1f6f45b0290cdd1108383e1459336792701c8cc0964b70","abstract_canon_sha256":"40e8bd539587869793f4b78a23f25f577911efd34e1c2a4d7bfe9e612ce85d4a"},"schema_version":"1.0"},"canonical_sha256":"53cb6c68d04a701884263ac02d0103d18673a76070d271267b8d9c94b953a599","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.496979Z","signature_b64":"D4SAhFKRTMKy7WgTRYlb86f295GiFTI3CU8KGFxndVUdRWx1oyQ3mfFSwdFMu3L9hqCrr7/PBCT9lKhCRIIeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53cb6c68d04a701884263ac02d0103d18673a76070d271267b8d9c94b953a599","last_reissued_at":"2026-05-18T00:30:10.496245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.496245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07321","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-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+OIj0EbQo1f8GgUW5m77wGToPPHL8aklCRx04HJL0V3CNg9J0kFA94FXjd37+Ib4g6gyobXrCebq5NdV+kykBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:24:39.280374Z"},"content_sha256":"0a02dd0655aa917a9b3a01ac45e4ebd866aa47c9ee88fa13c5e7157a099be7cc","schema_version":"1.0","event_id":"sha256:0a02dd0655aa917a9b3a01ac45e4ebd866aa47c9ee88fa13c5e7157a099be7cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KPFWY2GQJJYBRBBGHLAC2AID2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Related family-based attribute reduction of covering information systems when varying attribute sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Guangming Lang","submitted_at":"2017-11-16T08:54:28Z","abstract_excerpt":"In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07321","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-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3Gcgs58jVAB0qvK6zosydBJpF6CfPa51i1+Rln28v0fPC8RlJACAc5228cVHV8APGTdR0DUS1MPEYZQb5BICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:24:39.280735Z"},"content_sha256":"9df69e0bbd1505e0753c1385ec8fade4e36ba664af833f6b4cccb37a94e23b9e","schema_version":"1.0","event_id":"sha256:9df69e0bbd1505e0753c1385ec8fade4e36ba664af833f6b4cccb37a94e23b9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/bundle.json","state_url":"https://pith.science/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/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-05T10:24:39Z","links":{"resolver":"https://pith.science/pith/KPFWY2GQJJYBRBBGHLAC2AID2G","bundle":"https://pith.science/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/bundle.json","state":"https://pith.science/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPFWY2GQJJYBRBBGHLAC2AID2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KPFWY2GQJJYBRBBGHLAC2AID2G","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":"40e8bd539587869793f4b78a23f25f577911efd34e1c2a4d7bfe9e612ce85d4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-16T08:54:28Z","title_canon_sha256":"d5b3b826ea7bba11ff1f6f45b0290cdd1108383e1459336792701c8cc0964b70"},"schema_version":"1.0","source":{"id":"1711.07321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07321","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07321v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07321","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"KPFWY2GQJJYB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPFWY2GQJJYBRBBG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPFWY2GQ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:9df69e0bbd1505e0753c1385ec8fade4e36ba664af833f6b4cccb37a94e23b9e","target":"graph","created_at":"2026-05-18T00:30:10Z","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 practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental resu","authors_text":"Guangming Lang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-16T08:54:28Z","title":"Related family-based attribute reduction of covering information systems when varying attribute sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07321","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:0a02dd0655aa917a9b3a01ac45e4ebd866aa47c9ee88fa13c5e7157a099be7cc","target":"record","created_at":"2026-05-18T00:30:10Z","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":"40e8bd539587869793f4b78a23f25f577911efd34e1c2a4d7bfe9e612ce85d4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-16T08:54:28Z","title_canon_sha256":"d5b3b826ea7bba11ff1f6f45b0290cdd1108383e1459336792701c8cc0964b70"},"schema_version":"1.0","source":{"id":"1711.07321","kind":"arxiv","version":1}},"canonical_sha256":"53cb6c68d04a701884263ac02d0103d18673a76070d271267b8d9c94b953a599","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53cb6c68d04a701884263ac02d0103d18673a76070d271267b8d9c94b953a599","first_computed_at":"2026-05-18T00:30:10.496245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:10.496245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D4SAhFKRTMKy7WgTRYlb86f295GiFTI3CU8KGFxndVUdRWx1oyQ3mfFSwdFMu3L9hqCrr7/PBCT9lKhCRIIeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:10.496979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a02dd0655aa917a9b3a01ac45e4ebd866aa47c9ee88fa13c5e7157a099be7cc","sha256:9df69e0bbd1505e0753c1385ec8fade4e36ba664af833f6b4cccb37a94e23b9e"],"state_sha256":"bec505d1696961a2db2379d5bbb7bb9099c670b288ca3630401f592fd51e4644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXMdC6l7MCwp9JNQawAaw6qMGZdQ7H5L2TmjoMk6lEZB5aNrePWIBTCBTdO0RQ6MKal1a7OYWnpXdmXvGkL0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:24:39.282626Z","bundle_sha256":"abd791152857d8563aa58cd4846ec54ad8ad3cbd7f394e805974f9588eafe589"}}