{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7756KLESE4GDLXEMCIKWCB5EUU","short_pith_number":"pith:7756KLES","canonical_record":{"source":{"id":"1209.6509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-28T13:07:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b241fe1aeb75ba45fa3cc5535ec1641c80d4c7a061e6226b756215f5c1436e0f","abstract_canon_sha256":"e0e1b7ca27fd70156de0ea4c8810f298298bdb43cd1a5107abfddf11f53aad21"},"schema_version":"1.0"},"canonical_sha256":"fffbe52c92270c35dc8c12156107a4a51740ce0d9730040648a1d2739c6ea832","source":{"kind":"arxiv","id":"1209.6509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6509","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6509v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6509","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"7756KLESE4GD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7756KLESE4GDLXEM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7756KLES","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7756KLESE4GDLXEMCIKWCB5EUU","target":"record","payload":{"canonical_record":{"source":{"id":"1209.6509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-28T13:07:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b241fe1aeb75ba45fa3cc5535ec1641c80d4c7a061e6226b756215f5c1436e0f","abstract_canon_sha256":"e0e1b7ca27fd70156de0ea4c8810f298298bdb43cd1a5107abfddf11f53aad21"},"schema_version":"1.0"},"canonical_sha256":"fffbe52c92270c35dc8c12156107a4a51740ce0d9730040648a1d2739c6ea832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:25.277464Z","signature_b64":"R5HOA9Jx+xiqsoJe1lNPGbLQENTa6iNSp1flw3+ZEQURDsn1A+NzvwfiSQCiwGRpgZ7K/SHr6DjLgG3djxGEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fffbe52c92270c35dc8c12156107a4a51740ce0d9730040648a1d2739c6ea832","last_reissued_at":"2026-05-18T03:44:25.276944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:25.276944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.6509","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-18T03:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2TKTUjrIczmggsdCj/aMCV47YYP9Xe+Nan0KzOvUtCQEsaDNkfBe4NwcfmkXSyKwu6JCiUmkfQ5jOGklGusDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:29:40.219963Z"},"content_sha256":"3b31940ec6f242615eb39ad1ad8072364d1056f558db7f2b5bb32a470b3f2e04","schema_version":"1.0","event_id":"sha256:3b31940ec6f242615eb39ad1ad8072364d1056f558db7f2b5bb32a470b3f2e04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7756KLESE4GDLXEMCIKWCB5EUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data compression of dynamic set-valued information systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangming Lang, Qingguo Li","submitted_at":"2012-09-28T13:07:08Z","abstract_excerpt":"This paper further investigates the set-valued information system. First, we bring forward three tolerance relations for set-valued information systems and explore their basic properties in detail. Then the data compression is investigated for attribute reductions of set-valued information systems. Afterwards, we discuss the data compression of dynamic set-valued information systems by utilizing the precious compression of the original systems. Several illustrative examples are employed to show that attribute reductions of set-valued information systems can be simplified significantly by our p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6509","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-18T03:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gns4NYWyiUY4KJpSHK5lLTWl2pDiHFsB4iVvjerrgo08/1WLzlE0Nn22x/bVxlh2OKHRwEguw8OdaEFO7QxXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:29:40.220298Z"},"content_sha256":"0db2cef9b82bf0160dbddf7fb27ea1f6ee0a31ad2f80a4f730efe4faaed191f9","schema_version":"1.0","event_id":"sha256:0db2cef9b82bf0160dbddf7fb27ea1f6ee0a31ad2f80a4f730efe4faaed191f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7756KLESE4GDLXEMCIKWCB5EUU/bundle.json","state_url":"https://pith.science/pith/7756KLESE4GDLXEMCIKWCB5EUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7756KLESE4GDLXEMCIKWCB5EUU/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-04T19:29:40Z","links":{"resolver":"https://pith.science/pith/7756KLESE4GDLXEMCIKWCB5EUU","bundle":"https://pith.science/pith/7756KLESE4GDLXEMCIKWCB5EUU/bundle.json","state":"https://pith.science/pith/7756KLESE4GDLXEMCIKWCB5EUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7756KLESE4GDLXEMCIKWCB5EUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7756KLESE4GDLXEMCIKWCB5EUU","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":"e0e1b7ca27fd70156de0ea4c8810f298298bdb43cd1a5107abfddf11f53aad21","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-28T13:07:08Z","title_canon_sha256":"b241fe1aeb75ba45fa3cc5535ec1641c80d4c7a061e6226b756215f5c1436e0f"},"schema_version":"1.0","source":{"id":"1209.6509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6509","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6509v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6509","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"7756KLESE4GD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7756KLESE4GDLXEM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7756KLES","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:0db2cef9b82bf0160dbddf7fb27ea1f6ee0a31ad2f80a4f730efe4faaed191f9","target":"graph","created_at":"2026-05-18T03:44:25Z","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":"This paper further investigates the set-valued information system. First, we bring forward three tolerance relations for set-valued information systems and explore their basic properties in detail. Then the data compression is investigated for attribute reductions of set-valued information systems. Afterwards, we discuss the data compression of dynamic set-valued information systems by utilizing the precious compression of the original systems. Several illustrative examples are employed to show that attribute reductions of set-valued information systems can be simplified significantly by our p","authors_text":"Guangming Lang, Qingguo Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-28T13:07:08Z","title":"Data compression of dynamic set-valued information systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6509","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:3b31940ec6f242615eb39ad1ad8072364d1056f558db7f2b5bb32a470b3f2e04","target":"record","created_at":"2026-05-18T03:44:25Z","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":"e0e1b7ca27fd70156de0ea4c8810f298298bdb43cd1a5107abfddf11f53aad21","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-28T13:07:08Z","title_canon_sha256":"b241fe1aeb75ba45fa3cc5535ec1641c80d4c7a061e6226b756215f5c1436e0f"},"schema_version":"1.0","source":{"id":"1209.6509","kind":"arxiv","version":1}},"canonical_sha256":"fffbe52c92270c35dc8c12156107a4a51740ce0d9730040648a1d2739c6ea832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fffbe52c92270c35dc8c12156107a4a51740ce0d9730040648a1d2739c6ea832","first_computed_at":"2026-05-18T03:44:25.276944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:25.276944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R5HOA9Jx+xiqsoJe1lNPGbLQENTa6iNSp1flw3+ZEQURDsn1A+NzvwfiSQCiwGRpgZ7K/SHr6DjLgG3djxGEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:25.277464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b31940ec6f242615eb39ad1ad8072364d1056f558db7f2b5bb32a470b3f2e04","sha256:0db2cef9b82bf0160dbddf7fb27ea1f6ee0a31ad2f80a4f730efe4faaed191f9"],"state_sha256":"808f579e15c39cb8e072686eedf88579e59393d633f6ce5dd7931a863f5ed284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0yS1kYJHXlElM3lu+HKAd1Kk+yjFPF7X88mNRGqq/XWTi3FJMn4bB4GrxMz3kRj2H77TzBVsm1cmf18FEyUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:29:40.222290Z","bundle_sha256":"adaea55b8c7bc48db358881a7cddf017bed88274af93864efa63d93c4ae170de"}}