{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PT7VULCGGAFWQT6XGXXF56ZKSD","short_pith_number":"pith:PT7VULCG","canonical_record":{"source":{"id":"1506.01077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T22:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"366b02d125f2b42ae270528982a48f048f542a396c0c268cb7f5bddfc75654b5","abstract_canon_sha256":"3efc399d55b07c27dcbf72a8219b9c2d8ab77120b79f84d3f19ce5e09a761522"},"schema_version":"1.0"},"canonical_sha256":"7cff5a2c46300b684fd735ee5efb2a90dbda2f576fcf22131344979db12b44ac","source":{"kind":"arxiv","id":"1506.01077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01077","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01077v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01077","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"PT7VULCGGAFW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT7VULCGGAFWQT6X","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT7VULCG","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PT7VULCGGAFWQT6XGXXF56ZKSD","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T22:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"366b02d125f2b42ae270528982a48f048f542a396c0c268cb7f5bddfc75654b5","abstract_canon_sha256":"3efc399d55b07c27dcbf72a8219b9c2d8ab77120b79f84d3f19ce5e09a761522"},"schema_version":"1.0"},"canonical_sha256":"7cff5a2c46300b684fd735ee5efb2a90dbda2f576fcf22131344979db12b44ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.441486Z","signature_b64":"mk2u6C9n8EBIXi0RsPVc1yD+ddrawpQhaD31r42jB67CULmvqxx4P2mh+4fqh5jAqMtAoXru00kTb64Xqp2WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cff5a2c46300b684fd735ee5efb2a90dbda2f576fcf22131344979db12b44ac","last_reissued_at":"2026-05-18T01:58:26.441049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.441049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01077","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMVCZx8j+ktvgrKdzJAvz6lOV0Ci+yOJ000VNOOfb+xHyKQ9IZkBM/MK6y5NmQ+ah7/lx8uNQB20yp8aaBJbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:59:47.616117Z"},"content_sha256":"ef5bbc20d74d4650273d12e40b9aaf7945230c7c7028bfc231efeb214600787f","schema_version":"1.0","event_id":"sha256:ef5bbc20d74d4650273d12e40b9aaf7945230c7c7028bfc231efeb214600787f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PT7VULCGGAFWQT6XGXXF56ZKSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On bicluster aggregation and its benefits for enumerative solutions","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fernando Jos\\'e Von Zuben, Rosana Veroneze, Saullo Haniell Galv\\~ao de Oliveira","submitted_at":"2015-06-02T22:26:42Z","abstract_excerpt":"Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this case, the solution composes a complete set of maximal and non-redundant biclusters. However, the ability to enumerate biclusters revealed a challenging scenario: in noisy datasets, each true bicluster may become highly fragmented and with a high degree of overlapping. It prevents a direct analysis of the obtained results. To revert the fragmentation, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01077","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0R78wBfNsZ+QcKBmncn4p4pkzpFaog4MhLNnPuMlGwtXAS3xDqAygchwZlz4VC4O3kNllmBWF3MKI+ArHpyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:59:47.616483Z"},"content_sha256":"af7f158e704ea1595996564c6775b80ced2c5732d6838bf82cfc765eb8d26bef","schema_version":"1.0","event_id":"sha256:af7f158e704ea1595996564c6775b80ced2c5732d6838bf82cfc765eb8d26bef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/bundle.json","state_url":"https://pith.science/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/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-25T23:59:47Z","links":{"resolver":"https://pith.science/pith/PT7VULCGGAFWQT6XGXXF56ZKSD","bundle":"https://pith.science/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/bundle.json","state":"https://pith.science/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT7VULCGGAFWQT6XGXXF56ZKSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PT7VULCGGAFWQT6XGXXF56ZKSD","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":"3efc399d55b07c27dcbf72a8219b9c2d8ab77120b79f84d3f19ce5e09a761522","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T22:26:42Z","title_canon_sha256":"366b02d125f2b42ae270528982a48f048f542a396c0c268cb7f5bddfc75654b5"},"schema_version":"1.0","source":{"id":"1506.01077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01077","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01077v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01077","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"PT7VULCGGAFW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PT7VULCGGAFWQT6X","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PT7VULCG","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:af7f158e704ea1595996564c6775b80ced2c5732d6838bf82cfc765eb8d26bef","target":"graph","created_at":"2026-05-18T01:58:26Z","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":"Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this case, the solution composes a complete set of maximal and non-redundant biclusters. However, the ability to enumerate biclusters revealed a challenging scenario: in noisy datasets, each true bicluster may become highly fragmented and with a high degree of overlapping. It prevents a direct analysis of the obtained results. To revert the fragmentation, we propose","authors_text":"Fernando Jos\\'e Von Zuben, Rosana Veroneze, Saullo Haniell Galv\\~ao de Oliveira","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T22:26:42Z","title":"On bicluster aggregation and its benefits for enumerative solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01077","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:ef5bbc20d74d4650273d12e40b9aaf7945230c7c7028bfc231efeb214600787f","target":"record","created_at":"2026-05-18T01:58:26Z","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":"3efc399d55b07c27dcbf72a8219b9c2d8ab77120b79f84d3f19ce5e09a761522","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T22:26:42Z","title_canon_sha256":"366b02d125f2b42ae270528982a48f048f542a396c0c268cb7f5bddfc75654b5"},"schema_version":"1.0","source":{"id":"1506.01077","kind":"arxiv","version":1}},"canonical_sha256":"7cff5a2c46300b684fd735ee5efb2a90dbda2f576fcf22131344979db12b44ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cff5a2c46300b684fd735ee5efb2a90dbda2f576fcf22131344979db12b44ac","first_computed_at":"2026-05-18T01:58:26.441049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:26.441049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mk2u6C9n8EBIXi0RsPVc1yD+ddrawpQhaD31r42jB67CULmvqxx4P2mh+4fqh5jAqMtAoXru00kTb64Xqp2WAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:26.441486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef5bbc20d74d4650273d12e40b9aaf7945230c7c7028bfc231efeb214600787f","sha256:af7f158e704ea1595996564c6775b80ced2c5732d6838bf82cfc765eb8d26bef"],"state_sha256":"93849010a5656fe81c9460a0d3b13d75dd081b382bcee789acd15e6b16f78558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8RLoAVUxfzu8sBtuW/MwIQ1kZO6CpF3txM+okWK9P8/YO/Gskz3uagdG2Aayq7U7KJU4Gyb6dd62AzFWNGfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:59:47.618445Z","bundle_sha256":"e7fe7c39e43ef93e98f7d616ad1a87d42b34f598e0d600f8b4a8b5e547bcb51b"}}