{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R47PMX7BLH5OMHRCNU4VSZ2Z5V","short_pith_number":"pith:R47PMX7B","canonical_record":{"source":{"id":"1809.05077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-13T17:37:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c5c41c50249bb197eb95b90b2f460840c334dea4320ba573c995f5b251c41bb","abstract_canon_sha256":"2598ebf391bdbf1db45f6d90d4450085a754a0d40f9b6384a1033989a5ab049a"},"schema_version":"1.0"},"canonical_sha256":"8f3ef65fe159fae61e226d39596759ed6cc6ea7a59dc911978fe434cb2ba1f46","source":{"kind":"arxiv","id":"1809.05077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05077","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05077v2","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05077","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"R47PMX7BLH5O","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R47PMX7BLH5OMHRC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R47PMX7B","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R47PMX7BLH5OMHRCNU4VSZ2Z5V","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-13T17:37:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c5c41c50249bb197eb95b90b2f460840c334dea4320ba573c995f5b251c41bb","abstract_canon_sha256":"2598ebf391bdbf1db45f6d90d4450085a754a0d40f9b6384a1033989a5ab049a"},"schema_version":"1.0"},"canonical_sha256":"8f3ef65fe159fae61e226d39596759ed6cc6ea7a59dc911978fe434cb2ba1f46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:18.880378Z","signature_b64":"dz22BKJ9DCODx4IWOhnwRU/Sfruk/pty/lAOUePDorgmdLnk3NhtIUaKPAhXN0gl/huJT+5hdV4MD47AW1txAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f3ef65fe159fae61e226d39596759ed6cc6ea7a59dc911978fe434cb2ba1f46","last_reissued_at":"2026-05-18T00:05:18.879724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:18.879724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05077","source_version":2,"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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7ay9hlDoQjUHBMwjM8OgjeETk0w9VYg9oPCx27py9wclaMOX7gca9lY13bANyOom0bmm6+m4T3rnuKrHnw9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:03:44.462069Z"},"content_sha256":"55627d9eea8e22f60aecd1fc1678c014227d32750081201af87af311e7ef0208","schema_version":"1.0","event_id":"sha256:55627d9eea8e22f60aecd1fc1678c014227d32750081201af87af311e7ef0208"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R47PMX7BLH5OMHRCNU4VSZ2Z5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MSc Dissertation: Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amichai Painsky","submitted_at":"2018-09-13T17:37:16Z","abstract_excerpt":"The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row biclustering problem for gene expression data sets, in which each row can only be a member of a single bicluster while columns can participate in multiple ones. This type of biclustering may be adequate, for example, for clustering groups of cancer patients where each patient (row) i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05077","kind":"arxiv","version":2},"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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9VP65+1tkn612hWCoQYS7BKdLOgDTELDTw0u/g8CtR4GLelwvszaCdUhlK4tzwFKclBw/Y1N6gWvQiblSAWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:03:44.462745Z"},"content_sha256":"06190cd91b284e8f2726cba15a0880b797e7a28eff8ecb15f21bd92a4d18f4e8","schema_version":"1.0","event_id":"sha256:06190cd91b284e8f2726cba15a0880b797e7a28eff8ecb15f21bd92a4d18f4e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/bundle.json","state_url":"https://pith.science/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/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-05-31T19:03:44Z","links":{"resolver":"https://pith.science/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V","bundle":"https://pith.science/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/bundle.json","state":"https://pith.science/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R47PMX7BLH5OMHRCNU4VSZ2Z5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R47PMX7BLH5OMHRCNU4VSZ2Z5V","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":"2598ebf391bdbf1db45f6d90d4450085a754a0d40f9b6384a1033989a5ab049a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-13T17:37:16Z","title_canon_sha256":"8c5c41c50249bb197eb95b90b2f460840c334dea4320ba573c995f5b251c41bb"},"schema_version":"1.0","source":{"id":"1809.05077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05077","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05077v2","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05077","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"R47PMX7BLH5O","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R47PMX7BLH5OMHRC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R47PMX7B","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:06190cd91b284e8f2726cba15a0880b797e7a28eff8ecb15f21bd92a4d18f4e8","target":"graph","created_at":"2026-05-18T00:05:18Z","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":"The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row biclustering problem for gene expression data sets, in which each row can only be a member of a single bicluster while columns can participate in multiple ones. This type of biclustering may be adequate, for example, for clustering groups of cancer patients where each patient (row) i","authors_text":"Amichai Painsky","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-13T17:37:16Z","title":"MSc Dissertation: Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05077","kind":"arxiv","version":2},"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:55627d9eea8e22f60aecd1fc1678c014227d32750081201af87af311e7ef0208","target":"record","created_at":"2026-05-18T00:05:18Z","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":"2598ebf391bdbf1db45f6d90d4450085a754a0d40f9b6384a1033989a5ab049a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-13T17:37:16Z","title_canon_sha256":"8c5c41c50249bb197eb95b90b2f460840c334dea4320ba573c995f5b251c41bb"},"schema_version":"1.0","source":{"id":"1809.05077","kind":"arxiv","version":2}},"canonical_sha256":"8f3ef65fe159fae61e226d39596759ed6cc6ea7a59dc911978fe434cb2ba1f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f3ef65fe159fae61e226d39596759ed6cc6ea7a59dc911978fe434cb2ba1f46","first_computed_at":"2026-05-18T00:05:18.879724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:18.879724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dz22BKJ9DCODx4IWOhnwRU/Sfruk/pty/lAOUePDorgmdLnk3NhtIUaKPAhXN0gl/huJT+5hdV4MD47AW1txAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:18.880378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55627d9eea8e22f60aecd1fc1678c014227d32750081201af87af311e7ef0208","sha256:06190cd91b284e8f2726cba15a0880b797e7a28eff8ecb15f21bd92a4d18f4e8"],"state_sha256":"a1fcbcb3042782262a3498361c4ddc88acf6165ff3bcb414f2c2aed2b59a40e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yr5dz4Cjz9G/IB1KlzroXQuIOk7ksPqLh/eNIaV486n+TZwi+vFOhR+Rv6yEjWAqUq+CKN5BKr1LmCoBivc0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:03:44.466407Z","bundle_sha256":"38af1f8dc33bc3772074f2a1157c3cfa1ccd5e0694f99861e910468766089718"}}