{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GOUSUJHOXBC7237G4OYK5P5M6E","short_pith_number":"pith:GOUSUJHO","canonical_record":{"source":{"id":"1512.02723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-09T02:13:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83867f3e58afc0f745e1b5f02a0cfb127ba64984ebe12c16b2b9538954cdb601","abstract_canon_sha256":"e1f16b51d1905e1a932503f8f1b038c7b8a3847164fdbb9852c000d4b4ef274f"},"schema_version":"1.0"},"canonical_sha256":"33a92a24eeb845fd6fe6e3b0aebfacf10570816e4744d8e80c46808b35a8bd76","source":{"kind":"arxiv","id":"1512.02723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02723","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02723v1","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02723","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"GOUSUJHOXBC7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOUSUJHOXBC7237G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOUSUJHO","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GOUSUJHOXBC7237G4OYK5P5M6E","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-09T02:13:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83867f3e58afc0f745e1b5f02a0cfb127ba64984ebe12c16b2b9538954cdb601","abstract_canon_sha256":"e1f16b51d1905e1a932503f8f1b038c7b8a3847164fdbb9852c000d4b4ef274f"},"schema_version":"1.0"},"canonical_sha256":"33a92a24eeb845fd6fe6e3b0aebfacf10570816e4744d8e80c46808b35a8bd76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:43.253999Z","signature_b64":"7h0nNvDXkKgXe+LmVAGU9/uc8bCUiV6gVtcc2s+LIvKd74n8Y0NMWm04pb3jAYtgg9RvusqND7smA+8gBceCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a92a24eeb845fd6fe6e3b0aebfacf10570816e4744d8e80c46808b35a8bd76","last_reissued_at":"2026-05-18T01:24:43.253635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:43.253635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02723","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-18T01:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8O/MPbcWSdNc54KcmAuBPLgDewfzpw+SHdPH2JX4AhXLvIeq1k0GLAFL5dK6XzJ2NT+oeXAyLLXguBUKBMW7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:02:49.099156Z"},"content_sha256":"17f74e38a209a3a2646e6eaee2f69a834bf6e3592716e1d898b825df041c58d8","schema_version":"1.0","event_id":"sha256:17f74e38a209a3a2646e6eaee2f69a834bf6e3592716e1d898b825df041c58d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GOUSUJHOXBC7237G4OYK5P5M6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental approaches to knowledge reduction of covering decision information systems with variations of coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangming Lang","submitted_at":"2015-12-09T02:13:51Z","abstract_excerpt":"In practical situations, calculating approximations of concepts is the central step for knowledge reduction of dynamic covering decision information system, which has received growing interests of researchers in recent years. In this paper, the second and sixth lower and upper approximations of sets in dynamic covering information systems with variations of coverings are computed from the perspective of matrix using incremental approaches. Especially, effective algorithms are designed for calculating the second and sixth lower and upper approximations of sets in dynamic covering information sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02723","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-18T01:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFC1X2Rjfg6lZsBvFpoRdGHch6+QrzCUgI/29nskXgKOIJlpltz9OGHpPXn37mxR56puTuR6pgieWdUSxCXXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:02:49.099521Z"},"content_sha256":"61106ec6190cade8ccdbc28545050b7d5d05d97dcaf88db10e3de6a3d01a232b","schema_version":"1.0","event_id":"sha256:61106ec6190cade8ccdbc28545050b7d5d05d97dcaf88db10e3de6a3d01a232b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOUSUJHOXBC7237G4OYK5P5M6E/bundle.json","state_url":"https://pith.science/pith/GOUSUJHOXBC7237G4OYK5P5M6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOUSUJHOXBC7237G4OYK5P5M6E/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-05T08:02:49Z","links":{"resolver":"https://pith.science/pith/GOUSUJHOXBC7237G4OYK5P5M6E","bundle":"https://pith.science/pith/GOUSUJHOXBC7237G4OYK5P5M6E/bundle.json","state":"https://pith.science/pith/GOUSUJHOXBC7237G4OYK5P5M6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOUSUJHOXBC7237G4OYK5P5M6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GOUSUJHOXBC7237G4OYK5P5M6E","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":"e1f16b51d1905e1a932503f8f1b038c7b8a3847164fdbb9852c000d4b4ef274f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-09T02:13:51Z","title_canon_sha256":"83867f3e58afc0f745e1b5f02a0cfb127ba64984ebe12c16b2b9538954cdb601"},"schema_version":"1.0","source":{"id":"1512.02723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02723","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02723v1","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02723","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"GOUSUJHOXBC7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOUSUJHOXBC7237G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOUSUJHO","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:61106ec6190cade8ccdbc28545050b7d5d05d97dcaf88db10e3de6a3d01a232b","target":"graph","created_at":"2026-05-18T01:24: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":"In practical situations, calculating approximations of concepts is the central step for knowledge reduction of dynamic covering decision information system, which has received growing interests of researchers in recent years. In this paper, the second and sixth lower and upper approximations of sets in dynamic covering information systems with variations of coverings are computed from the perspective of matrix using incremental approaches. Especially, effective algorithms are designed for calculating the second and sixth lower and upper approximations of sets in dynamic covering information sy","authors_text":"Guangming Lang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-09T02:13:51Z","title":"Incremental approaches to knowledge reduction of covering decision information systems with variations of coverings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02723","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:17f74e38a209a3a2646e6eaee2f69a834bf6e3592716e1d898b825df041c58d8","target":"record","created_at":"2026-05-18T01:24: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":"e1f16b51d1905e1a932503f8f1b038c7b8a3847164fdbb9852c000d4b4ef274f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-09T02:13:51Z","title_canon_sha256":"83867f3e58afc0f745e1b5f02a0cfb127ba64984ebe12c16b2b9538954cdb601"},"schema_version":"1.0","source":{"id":"1512.02723","kind":"arxiv","version":1}},"canonical_sha256":"33a92a24eeb845fd6fe6e3b0aebfacf10570816e4744d8e80c46808b35a8bd76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33a92a24eeb845fd6fe6e3b0aebfacf10570816e4744d8e80c46808b35a8bd76","first_computed_at":"2026-05-18T01:24:43.253635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:43.253635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7h0nNvDXkKgXe+LmVAGU9/uc8bCUiV6gVtcc2s+LIvKd74n8Y0NMWm04pb3jAYtgg9RvusqND7smA+8gBceCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:43.253999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17f74e38a209a3a2646e6eaee2f69a834bf6e3592716e1d898b825df041c58d8","sha256:61106ec6190cade8ccdbc28545050b7d5d05d97dcaf88db10e3de6a3d01a232b"],"state_sha256":"a1ab685042c032514c3388943cc20e9f89f1b9e63bbc479ebac0e2b92dfde535"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqjFqPguV3Mh30u1GsczGl4NzESfVv2PsDgnTUBtHonLW2uJBhY1nDYFoCE8M/wy8/0EHmPvu1cChF9KGyk7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:02:49.101515Z","bundle_sha256":"b616fdcf42e505c9f95470faf0237c7fec08e9279af3cc6ede7e50b08088f0d5"}}