{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PEB277CXSSQ42VFMWCMWXFUCSZ","short_pith_number":"pith:PEB277CX","canonical_record":{"source":{"id":"1712.01117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T03:29:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4dea41bf17072d5c97bb419f0141f3272f92ccdc6c55892973019ca2f78b4be","abstract_canon_sha256":"dad6ab2f5d67974ce1834a6f2be41dc49fda614c1dc1a0511871695041a90b51"},"schema_version":"1.0"},"canonical_sha256":"7903affc5794a1cd54acb0996b96829649930ff42f45c8a2d74dd857701a40f4","source":{"kind":"arxiv","id":"1712.01117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01117","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01117v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01117","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"PEB277CXSSQ4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PEB277CXSSQ42VFM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PEB277CX","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PEB277CXSSQ42VFMWCMWXFUCSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T03:29:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4dea41bf17072d5c97bb419f0141f3272f92ccdc6c55892973019ca2f78b4be","abstract_canon_sha256":"dad6ab2f5d67974ce1834a6f2be41dc49fda614c1dc1a0511871695041a90b51"},"schema_version":"1.0"},"canonical_sha256":"7903affc5794a1cd54acb0996b96829649930ff42f45c8a2d74dd857701a40f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:59.466612Z","signature_b64":"SuJ/W1SLpYYy8Qs4RktFAtqfy28km+aBL3BRGf2ngnCG73BeixNp+pq6V9ZUwNSFa5B8Lofgx9xxDQXH+7ECBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7903affc5794a1cd54acb0996b96829649930ff42f45c8a2d74dd857701a40f4","last_reissued_at":"2026-05-18T00:28:59.466205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:59.466205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01117","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:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nNkHcJBuRmllHv11YBlCJnkdJOK/mPmL41wpd8W1wpjR4py0Wio1GbeCEB6VoiX46Ui28CYByeYFKzsF4YKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:57:55.468218Z"},"content_sha256":"4553bbe19df36ce41a8d799773929764bc550515d0c49166d9bacbc9337286e8","schema_version":"1.0","event_id":"sha256:4553bbe19df36ce41a8d799773929764bc550515d0c49166d9bacbc9337286e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PEB277CXSSQ42VFMWCMWXFUCSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Related families-based attribute reduction of dynamic covering information systems with variations of object sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangming Lang","submitted_at":"2017-12-01T03:29:24Z","abstract_excerpt":"In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consiste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01117","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:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liLtstiwp1ca2O8E4WTdDMAjXQEw/Dt/OywnvbobEj14XLEb0iI770i9qxeC6U4U2gHk8bUsnycsjxt5tG4iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:57:55.468591Z"},"content_sha256":"fd536d4c443eddd54c4fb05a01b058601c26cc111a8b44e626c5cc3c20338fed","schema_version":"1.0","event_id":"sha256:fd536d4c443eddd54c4fb05a01b058601c26cc111a8b44e626c5cc3c20338fed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/bundle.json","state_url":"https://pith.science/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/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-05T11:57:55Z","links":{"resolver":"https://pith.science/pith/PEB277CXSSQ42VFMWCMWXFUCSZ","bundle":"https://pith.science/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/bundle.json","state":"https://pith.science/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEB277CXSSQ42VFMWCMWXFUCSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PEB277CXSSQ42VFMWCMWXFUCSZ","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":"dad6ab2f5d67974ce1834a6f2be41dc49fda614c1dc1a0511871695041a90b51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T03:29:24Z","title_canon_sha256":"b4dea41bf17072d5c97bb419f0141f3272f92ccdc6c55892973019ca2f78b4be"},"schema_version":"1.0","source":{"id":"1712.01117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01117","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01117v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01117","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"PEB277CXSSQ4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PEB277CXSSQ42VFM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PEB277CX","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:fd536d4c443eddd54c4fb05a01b058601c26cc111a8b44e626c5cc3c20338fed","target":"graph","created_at":"2026-05-18T00:28:59Z","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 practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consiste","authors_text":"Guangming Lang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T03:29:24Z","title":"Related families-based attribute reduction of dynamic covering information systems with variations of object sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01117","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:4553bbe19df36ce41a8d799773929764bc550515d0c49166d9bacbc9337286e8","target":"record","created_at":"2026-05-18T00:28:59Z","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":"dad6ab2f5d67974ce1834a6f2be41dc49fda614c1dc1a0511871695041a90b51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T03:29:24Z","title_canon_sha256":"b4dea41bf17072d5c97bb419f0141f3272f92ccdc6c55892973019ca2f78b4be"},"schema_version":"1.0","source":{"id":"1712.01117","kind":"arxiv","version":1}},"canonical_sha256":"7903affc5794a1cd54acb0996b96829649930ff42f45c8a2d74dd857701a40f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7903affc5794a1cd54acb0996b96829649930ff42f45c8a2d74dd857701a40f4","first_computed_at":"2026-05-18T00:28:59.466205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:59.466205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SuJ/W1SLpYYy8Qs4RktFAtqfy28km+aBL3BRGf2ngnCG73BeixNp+pq6V9ZUwNSFa5B8Lofgx9xxDQXH+7ECBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:59.466612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4553bbe19df36ce41a8d799773929764bc550515d0c49166d9bacbc9337286e8","sha256:fd536d4c443eddd54c4fb05a01b058601c26cc111a8b44e626c5cc3c20338fed"],"state_sha256":"06b58b9299a16c9a563dd8bb1aa8b5cfdceb24e5c10a6dc9f8101134d2d9691a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYZkw6m9n2xpHvsT7/VNicCWl+M7xy4cztS0Zv878oZRBVHu+q0RPewl9FgVT0Ul1166i4o8wOXhI1eUc1InCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:57:55.470507Z","bundle_sha256":"739827a37bd709bd832b97a51cd708b38d4cf14610939f039d862e5ed2cc330b"}}