{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KY7QCRXAPJQIABQ26QKUKCCWAE","short_pith_number":"pith:KY7QCRXA","schema_version":"1.0","canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","source":{"kind":"arxiv","id":"1406.0017","version":1},"attestation_state":"computed","paper":{"title":"Biclique coverings, rectifier networks and the cost of $\\varepsilon$-removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"\\'Ad\\'am D\\'aniel Lelkes, Bal\\'azs Sz\\\"or\\'enyi, Gy\\\"orgy Tur\\'an, Judit Nagy-Gy\\\"orgy, Szabolcs Iv\\'an","submitted_at":"2014-05-30T21:17:39Z","abstract_excerpt":"We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $\\mathrm{Cov}(G)$ and the minimal rectifier network size $\\mathrm{Rect}(G)$ of a bipartite graph $G$. We show that there exist graphs with $\\mathrm{Cov}(G)\\geq \\mathrm{Rect}(G)^{3/2-\\epsilon}$. As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with $\\varepsilon$-transitions, having $n$ transitions total such that the smallest equivalent $\\varepsilon$-free NFA has $\\Omega(n^{3/2-\\epsilon})$ transitions. We also formulate a version of previous bounds for the weigh"},"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.0017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-30T21:17:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bec4cfadf0378f151d1b6c14bdafe0c15c500d2e1dcd6a8655ac7ece4e0b93f4","abstract_canon_sha256":"072faaa7d12cbdacbbcbd165cc208ec2d6fe9e2e458d40826ddb8801bdaf29bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:42.055465Z","signature_b64":"Zhmqjuh+Wkm/+eLza94eFaqrsE12uu4x7SLiAXBAZJklFXegH5c+BpQOXE9RGhJIOFW5l97dhWitC8g8IOzECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","last_reissued_at":"2026-05-18T02:50:42.054824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:42.054824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biclique coverings, rectifier networks and the cost of $\\varepsilon$-removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"\\'Ad\\'am D\\'aniel Lelkes, Bal\\'azs Sz\\\"or\\'enyi, Gy\\\"orgy Tur\\'an, Judit Nagy-Gy\\\"orgy, Szabolcs Iv\\'an","submitted_at":"2014-05-30T21:17:39Z","abstract_excerpt":"We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $\\mathrm{Cov}(G)$ and the minimal rectifier network size $\\mathrm{Rect}(G)$ of a bipartite graph $G$. We show that there exist graphs with $\\mathrm{Cov}(G)\\geq \\mathrm{Rect}(G)^{3/2-\\epsilon}$. As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with $\\varepsilon$-transitions, having $n$ transitions total such that the smallest equivalent $\\varepsilon$-free NFA has $\\Omega(n^{3/2-\\epsilon})$ transitions. We also formulate a version of previous bounds for the weigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0017","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":"1406.0017","created_at":"2026-05-18T02:50:42.054917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0017v1","created_at":"2026-05-18T02:50:42.054917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0017","created_at":"2026-05-18T02:50:42.054917+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY7QCRXAPJQI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY7QCRXAPJQIABQ2","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY7QCRXA","created_at":"2026-05-18T12:28:35.611951+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/KY7QCRXAPJQIABQ26QKUKCCWAE","json":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE.json","graph_json":"https://pith.science/api/pith-number/KY7QCRXAPJQIABQ26QKUKCCWAE/graph.json","events_json":"https://pith.science/api/pith-number/KY7QCRXAPJQIABQ26QKUKCCWAE/events.json","paper":"https://pith.science/paper/KY7QCRXA"},"agent_actions":{"view_html":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE","download_json":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE.json","view_paper":"https://pith.science/paper/KY7QCRXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0017&json=true","fetch_graph":"https://pith.science/api/pith-number/KY7QCRXAPJQIABQ26QKUKCCWAE/graph.json","fetch_events":"https://pith.science/api/pith-number/KY7QCRXAPJQIABQ26QKUKCCWAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/action/storage_attestation","attest_author":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/action/author_attestation","sign_citation":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/action/citation_signature","submit_replication":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/action/replication_record"}},"created_at":"2026-05-18T02:50:42.054917+00:00","updated_at":"2026-05-18T02:50:42.054917+00:00"}