{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:JRQQZADWNXFT42I7QR5BKKRDTC","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":"cc2d24fb8d86d0f11a3950494a583d2bd00fde0e432bcd19d59201fbbbbc0fa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-08-08T21:06:24Z","title_canon_sha256":"a0abdb519e7eeef82adafb9fce74554307b74a6c57c28f39af69c3fc6a8a894c"},"schema_version":"1.0","source":{"id":"0708.1174","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.1174","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"0708.1174v4","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.1174","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"JRQQZADWNXFT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"JRQQZADWNXFT42I7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"JRQQZADW","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:31f0567a1e2b8076266c711f61463e92f6805461aa0fab6bf4f844d2320c9502","target":"graph","created_at":"2026-05-18T04:14:06Z","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":"The biclique covering number of a bipartite graph G is the minimum number of complete bipartite subgraphs (bicliques) whose union contains every edge of G.\n  In this little note we compare three lower bounds on the biclique covering number: A bound jk(G) proposed by Jukna & Kulikov (Discrete Math. 2009); the well-known fooling set bound fool(G); the \"tensor-power\" fooling set bound fool^\\infty(G). We show jk \\le fool le fool^\\infty \\le min_Q (rk Q)^2, where the minimum is taken over all matrices with a certain zero/nonzero-pattern. Only the first inequality is really novel, the third one gener","authors_text":"Dirk Oliver Theis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-08-08T21:06:24Z","title":"On some lower bounds on the number of bicliques needed to cover a bipartite graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.1174","kind":"arxiv","version":4},"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:2bda97c5e936ab3d621c5dad90b1ce48923dd81a22df1070959ee9130cc2fc6d","target":"record","created_at":"2026-05-18T04:14:06Z","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":"cc2d24fb8d86d0f11a3950494a583d2bd00fde0e432bcd19d59201fbbbbc0fa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-08-08T21:06:24Z","title_canon_sha256":"a0abdb519e7eeef82adafb9fce74554307b74a6c57c28f39af69c3fc6a8a894c"},"schema_version":"1.0","source":{"id":"0708.1174","kind":"arxiv","version":4}},"canonical_sha256":"4c610c80766dcb3e691f847a152a2398912a4b07bdcc2c0b4b3ee1b87414d440","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c610c80766dcb3e691f847a152a2398912a4b07bdcc2c0b4b3ee1b87414d440","first_computed_at":"2026-05-18T04:14:06.116515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:06.116515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsAUMtkd+xcBw36d189sXq8OzYlmYDvDoyI6NhzSepZJvFpqPKQPRJpD30KNOd0RU/9Krcasl0uua1/5Ozc/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:06.116897Z","signed_message":"canonical_sha256_bytes"},"source_id":"0708.1174","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bda97c5e936ab3d621c5dad90b1ce48923dd81a22df1070959ee9130cc2fc6d","sha256:31f0567a1e2b8076266c711f61463e92f6805461aa0fab6bf4f844d2320c9502"],"state_sha256":"00a7992ee2e10ae0ec29fb5db8e7948f01fdc57b452c31ad6b24eb3614d13e72"}