{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FOJN2PC2UFPS5DA7LTDM7XPISN","short_pith_number":"pith:FOJN2PC2","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"},"canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","source":{"kind":"arxiv","id":"1507.08158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08158","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08158v1","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08158","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"FOJN2PC2UFPS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FOJN2PC2UFPS5DA7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FOJN2PC2","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FOJN2PC2UFPS5DA7LTDM7XPISN","target":"record","payload":{"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"},"canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","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"},"source_kind":"arxiv","source_id":"1507.08158","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-18T01:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz7bZRv2vEahHWsKQpATOruQ3mNFR/FbbVTTELaMa/LIt6G0KRD1XtO+k9FjQwmg4kIQcA1GpA1p8z5e+bFeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:52.816518Z"},"content_sha256":"8c95a3bbebc03339c08af704e97211c0737a7f8c77962668817e8930a44380e3","schema_version":"1.0","event_id":"sha256:8c95a3bbebc03339c08af704e97211c0737a7f8c77962668817e8930a44380e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FOJN2PC2UFPS5DA7LTDM7XPISN","target":"graph","payload":{"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"},"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-18T01:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeoYaJ9RuVVQGdifrppIRWefuLrH0NZEjD4cUdYpNKa8M7hKJ7Qk3t7Z6fRi6qhfVuHNS7MTKr4zaUkFS0MTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:52.816875Z"},"content_sha256":"808eb017c8ad5cd00f2693372b0bd935034f4d5cf254968fbda00e5dcf98e37b","schema_version":"1.0","event_id":"sha256:808eb017c8ad5cd00f2693372b0bd935034f4d5cf254968fbda00e5dcf98e37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/bundle.json","state_url":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/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-27T01:12:52Z","links":{"resolver":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN","bundle":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/bundle.json","state":"https://pith.science/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOJN2PC2UFPS5DA7LTDM7XPISN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FOJN2PC2UFPS5DA7LTDM7XPISN","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":"169ce188c119610de9ddb3a6232cb31b4c7f07c019b802419d7204770dd5759c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-07-29T14:31:41Z","title_canon_sha256":"e14f09459b401486a7531844bf3f2c78b1089d4629d52ed5587d3a54c2230a61"},"schema_version":"1.0","source":{"id":"1507.08158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08158","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08158v1","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08158","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"FOJN2PC2UFPS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FOJN2PC2UFPS5DA7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FOJN2PC2","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:808eb017c8ad5cd00f2693372b0bd935034f4d5cf254968fbda00e5dcf98e37b","target":"graph","created_at":"2026-05-18T01:36:08Z","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":"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","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Somnath Sikdar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-07-29T14:31:41Z","title":"Fast Biclustering by Dual Parameterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08158","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:8c95a3bbebc03339c08af704e97211c0737a7f8c77962668817e8930a44380e3","target":"record","created_at":"2026-05-18T01:36:08Z","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":"169ce188c119610de9ddb3a6232cb31b4c7f07c019b802419d7204770dd5759c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-07-29T14:31:41Z","title_canon_sha256":"e14f09459b401486a7531844bf3f2c78b1089d4629d52ed5587d3a54c2230a61"},"schema_version":"1.0","source":{"id":"1507.08158","kind":"arxiv","version":1}},"canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b92dd3c5aa15f2e8c1f5cc6cfdde8936ffb6e66763ecfe686367e186dade847","first_computed_at":"2026-05-18T01:36:08.210857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:08.210857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRJBIMPC+6qzxSoGUV0H5MkdMhR1SgxPGylnKdBdEiCZ9VA29k42tZSLyaW7xQHXRwvaS5SNmLj1D4uUjuRUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:08.211642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c95a3bbebc03339c08af704e97211c0737a7f8c77962668817e8930a44380e3","sha256:808eb017c8ad5cd00f2693372b0bd935034f4d5cf254968fbda00e5dcf98e37b"],"state_sha256":"52c5ea3bf2c4a8635d917f3b993cfb54abe519739333869ec2814593fa21baba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGa+nmRRiHuf7GHknxwz0q1kx18qoQR+y5v2ScGc0SqQ9snzkXKGDhpNPJt7g+u7u6gstvatXJXV8MsodDMtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:12:52.819233Z","bundle_sha256":"09001002fa7b4e0b4b3845efeb2b31e5f5caf997f1a27f7919f0af339ed9ab20"}}