{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EAOOB5VWIN3FYGCFKLBTG5QISZ","short_pith_number":"pith:EAOOB5VW","schema_version":"1.0","canonical_sha256":"201ce0f6b643765c184552c33376089658e105cae1072eb19d63ba9dd618f50f","source":{"kind":"arxiv","id":"1709.08461","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.08461","created_at":"2026-05-18T00:34:25.566207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08461v1","created_at":"2026-05-18T00:34:25.566207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08461","created_at":"2026-05-18T00:34:25.566207+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAOOB5VWIN3F","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAOOB5VWIN3FYGCF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAOOB5VW","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ","json":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ.json","graph_json":"https://pith.science/api/pith-number/EAOOB5VWIN3FYGCFKLBTG5QISZ/graph.json","events_json":"https://pith.science/api/pith-number/EAOOB5VWIN3FYGCFKLBTG5QISZ/events.json","paper":"https://pith.science/paper/EAOOB5VW"},"agent_actions":{"view_html":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ","download_json":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ.json","view_paper":"https://pith.science/paper/EAOOB5VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08461&json=true","fetch_graph":"https://pith.science/api/pith-number/EAOOB5VWIN3FYGCFKLBTG5QISZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EAOOB5VWIN3FYGCFKLBTG5QISZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/action/storage_attestation","attest_author":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/action/author_attestation","sign_citation":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/action/citation_signature","submit_replication":"https://pith.science/pith/EAOOB5VWIN3FYGCFKLBTG5QISZ/action/replication_record"}},"created_at":"2026-05-18T00:34:25.566207+00:00","updated_at":"2026-05-18T00:34:25.566207+00:00"}