{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UNSVANFECPC2J26VOA5OXY2J6J","short_pith_number":"pith:UNSVANFE","canonical_record":{"source":{"id":"1710.03289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-09T19:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"af31243a8245082e0ae260f464ef8bdeaa0c5e11db66aef476b2e69cc210c120","abstract_canon_sha256":"f2ce08ab3d37b88ef1188aaedf1dd1a1f0a068f9a15c45f4a48c31b76af6d988"},"schema_version":"1.0"},"canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","source":{"kind":"arxiv","id":"1710.03289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03289","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03289v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03289","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"UNSVANFECPC2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UNSVANFECPC2J26V","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UNSVANFE","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UNSVANFECPC2J26VOA5OXY2J6J","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-09T19:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"af31243a8245082e0ae260f464ef8bdeaa0c5e11db66aef476b2e69cc210c120","abstract_canon_sha256":"f2ce08ab3d37b88ef1188aaedf1dd1a1f0a068f9a15c45f4a48c31b76af6d988"},"schema_version":"1.0"},"canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:12.465433Z","signature_b64":"o4piB+OtTxqNl931mkvfVbhj5RzU3E4rD1VysvKLQ4/e5BhAFrF0FT6w+QHxrDn30m0sR2aifiJrBB6fjCC3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","last_reissued_at":"2026-05-18T00:33:12.464927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:12.464927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03289","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDNTRsTbDKNOnuUS+OGB9s0Iw3uIoo6juDsSUSe6yHT2Bgz6pOhOSqQ1fnyOKvmr9xpZevLjBehRV6DXtqHWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:59.520386Z"},"content_sha256":"9bd483f83e3beeb998ceeba0df74a110d09231793f7ffef8e12f42b3e65aa4fa","schema_version":"1.0","event_id":"sha256:9bd483f83e3beeb998ceeba0df74a110d09231793f7ffef8e12f42b3e65aa4fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UNSVANFECPC2J26VOA5OXY2J6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient mining of maximal biclusters in mixed-attribute datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Fernando J. Von Zuben, Rosana Veroneze","submitted_at":"2017-10-09T19:59:19Z","abstract_excerpt":"This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets (containing both numerical and categorical attributes), with or without missing values. The proposal is an extension of RIn-Close_CVC, which was originally conceived to mine perfect or perturbed biclusters with constant values on columns solely from numerical datasets, and without missing values. Even endowed with additional and more general features, the extended RIn-Close_CVC retains four key properties: (1) efficiency, (2) completeness, (3) correctness, and (4) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03289","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKtKfLNuihnmkmItLIRMnN5Y1WtXS79YTgis4MKA72PoU17CO/AsSHwtd2zQqziqK8bD2UrMs1m7jXJZzIYhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:59.520741Z"},"content_sha256":"89baacc45aa9cc3f00bd5212f02b51871ad1a23db66aa29144e96b709028858a","schema_version":"1.0","event_id":"sha256:89baacc45aa9cc3f00bd5212f02b51871ad1a23db66aa29144e96b709028858a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/bundle.json","state_url":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNSVANFECPC2J26VOA5OXY2J6J/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-24T05:41:59Z","links":{"resolver":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J","bundle":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/bundle.json","state":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNSVANFECPC2J26VOA5OXY2J6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UNSVANFECPC2J26VOA5OXY2J6J","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":"f2ce08ab3d37b88ef1188aaedf1dd1a1f0a068f9a15c45f4a48c31b76af6d988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-09T19:59:19Z","title_canon_sha256":"af31243a8245082e0ae260f464ef8bdeaa0c5e11db66aef476b2e69cc210c120"},"schema_version":"1.0","source":{"id":"1710.03289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03289","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03289v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03289","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"UNSVANFECPC2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UNSVANFECPC2J26V","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UNSVANFE","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:89baacc45aa9cc3f00bd5212f02b51871ad1a23db66aa29144e96b709028858a","target":"graph","created_at":"2026-05-18T00:33:12Z","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 presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets (containing both numerical and categorical attributes), with or without missing values. The proposal is an extension of RIn-Close_CVC, which was originally conceived to mine perfect or perturbed biclusters with constant values on columns solely from numerical datasets, and without missing values. Even endowed with additional and more general features, the extended RIn-Close_CVC retains four key properties: (1) efficiency, (2) completeness, (3) correctness, and (4) ","authors_text":"Fernando J. Von Zuben, Rosana Veroneze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-09T19:59:19Z","title":"Efficient mining of maximal biclusters in mixed-attribute datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03289","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:9bd483f83e3beeb998ceeba0df74a110d09231793f7ffef8e12f42b3e65aa4fa","target":"record","created_at":"2026-05-18T00:33:12Z","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":"f2ce08ab3d37b88ef1188aaedf1dd1a1f0a068f9a15c45f4a48c31b76af6d988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-09T19:59:19Z","title_canon_sha256":"af31243a8245082e0ae260f464ef8bdeaa0c5e11db66aef476b2e69cc210c120"},"schema_version":"1.0","source":{"id":"1710.03289","kind":"arxiv","version":1}},"canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","first_computed_at":"2026-05-18T00:33:12.464927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:12.464927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4piB+OtTxqNl931mkvfVbhj5RzU3E4rD1VysvKLQ4/e5BhAFrF0FT6w+QHxrDn30m0sR2aifiJrBB6fjCC3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:12.465433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd483f83e3beeb998ceeba0df74a110d09231793f7ffef8e12f42b3e65aa4fa","sha256:89baacc45aa9cc3f00bd5212f02b51871ad1a23db66aa29144e96b709028858a"],"state_sha256":"b1ac0849535a2b81645f4669f7e2b8c5a8d2faa5b79314e12caa1f8f3c447731"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oJVG/8h17xalxfjqGgoCMrq15hLKdQuAjoSYJ6Dr9Ed9O+9W9rlK1ZCaJO6VeMYQtHRRewVxXngLHaOtNy4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:41:59.522722Z","bundle_sha256":"780b0165dca845e91b84241c32d3bdfe114898023b7ee264c59785659a2a2428"}}