{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CI3RKFKNI32QZMWWKSB67PPCBD","short_pith_number":"pith:CI3RKFKN","canonical_record":{"source":{"id":"1810.07725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T18:19:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"11c5c574ae84500f827c2502a24160291352d237f33eee410affc81d89c0b21a","abstract_canon_sha256":"25a45c6bffcf048fa25ba3c556bcf16c44d9f7387b4ca50043f73dacf08955ae"},"schema_version":"1.0"},"canonical_sha256":"123715154d46f50cb2d65483efbde208f95d5907da355cd3fea753c4a8b12987","source":{"kind":"arxiv","id":"1810.07725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07725","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07725v1","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07725","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"pith_short_12","alias_value":"CI3RKFKNI32Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CI3RKFKNI32QZMWW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CI3RKFKN","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CI3RKFKNI32QZMWWKSB67PPCBD","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T18:19:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"11c5c574ae84500f827c2502a24160291352d237f33eee410affc81d89c0b21a","abstract_canon_sha256":"25a45c6bffcf048fa25ba3c556bcf16c44d9f7387b4ca50043f73dacf08955ae"},"schema_version":"1.0"},"canonical_sha256":"123715154d46f50cb2d65483efbde208f95d5907da355cd3fea753c4a8b12987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:54.402294Z","signature_b64":"TiLQ+oafL4XREMWxUCAHFDTrL5Fj4HNFBQ1l/OoWNFtuYEsveF/6knkz9Z6yNcbUCufE/WYIDP6uUB/T2aprDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"123715154d46f50cb2d65483efbde208f95d5907da355cd3fea753c4a8b12987","last_reissued_at":"2026-05-18T00:02:54.401507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:54.401507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07725","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:02:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qdwh8YJiwD0u9bfF/T9ti3j4IO7H2hosm6hAaI1dyIkfs6iyEFYaUmPd1Fo7pplSbQORxT5fPgK3ssCpRRIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:06:12.093577Z"},"content_sha256":"8d459ca49afde9e56100baa25a63d3629d76b708675966a676c53d1f1be35cfa","schema_version":"1.0","event_id":"sha256:8d459ca49afde9e56100baa25a63d3629d76b708675966a676c53d1f1be35cfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CI3RKFKNI32QZMWWKSB67PPCBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fernando J. Von Zuben, Rosana Veroneze","submitted_at":"2018-10-17T18:19:39Z","abstract_excerpt":"RIn-Close_CVC is an efficient (take polynomial time per bicluster), complete (find all maximal biclusters), correct (all biclusters attend the user-defined level of consistency) and non-redundant (all the obtained biclusters are maximal and the same bicluster is not enumerated more than once) enumerative algorithm for mining maximal biclusters with constant values on columns in numerical datasets. Despite RIn-Close_CVC has all these outstanding properties, it has a high computational cost in terms of memory usage because it must keep a symbol table in memory to prevent a maximal bicluster to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07725","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:02:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9FpGJsnNq2+d6+8dn1oKUFG18ayrEFnsfzODJ8neBnSp9coULwHxbTrTbsDG2txcysyESPeRBQHw3V2pPXMRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:06:12.094061Z"},"content_sha256":"725f672404587cfbc5299e7577dd3ee3f5057e2a19b2dc4bea9ee37d9ee94d1c","schema_version":"1.0","event_id":"sha256:725f672404587cfbc5299e7577dd3ee3f5057e2a19b2dc4bea9ee37d9ee94d1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI3RKFKNI32QZMWWKSB67PPCBD/bundle.json","state_url":"https://pith.science/pith/CI3RKFKNI32QZMWWKSB67PPCBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI3RKFKNI32QZMWWKSB67PPCBD/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-24T03:06:12Z","links":{"resolver":"https://pith.science/pith/CI3RKFKNI32QZMWWKSB67PPCBD","bundle":"https://pith.science/pith/CI3RKFKNI32QZMWWKSB67PPCBD/bundle.json","state":"https://pith.science/pith/CI3RKFKNI32QZMWWKSB67PPCBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI3RKFKNI32QZMWWKSB67PPCBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CI3RKFKNI32QZMWWKSB67PPCBD","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":"25a45c6bffcf048fa25ba3c556bcf16c44d9f7387b4ca50043f73dacf08955ae","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T18:19:39Z","title_canon_sha256":"11c5c574ae84500f827c2502a24160291352d237f33eee410affc81d89c0b21a"},"schema_version":"1.0","source":{"id":"1810.07725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07725","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07725v1","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07725","created_at":"2026-05-18T00:02:54Z"},{"alias_kind":"pith_short_12","alias_value":"CI3RKFKNI32Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CI3RKFKNI32QZMWW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CI3RKFKN","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:725f672404587cfbc5299e7577dd3ee3f5057e2a19b2dc4bea9ee37d9ee94d1c","target":"graph","created_at":"2026-05-18T00:02:54Z","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":"RIn-Close_CVC is an efficient (take polynomial time per bicluster), complete (find all maximal biclusters), correct (all biclusters attend the user-defined level of consistency) and non-redundant (all the obtained biclusters are maximal and the same bicluster is not enumerated more than once) enumerative algorithm for mining maximal biclusters with constant values on columns in numerical datasets. Despite RIn-Close_CVC has all these outstanding properties, it has a high computational cost in terms of memory usage because it must keep a symbol table in memory to prevent a maximal bicluster to b","authors_text":"Fernando J. Von Zuben, Rosana Veroneze","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T18:19:39Z","title":"RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07725","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:8d459ca49afde9e56100baa25a63d3629d76b708675966a676c53d1f1be35cfa","target":"record","created_at":"2026-05-18T00:02:54Z","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":"25a45c6bffcf048fa25ba3c556bcf16c44d9f7387b4ca50043f73dacf08955ae","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T18:19:39Z","title_canon_sha256":"11c5c574ae84500f827c2502a24160291352d237f33eee410affc81d89c0b21a"},"schema_version":"1.0","source":{"id":"1810.07725","kind":"arxiv","version":1}},"canonical_sha256":"123715154d46f50cb2d65483efbde208f95d5907da355cd3fea753c4a8b12987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"123715154d46f50cb2d65483efbde208f95d5907da355cd3fea753c4a8b12987","first_computed_at":"2026-05-18T00:02:54.401507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:54.401507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TiLQ+oafL4XREMWxUCAHFDTrL5Fj4HNFBQ1l/OoWNFtuYEsveF/6knkz9Z6yNcbUCufE/WYIDP6uUB/T2aprDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:54.402294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d459ca49afde9e56100baa25a63d3629d76b708675966a676c53d1f1be35cfa","sha256:725f672404587cfbc5299e7577dd3ee3f5057e2a19b2dc4bea9ee37d9ee94d1c"],"state_sha256":"0a3229ba3343f2f1aff8b4a8d825dc867ecb9e4de7cf69a2ffacfda0d9ee5231"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfOkHcN60HNqKaeBqxwCCmgxvWVSEqPgmMbGt61zYzRcX3rO8gbokTw54WW7jccsO4Ow5ejQlrAxX/u+4i/NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:06:12.097146Z","bundle_sha256":"1a32a072b9d2637a2c986f79ee5740c9097253245e21001346256738e653edc6"}}