{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FOJN2PC2UFPS5DA7LTDM7XPISN","short_pith_number":"pith:FOJN2PC2","schema_version":"1.0","canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","source":{"kind":"arxiv","id":"1507.08158","version":1},"attestation_state":"computed","paper":{"title":"Fast Biclustering by Dual Parameterization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Somnath Sikdar","submitted_at":"2015-07-29T14:31:41Z","abstract_excerpt":"We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none of the problems can be solved in subexponential time unless the exponential time hypothesis fails.\n  Misra, Panolan, and Saurabh (MFCS 2013) argue that introducing a bound on the number of connected components in the solution should not make the problem easier: In particular, they argue that the subexponential time algorithm for editing to a fixed number of clusters (p-Clust"},"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":"1507.08158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-07-29T14:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"e14f09459b401486a7531844bf3f2c78b1089d4629d52ed5587d3a54c2230a61","abstract_canon_sha256":"169ce188c119610de9ddb3a6232cb31b4c7f07c019b802419d7204770dd5759c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:08.211642Z","signature_b64":"cRJBIMPC+6qzxSoGUV0H5MkdMhR1SgxPGylnKdBdEiCZ9VA29k42tZSLyaW7xQHXRwvaS5SNmLj1D4uUjuRUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","last_reissued_at":"2026-05-18T01:36:08.210857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:08.210857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Biclustering by Dual Parameterization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Somnath Sikdar","submitted_at":"2015-07-29T14:31:41Z","abstract_excerpt":"We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none of the problems can be solved in subexponential time unless the exponential time hypothesis fails.\n  Misra, Panolan, and Saurabh (MFCS 2013) argue that introducing a bound on the number of connected components in the solution should not make the problem easier: In particular, they argue that the subexponential time algorithm for editing to a fixed number of clusters (p-Clust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08158","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":"1507.08158","created_at":"2026-05-18T01:36:08.210976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08158v1","created_at":"2026-05-18T01:36:08.210976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08158","created_at":"2026-05-18T01:36:08.210976+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOJN2PC2UFPS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOJN2PC2UFPS5DA7","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOJN2PC2","created_at":"2026-05-18T12:29:19.899920+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/FOJN2PC2UFPS5DA7LTDM7XPISN","json":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN.json","graph_json":"https://pith.science/api/pith-number/FOJN2PC2UFPS5DA7LTDM7XPISN/graph.json","events_json":"https://pith.science/api/pith-number/FOJN2PC2UFPS5DA7LTDM7XPISN/events.json","paper":"https://pith.science/paper/FOJN2PC2"},"agent_actions":{"view_html":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN","download_json":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN.json","view_paper":"https://pith.science/paper/FOJN2PC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08158&json=true","fetch_graph":"https://pith.science/api/pith-number/FOJN2PC2UFPS5DA7LTDM7XPISN/graph.json","fetch_events":"https://pith.science/api/pith-number/FOJN2PC2UFPS5DA7LTDM7XPISN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/action/storage_attestation","attest_author":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/action/author_attestation","sign_citation":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/action/citation_signature","submit_replication":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/action/replication_record"}},"created_at":"2026-05-18T01:36:08.210976+00:00","updated_at":"2026-05-18T01:36:08.210976+00:00"}