{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U6XQKGOQXQEZ3RBJCAEPJF6C7Q","short_pith_number":"pith:U6XQKGOQ","canonical_record":{"source":{"id":"1403.3562","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-14T13:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"3f156306ad44a9d5ac63c7b002e54912f55407df584181e2bf353623264c5aaa","abstract_canon_sha256":"27db929c2fa74c25dc37df5cda0f2e0ba195539aa952b3a32ea12bec54d8f6f9"},"schema_version":"1.0"},"canonical_sha256":"a7af0519d0bc099dc4291008f497c2fc3ea2d2eb175d88c91000f4c8f8ba4e96","source":{"kind":"arxiv","id":"1403.3562","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3562","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3562v4","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3562","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"U6XQKGOQXQEZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6XQKGOQXQEZ3RBJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6XQKGOQ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U6XQKGOQXQEZ3RBJCAEPJF6C7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3562","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-14T13:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"3f156306ad44a9d5ac63c7b002e54912f55407df584181e2bf353623264c5aaa","abstract_canon_sha256":"27db929c2fa74c25dc37df5cda0f2e0ba195539aa952b3a32ea12bec54d8f6f9"},"schema_version":"1.0"},"canonical_sha256":"a7af0519d0bc099dc4291008f497c2fc3ea2d2eb175d88c91000f4c8f8ba4e96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:26.001479Z","signature_b64":"v0MeU+kFqVIoq+gyfahL4njeI3v/6ijmBxh5qyRDrbjZjkGTZEHs4g7tYzrBp3SuMsMZAut3XiMi1LWIoIk3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7af0519d0bc099dc4291008f497c2fc3ea2d2eb175d88c91000f4c8f8ba4e96","last_reissued_at":"2026-05-18T01:36:26.001079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:26.001079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3562","source_version":4,"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:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfpxYbIMAh2kSTYj3/hjAKq1AGW2FIb5xIV6LE03Xd/sqs/2DhMcXCIiSLpUGnpDsYKoOUXNvwvk23DQdPDrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:15:00.030871Z"},"content_sha256":"87980f425f70690c2d82f974e487e67b9b4b58a8136e369b52433af5cf0f69a9","schema_version":"1.0","event_id":"sha256:87980f425f70690c2d82f974e487e67b9b4b58a8136e369b52433af5cf0f69a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U6XQKGOQXQEZ3RBJCAEPJF6C7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating all maximal biclusters in numerical datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arindam Banerjee, Fernando J. Von Zuben, Rosana Veroneze","submitted_at":"2014-03-14T13:04:15Z","abstract_excerpt":"Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant values, or heuristic-based approaches which can not find all biclusters or even support the maximality of the obtained biclusters. Here, we present a general family of biclustering algorithms for enumerating all maximal biclusters with (i) constant values on rows, (ii) constant values on columns, or (iii) coherent values. Versions for perfect and for perturbed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3562","kind":"arxiv","version":4},"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:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atr7NkHlZlzguryzn6/7051KvgALaK+c5Ls/CgtlD1T3WCa/PSoutoh/WSskQUnOAc7wJ0FXZL4NzV2dy3vNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:15:00.031217Z"},"content_sha256":"54698beaef3c8f206795940eed89f779fc9c370c8a5c2c568fb1cba019ca6d6b","schema_version":"1.0","event_id":"sha256:54698beaef3c8f206795940eed89f779fc9c370c8a5c2c568fb1cba019ca6d6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/bundle.json","state_url":"https://pith.science/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/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-24T04:15:00Z","links":{"resolver":"https://pith.science/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q","bundle":"https://pith.science/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/bundle.json","state":"https://pith.science/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6XQKGOQXQEZ3RBJCAEPJF6C7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U6XQKGOQXQEZ3RBJCAEPJF6C7Q","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":"27db929c2fa74c25dc37df5cda0f2e0ba195539aa952b3a32ea12bec54d8f6f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-14T13:04:15Z","title_canon_sha256":"3f156306ad44a9d5ac63c7b002e54912f55407df584181e2bf353623264c5aaa"},"schema_version":"1.0","source":{"id":"1403.3562","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3562","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3562v4","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3562","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"U6XQKGOQXQEZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6XQKGOQXQEZ3RBJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6XQKGOQ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:54698beaef3c8f206795940eed89f779fc9c370c8a5c2c568fb1cba019ca6d6b","target":"graph","created_at":"2026-05-18T01:36: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 has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant values, or heuristic-based approaches which can not find all biclusters or even support the maximality of the obtained biclusters. Here, we present a general family of biclustering algorithms for enumerating all maximal biclusters with (i) constant values on rows, (ii) constant values on columns, or (iii) coherent values. Versions for perfect and for perturbed ","authors_text":"Arindam Banerjee, Fernando J. Von Zuben, Rosana Veroneze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-14T13:04:15Z","title":"Enumerating all maximal biclusters in numerical datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3562","kind":"arxiv","version":4},"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:87980f425f70690c2d82f974e487e67b9b4b58a8136e369b52433af5cf0f69a9","target":"record","created_at":"2026-05-18T01:36: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":"27db929c2fa74c25dc37df5cda0f2e0ba195539aa952b3a32ea12bec54d8f6f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-14T13:04:15Z","title_canon_sha256":"3f156306ad44a9d5ac63c7b002e54912f55407df584181e2bf353623264c5aaa"},"schema_version":"1.0","source":{"id":"1403.3562","kind":"arxiv","version":4}},"canonical_sha256":"a7af0519d0bc099dc4291008f497c2fc3ea2d2eb175d88c91000f4c8f8ba4e96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7af0519d0bc099dc4291008f497c2fc3ea2d2eb175d88c91000f4c8f8ba4e96","first_computed_at":"2026-05-18T01:36:26.001079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:26.001079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v0MeU+kFqVIoq+gyfahL4njeI3v/6ijmBxh5qyRDrbjZjkGTZEHs4g7tYzrBp3SuMsMZAut3XiMi1LWIoIk3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:26.001479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3562","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87980f425f70690c2d82f974e487e67b9b4b58a8136e369b52433af5cf0f69a9","sha256:54698beaef3c8f206795940eed89f779fc9c370c8a5c2c568fb1cba019ca6d6b"],"state_sha256":"fea49d5597b0b7aabf191a5d46ae397d12ba69071e4a361da1562664f0e195ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Mzf8XHX0XowUXqMGiNw1Iedjcoe0JWtoKFywhaM6jV6AN18Y2tEDf62+ibTDj1ChNnru9BLdIZ8SQ6/t3cACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:15:00.033574Z","bundle_sha256":"3d0a952ab1402751c28861a516d0fad5676b67eb3279d997d83a7c4faf576abe"}}