{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EAOOB5VWIN3FYGCFKLBTG5QISZ","short_pith_number":"pith:EAOOB5VW","canonical_record":{"source":{"id":"1709.08461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-25T12:54:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e44c55c8f589488376e6071aa48c8b6376fab8fabbe31d89e07c2f495f9e22c4","abstract_canon_sha256":"6bc6131c6e3a9de98e02face7278f69206bfcfc24d301b246ebdd9f8836178e1"},"schema_version":"1.0"},"canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","source":{"kind":"arxiv","id":"1709.08461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08461","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08461v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08461","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"EAOOB5VWIN3F","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EAOOB5VWIN3FYGCF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EAOOB5VW","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EAOOB5VWIN3FYGCFKLBTG5QISZ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-25T12:54:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e44c55c8f589488376e6071aa48c8b6376fab8fabbe31d89e07c2f495f9e22c4","abstract_canon_sha256":"6bc6131c6e3a9de98e02face7278f69206bfcfc24d301b246ebdd9f8836178e1"},"schema_version":"1.0"},"canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:25.566915Z","signature_b64":"ba8GDjxVWyN5ykXDZ18flDKewDo6KSa+A9kLzhk4wJMfgvsaiFnj8AVx3i3hgSSA3acD+GU3tRu6dy3wEFHwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","last_reissued_at":"2026-05-18T00:34:25.566149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:25.566149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08461","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:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsvId0X70UXCXnJdwhqoqxIWLq18l0pi5RZd7oip3+kI8sq5MF8O1+lOBbNRjMJZVzi7cCijlCyXDacPGWpeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:46:20.247623Z"},"content_sha256":"b66943fc3b255560ab3544fd6354a6a515d0dbc1e894b327d8851c719b9558d4","schema_version":"1.0","event_id":"sha256:b66943fc3b255560ab3544fd6354a6a515d0dbc1e894b327d8851c719b9558d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EAOOB5VWIN3FYGCFKLBTG5QISZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining a Sub-Matrix of Maximal Sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"stat.ML","authors_text":"Pierre Dupont, Pierre Schaus, Vincent Branders","submitted_at":"2017-09-25T12:54:17Z","abstract_excerpt":"Biclustering techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients. Mining a max-sum sub-matrix is a related but distinct problem for which one looks for a (non-necessarily contiguous) rectangular sub-matrix with a maximal sum of its entries. Le Van et al. (Ranked Tiling, 2014) already illustrated its applicability to gene expression analysis and addressed it with a constraint programming (CP) approach combined with large neighborhood search (CP-LNS). In this work, we exhibit some k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08461","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:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLle8keOxl0HuarqFmyC3mszFtkHM2QEl342AhZufpVESJ4UBV1IGC1t8UT5k8YICLzJ1fgoxMxx94vurDdyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:46:20.247994Z"},"content_sha256":"4c7c24f6152f36626665c5ab4a17141af37992b69227107d123c743f11bee052","schema_version":"1.0","event_id":"sha256:4c7c24f6152f36626665c5ab4a17141af37992b69227107d123c743f11bee052"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/bundle.json","state_url":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/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-28T15:46:20Z","links":{"resolver":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ","bundle":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/bundle.json","state":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EAOOB5VWIN3FYGCFKLBTG5QISZ","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":"6bc6131c6e3a9de98e02face7278f69206bfcfc24d301b246ebdd9f8836178e1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-25T12:54:17Z","title_canon_sha256":"e44c55c8f589488376e6071aa48c8b6376fab8fabbe31d89e07c2f495f9e22c4"},"schema_version":"1.0","source":{"id":"1709.08461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08461","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08461v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08461","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"EAOOB5VWIN3F","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EAOOB5VWIN3FYGCF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EAOOB5VW","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:4c7c24f6152f36626665c5ab4a17141af37992b69227107d123c743f11bee052","target":"graph","created_at":"2026-05-18T00:34:25Z","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 techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients. Mining a max-sum sub-matrix is a related but distinct problem for which one looks for a (non-necessarily contiguous) rectangular sub-matrix with a maximal sum of its entries. Le Van et al. (Ranked Tiling, 2014) already illustrated its applicability to gene expression analysis and addressed it with a constraint programming (CP) approach combined with large neighborhood search (CP-LNS). In this work, we exhibit some k","authors_text":"Pierre Dupont, Pierre Schaus, Vincent Branders","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-25T12:54:17Z","title":"Mining a Sub-Matrix of Maximal Sum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08461","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:b66943fc3b255560ab3544fd6354a6a515d0dbc1e894b327d8851c719b9558d4","target":"record","created_at":"2026-05-18T00:34:25Z","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":"6bc6131c6e3a9de98e02face7278f69206bfcfc24d301b246ebdd9f8836178e1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-25T12:54:17Z","title_canon_sha256":"e44c55c8f589488376e6071aa48c8b6376fab8fabbe31d89e07c2f495f9e22c4"},"schema_version":"1.0","source":{"id":"1709.08461","kind":"arxiv","version":1}},"canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","first_computed_at":"2026-05-18T00:34:25.566149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:25.566149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ba8GDjxVWyN5ykXDZ18flDKewDo6KSa+A9kLzhk4wJMfgvsaiFnj8AVx3i3hgSSA3acD+GU3tRu6dy3wEFHwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:25.566915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66943fc3b255560ab3544fd6354a6a515d0dbc1e894b327d8851c719b9558d4","sha256:4c7c24f6152f36626665c5ab4a17141af37992b69227107d123c743f11bee052"],"state_sha256":"97e6bc3c749cbed403b235e374eaf7de0267af5545d605e4a07e77ba2ee8acc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkcxXwgLvs9wXPU1a4nLPHYq0tK2wSLk2zgOFjPF5KbTjZ5RvzoWa6VlrZum7rpDJWQhSR30Vq8YRH5YmRs+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:46:20.250626Z","bundle_sha256":"68e5dc3cf39417e1bbf5e94d5ae08a3c228b2f246e8e34572c20529d0419881f"}}