{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UNSVANFECPC2J26VOA5OXY2J6J","short_pith_number":"pith:UNSVANFE","schema_version":"1.0","canonical_sha256":"a3655034a413c5a4ebd5703aebe349f2487c8b27a3ae958de75881ad864f77de","source":{"kind":"arxiv","id":"1710.03289","version":1},"attestation_state":"computed","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) "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.03289","created_at":"2026-05-18T00:33:12.464993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03289v1","created_at":"2026-05-18T00:33:12.464993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03289","created_at":"2026-05-18T00:33:12.464993+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNSVANFECPC2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNSVANFECPC2J26V","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNSVANFE","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J","json":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J.json","graph_json":"https://pith.science/api/pith-number/UNSVANFECPC2J26VOA5OXY2J6J/graph.json","events_json":"https://pith.science/api/pith-number/UNSVANFECPC2J26VOA5OXY2J6J/events.json","paper":"https://pith.science/paper/UNSVANFE"},"agent_actions":{"view_html":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J","download_json":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J.json","view_paper":"https://pith.science/paper/UNSVANFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03289&json=true","fetch_graph":"https://pith.science/api/pith-number/UNSVANFECPC2J26VOA5OXY2J6J/graph.json","fetch_events":"https://pith.science/api/pith-number/UNSVANFECPC2J26VOA5OXY2J6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/action/storage_attestation","attest_author":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/action/author_attestation","sign_citation":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/action/citation_signature","submit_replication":"https://pith.science/pith/UNSVANFECPC2J26VOA5OXY2J6J/action/replication_record"}},"created_at":"2026-05-18T00:33:12.464993+00:00","updated_at":"2026-05-18T00:33:12.464993+00:00"}