{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A7IKYXIEKOSEIDR6TJWDU76ZAJ","short_pith_number":"pith:A7IKYXIE","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"},"canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","source":{"kind":"arxiv","id":"1406.3700","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3700","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3700v3","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3700","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"A7IKYXIEKOSE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7IKYXIEKOSEIDR6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7IKYXIE","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A7IKYXIEKOSEIDR6TJWDU76ZAJ","target":"record","payload":{"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"},"canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","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"},"source_kind":"arxiv","source_id":"1406.3700","source_version":3,"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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zz2G6GCnbURJlf7GgOh+E0klrNJ779E/xSCWZrlRQ4oASAedkZPTuT6nRreU0fxBX0RSQ518x8N12n8Ha3IxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:07:16.466799Z"},"content_sha256":"866a386bc7d1017b8a47640d704a825f51884ec3e63db7c7df5ae981a188769c","schema_version":"1.0","event_id":"sha256:866a386bc7d1017b8a47640d704a825f51884ec3e63db7c7df5ae981a188769c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A7IKYXIEKOSEIDR6TJWDU76ZAJ","target":"graph","payload":{"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"},"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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKJT5EdfOXsimh2MDKdJLA1/E4fACJmFCGtkCRuByS7+lyGNBnmnYGZkATgWvF1/a+QNFWZJgaHNDcJ8Zc2RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:07:16.467144Z"},"content_sha256":"649721b9518aee239de44db9e4bfd4cf04072c2d85926ca9bf5e3640ba62660a","schema_version":"1.0","event_id":"sha256:649721b9518aee239de44db9e4bfd4cf04072c2d85926ca9bf5e3640ba62660a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/bundle.json","state_url":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/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-06-02T17:07:16Z","links":{"resolver":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ","bundle":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/bundle.json","state":"https://pith.science/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7IKYXIEKOSEIDR6TJWDU76ZAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A7IKYXIEKOSEIDR6TJWDU76ZAJ","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":"07be77145b33a2208dc0c0f00de4a77fa6295b34b35c73572a1a19e061070558","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-14T08:20:39Z","title_canon_sha256":"bc29b3ad97530361f4d23e6ede0ccb43457fa64f367edf2947d34b9da23a4a98"},"schema_version":"1.0","source":{"id":"1406.3700","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3700","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3700v3","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3700","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"A7IKYXIEKOSE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7IKYXIEKOSEIDR6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7IKYXIE","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:649721b9518aee239de44db9e4bfd4cf04072c2d85926ca9bf5e3640ba62660a","target":"graph","created_at":"2026-05-17T23:43:54Z","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":"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","authors_text":"Bingkai Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-14T08:20:39Z","title":"The Parameterized Complexity of k-Biclique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3700","kind":"arxiv","version":3},"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:866a386bc7d1017b8a47640d704a825f51884ec3e63db7c7df5ae981a188769c","target":"record","created_at":"2026-05-17T23:43:54Z","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":"07be77145b33a2208dc0c0f00de4a77fa6295b34b35c73572a1a19e061070558","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-14T08:20:39Z","title_canon_sha256":"bc29b3ad97530361f4d23e6ede0ccb43457fa64f367edf2947d34b9da23a4a98"},"schema_version":"1.0","source":{"id":"1406.3700","kind":"arxiv","version":3}},"canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d0ac5d0453a4440e3e9a6c3a7fd902410448bc6654ffeaca55dec58ff391ce","first_computed_at":"2026-05-17T23:43:54.488286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.488286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I2k1fQXibgpR9BvWfkEp+TTEea9euuWkNAJuZoWoWoHEtRY1AzLx/xZnabaNSrSzzcHqdZsiIET3jSg2BomADw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.488995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3700","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:866a386bc7d1017b8a47640d704a825f51884ec3e63db7c7df5ae981a188769c","sha256:649721b9518aee239de44db9e4bfd4cf04072c2d85926ca9bf5e3640ba62660a"],"state_sha256":"106362a123c365c322f504983a889eee7cc31e9d1bf461e64edf95c350d4269e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kc/khj4yUuDl8XCHptAxVZFaZ+ImNvRAjKkU+te2GlMxL2TXitonIQ9h2jgFqPVXM1gATMASAMdazfP7+Dh2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:07:16.469204Z","bundle_sha256":"0532fd0c531c1759dc07822a005c42e9fd8365b09a97c0016bc26cf1b0128892"}}