{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HVTLR4MDJF7IDMHLL7GVRDKH2T","short_pith_number":"pith:HVTLR4MD","canonical_record":{"source":{"id":"1312.4234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-16T02:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"de047fde62e7ffb539f5a8e5244a78afe71001d98c2f3e9583982bbece096ac5","abstract_canon_sha256":"90cbdc9ff33d789ce1d57ade8a5a0d52e7140ee73793817f8ba2f72f606420dd"},"schema_version":"1.0"},"canonical_sha256":"3d66b8f183497e81b0eb5fcd588d47d4ea267d5dfeb956c907b44a5ec01f6ee6","source":{"kind":"arxiv","id":"1312.4234","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4234","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4234v3","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4234","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"HVTLR4MDJF7I","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HVTLR4MDJF7IDMHL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HVTLR4MD","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HVTLR4MDJF7IDMHLL7GVRDKH2T","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-16T02:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"de047fde62e7ffb539f5a8e5244a78afe71001d98c2f3e9583982bbece096ac5","abstract_canon_sha256":"90cbdc9ff33d789ce1d57ade8a5a0d52e7140ee73793817f8ba2f72f606420dd"},"schema_version":"1.0"},"canonical_sha256":"3d66b8f183497e81b0eb5fcd588d47d4ea267d5dfeb956c907b44a5ec01f6ee6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.475189Z","signature_b64":"RUoVRYtccAza7jTAqe+rl7KJezez0SKDDl1rMS9PWb0O7zIvin5c6RMBqjAk/JBvrKGs6heNDd5S+Ut2JDaWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d66b8f183497e81b0eb5fcd588d47d4ea267d5dfeb956c907b44a5ec01f6ee6","last_reissued_at":"2026-05-18T02:25:40.474804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.474804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4234","source_version":3,"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-18T02:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/K3ZRD+iwdA2TO3yQyJ+62uAxxeUufrSp765RVNA56tg1iECm8d8M6mhdlixV51/4ObIh+oHMASUTmSzo4mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:02.087584Z"},"content_sha256":"391a621d50e728064daae8f8ecbfd8ca96cdcc9334675adda179fc108c4589a4","schema_version":"1.0","event_id":"sha256:391a621d50e728064daae8f8ecbfd8ca96cdcc9334675adda179fc108c4589a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HVTLR4MDJF7IDMHLL7GVRDKH2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectedness of graphs and its application to connected matroids through covering-based rough sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aiping Huang, William Zhu","submitted_at":"2013-12-16T02:32:43Z","abstract_excerpt":"Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and covering-based rough sets provide a systematic approach to this type of representation. In this paper, we study the connectedness of graphs through covering-based rough sets and apply it to connected matroids. First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4234","kind":"arxiv","version":3},"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-18T02:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVAcHi05OijkGa9PDOxkRDUlf1mbkbwlc7BXv8bX6ky3MgVNyRE6PzyJFJVJ/swT9m30rULfVyuts08aDcBZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:02.088211Z"},"content_sha256":"e3c5b1dfeb5efd198feecfe2fcf7401151cedd5d4df147155b78a95e11c64f83","schema_version":"1.0","event_id":"sha256:e3c5b1dfeb5efd198feecfe2fcf7401151cedd5d4df147155b78a95e11c64f83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/bundle.json","state_url":"https://pith.science/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/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-12T09:31:02Z","links":{"resolver":"https://pith.science/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T","bundle":"https://pith.science/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/bundle.json","state":"https://pith.science/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVTLR4MDJF7IDMHLL7GVRDKH2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HVTLR4MDJF7IDMHLL7GVRDKH2T","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":"90cbdc9ff33d789ce1d57ade8a5a0d52e7140ee73793817f8ba2f72f606420dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-16T02:32:43Z","title_canon_sha256":"de047fde62e7ffb539f5a8e5244a78afe71001d98c2f3e9583982bbece096ac5"},"schema_version":"1.0","source":{"id":"1312.4234","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4234","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4234v3","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4234","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"HVTLR4MDJF7I","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HVTLR4MDJF7IDMHL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HVTLR4MD","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:e3c5b1dfeb5efd198feecfe2fcf7401151cedd5d4df147155b78a95e11c64f83","target":"graph","created_at":"2026-05-18T02:25:40Z","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":"Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and covering-based rough sets provide a systematic approach to this type of representation. In this paper, we study the connectedness of graphs through covering-based rough sets and apply it to connected matroids. First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approxi","authors_text":"Aiping Huang, William Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-16T02:32:43Z","title":"Connectedness of graphs and its application to connected matroids through covering-based rough sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4234","kind":"arxiv","version":3},"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:391a621d50e728064daae8f8ecbfd8ca96cdcc9334675adda179fc108c4589a4","target":"record","created_at":"2026-05-18T02:25:40Z","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":"90cbdc9ff33d789ce1d57ade8a5a0d52e7140ee73793817f8ba2f72f606420dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-16T02:32:43Z","title_canon_sha256":"de047fde62e7ffb539f5a8e5244a78afe71001d98c2f3e9583982bbece096ac5"},"schema_version":"1.0","source":{"id":"1312.4234","kind":"arxiv","version":3}},"canonical_sha256":"3d66b8f183497e81b0eb5fcd588d47d4ea267d5dfeb956c907b44a5ec01f6ee6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d66b8f183497e81b0eb5fcd588d47d4ea267d5dfeb956c907b44a5ec01f6ee6","first_computed_at":"2026-05-18T02:25:40.474804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:40.474804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RUoVRYtccAza7jTAqe+rl7KJezez0SKDDl1rMS9PWb0O7zIvin5c6RMBqjAk/JBvrKGs6heNDd5S+Ut2JDaWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:40.475189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4234","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:391a621d50e728064daae8f8ecbfd8ca96cdcc9334675adda179fc108c4589a4","sha256:e3c5b1dfeb5efd198feecfe2fcf7401151cedd5d4df147155b78a95e11c64f83"],"state_sha256":"c2ccbb3f431a95a7b01e6828659cbab99904881f8bdb89abf178d787df748d1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIvIehxJqhlN4/EvxnNbDXyQMPvUDoRZ8hAFEX1L3u/F7UoEo4C/i5xZMAo4v2Xj/NXYcMgxdWZo/lGQklWPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:31:02.091873Z","bundle_sha256":"c93dc77d8e7303ccc07abe70246bf8605bd405b5b877b27933c8caae88dccc61"}}