{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A7IKYXIEKOSEIDR6TJWDU76ZAJ","short_pith_number":"pith:A7IKYXIE","schema_version":"1.0","canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","source":{"kind":"arxiv","id":"1406.3700","version":3},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of k-Biclique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin","submitted_at":"2014-06-14T08:20:39Z","abstract_excerpt":"Given a graph $G$ and a parameter $k$, the $k$-biclique problem asks whether $G$ contains a complete bipartite subgraph $K_{k,k}$. This is the most easily stated problem on graphs whose parameterized complexity is still unknown. We provide an fpt-reduction from $k$-clique to $k$-biclique, thus solving this longstanding open problem.\n  Our reduction use a class of bipartite graphs with a threshold property of independent interest. More specifically, for positive integers $n$, $s$ and $t$, we consider a bipartite graph $G=(A\\;\\dot\\cup\\;B, E)$ such that $A$ can be partitioned into $A=V_1\\;\\dot\\cu"},"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":"1406.3700","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-14T08:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"bc29b3ad97530361f4d23e6ede0ccb43457fa64f367edf2947d34b9da23a4a98","abstract_canon_sha256":"07be77145b33a2208dc0c0f00de4a77fa6295b34b35c73572a1a19e061070558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.488995Z","signature_b64":"I2k1fQXibgpR9BvWfkEp+TTEea9euuWkNAJuZoWoWoHEtRY1AzLx/xZnabaNSrSzzcHqdZsiIET3jSg2BomADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","last_reissued_at":"2026-05-17T23:43:54.488286Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.488286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of k-Biclique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin","submitted_at":"2014-06-14T08:20:39Z","abstract_excerpt":"Given a graph $G$ and a parameter $k$, the $k$-biclique problem asks whether $G$ contains a complete bipartite subgraph $K_{k,k}$. This is the most easily stated problem on graphs whose parameterized complexity is still unknown. We provide an fpt-reduction from $k$-clique to $k$-biclique, thus solving this longstanding open problem.\n  Our reduction use a class of bipartite graphs with a threshold property of independent interest. More specifically, for positive integers $n$, $s$ and $t$, we consider a bipartite graph $G=(A\\;\\dot\\cup\\;B, E)$ such that $A$ can be partitioned into $A=V_1\\;\\dot\\cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3700","kind":"arxiv","version":3},"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":"1406.3700","created_at":"2026-05-17T23:43:54.488402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3700v3","created_at":"2026-05-17T23:43:54.488402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3700","created_at":"2026-05-17T23:43:54.488402+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7IKYXIEKOSE","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7IKYXIEKOSEIDR6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7IKYXIE","created_at":"2026-05-18T12:28:19.803747+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/A7IKYXIEKOSEIDR6TJWDU76ZAJ","json":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ.json","graph_json":"https://pith.science/api/pith-number/A7IKYXIEKOSEIDR6TJWDU76ZAJ/graph.json","events_json":"https://pith.science/api/pith-number/A7IKYXIEKOSEIDR6TJWDU76ZAJ/events.json","paper":"https://pith.science/paper/A7IKYXIE"},"agent_actions":{"view_html":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ","download_json":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ.json","view_paper":"https://pith.science/paper/A7IKYXIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3700&json=true","fetch_graph":"https://pith.science/api/pith-number/A7IKYXIEKOSEIDR6TJWDU76ZAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/A7IKYXIEKOSEIDR6TJWDU76ZAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/action/storage_attestation","attest_author":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/action/author_attestation","sign_citation":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/action/citation_signature","submit_replication":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/action/replication_record"}},"created_at":"2026-05-17T23:43:54.488402+00:00","updated_at":"2026-05-17T23:43:54.488402+00:00"}