{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7NUWDCCGTFMWULPPGTQY3HZG5L","short_pith_number":"pith:7NUWDCCG","schema_version":"1.0","canonical_sha256":"fb6961884699596a2def34e18d9f26ead6c105c8dc1eb1707a43d87b1b755570","source":{"kind":"arxiv","id":"1111.3270","version":1},"attestation_state":"computed","paper":{"title":"Mining Biclusters of Similar Values with Triadic Concept Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.DS","authors_text":"Amedeo Napoli (INRIA Lorraine - LORIA), Juraj Macko, Mehdi Kaytoue (DCC - UFMG), Sergei O. Kuznetsov, Wagner Meira (DCC - UFMG)","submitted_at":"2011-11-14T16:22:33Z","abstract_excerpt":"Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclu"},"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":"1111.3270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-14T16:22:33Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"e0e6c1417261db74d46132719cbbf371936ec86dcf6994f2942cc7d765c0ccf2","abstract_canon_sha256":"969ec5c36868a6b47fff0620b66cbd773ee34fa152f9f3bb2b1c262188a1c8eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:22.670188Z","signature_b64":"Jz62xGdCQT0RcAbPRFZyMgv5jOpiSzUGdNcBYrv+9JXNqpSSiSNp9lMyyF4iNBOzZsTI6C+pPFKwgUNE0GH9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6961884699596a2def34e18d9f26ead6c105c8dc1eb1707a43d87b1b755570","last_reissued_at":"2026-05-18T04:08:22.669611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:22.669611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Biclusters of Similar Values with Triadic Concept Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.DS","authors_text":"Amedeo Napoli (INRIA Lorraine - LORIA), Juraj Macko, Mehdi Kaytoue (DCC - UFMG), Sergei O. Kuznetsov, Wagner Meira (DCC - UFMG)","submitted_at":"2011-11-14T16:22:33Z","abstract_excerpt":"Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3270","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":"1111.3270","created_at":"2026-05-18T04:08:22.669673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3270v1","created_at":"2026-05-18T04:08:22.669673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3270","created_at":"2026-05-18T04:08:22.669673+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NUWDCCGTFMW","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NUWDCCGTFMWULPP","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NUWDCCG","created_at":"2026-05-18T12:26:22.705136+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/7NUWDCCGTFMWULPPGTQY3HZG5L","json":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L.json","graph_json":"https://pith.science/api/pith-number/7NUWDCCGTFMWULPPGTQY3HZG5L/graph.json","events_json":"https://pith.science/api/pith-number/7NUWDCCGTFMWULPPGTQY3HZG5L/events.json","paper":"https://pith.science/paper/7NUWDCCG"},"agent_actions":{"view_html":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L","download_json":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L.json","view_paper":"https://pith.science/paper/7NUWDCCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3270&json=true","fetch_graph":"https://pith.science/api/pith-number/7NUWDCCGTFMWULPPGTQY3HZG5L/graph.json","fetch_events":"https://pith.science/api/pith-number/7NUWDCCGTFMWULPPGTQY3HZG5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L/action/storage_attestation","attest_author":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L/action/author_attestation","sign_citation":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L/action/citation_signature","submit_replication":"https://pith.science/pith/7NUWDCCGTFMWULPPGTQY3HZG5L/action/replication_record"}},"created_at":"2026-05-18T04:08:22.669673+00:00","updated_at":"2026-05-18T04:08:22.669673+00:00"}