{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KY7QCRXAPJQIABQ26QKUKCCWAE","short_pith_number":"pith:KY7QCRXA","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"},"canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","source":{"kind":"arxiv","id":"1406.0017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0017","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0017v1","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0017","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"KY7QCRXAPJQI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KY7QCRXAPJQIABQ2","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KY7QCRXA","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KY7QCRXAPJQIABQ26QKUKCCWAE","target":"record","payload":{"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"},"canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","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"},"source_kind":"arxiv","source_id":"1406.0017","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-18T02:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/k1I+zn3WlPfuZ7cjOkRdWl4sdPsUFCC2qEgkAFg0jKtgxwJtn1PiLH7/S70zsBnjnWLqs1njL8mv9dNHayAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:41:42.147338Z"},"content_sha256":"7cee0ba096b9dc6a7470606d9d40ae10577d02799c52298774d4119bb14f8e59","schema_version":"1.0","event_id":"sha256:7cee0ba096b9dc6a7470606d9d40ae10577d02799c52298774d4119bb14f8e59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KY7QCRXAPJQIABQ26QKUKCCWAE","target":"graph","payload":{"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"},"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-18T02:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOy0j+ARfMAVn11Gl9lnImNbuK7pznxoCi+ZJQ+qhqPoqKd+O2S/Cc+8V9CTCZMUSm1LyhUFc9uQ2rSZNCxPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:41:42.148040Z"},"content_sha256":"ef0a87467c5ae36a24bd72c0c99014c096ee4330602143c744ebacf33f5cbf6c","schema_version":"1.0","event_id":"sha256:ef0a87467c5ae36a24bd72c0c99014c096ee4330602143c744ebacf33f5cbf6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/bundle.json","state_url":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/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-09T06:41:42Z","links":{"resolver":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE","bundle":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/bundle.json","state":"https://pith.science/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KY7QCRXAPJQIABQ26QKUKCCWAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KY7QCRXAPJQIABQ26QKUKCCWAE","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":"072faaa7d12cbdacbbcbd165cc208ec2d6fe9e2e458d40826ddb8801bdaf29bd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-30T21:17:39Z","title_canon_sha256":"bec4cfadf0378f151d1b6c14bdafe0c15c500d2e1dcd6a8655ac7ece4e0b93f4"},"schema_version":"1.0","source":{"id":"1406.0017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0017","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0017v1","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0017","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"KY7QCRXAPJQI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KY7QCRXAPJQIABQ2","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KY7QCRXA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:ef0a87467c5ae36a24bd72c0c99014c096ee4330602143c744ebacf33f5cbf6c","target":"graph","created_at":"2026-05-18T02:50:42Z","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 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","authors_text":"\\'Ad\\'am D\\'aniel Lelkes, Bal\\'azs Sz\\\"or\\'enyi, Gy\\\"orgy Tur\\'an, Judit Nagy-Gy\\\"orgy, Szabolcs Iv\\'an","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-30T21:17:39Z","title":"Biclique coverings, rectifier networks and the cost of $\\varepsilon$-removal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0017","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:7cee0ba096b9dc6a7470606d9d40ae10577d02799c52298774d4119bb14f8e59","target":"record","created_at":"2026-05-18T02:50:42Z","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":"072faaa7d12cbdacbbcbd165cc208ec2d6fe9e2e458d40826ddb8801bdaf29bd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-30T21:17:39Z","title_canon_sha256":"bec4cfadf0378f151d1b6c14bdafe0c15c500d2e1dcd6a8655ac7ece4e0b93f4"},"schema_version":"1.0","source":{"id":"1406.0017","kind":"arxiv","version":1}},"canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"563f0146e07a6080061af415450856013ac0006282b5f7354d698917573a49e3","first_computed_at":"2026-05-18T02:50:42.054824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:42.054824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zhmqjuh+Wkm/+eLza94eFaqrsE12uu4x7SLiAXBAZJklFXegH5c+BpQOXE9RGhJIOFW5l97dhWitC8g8IOzECg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:42.055465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cee0ba096b9dc6a7470606d9d40ae10577d02799c52298774d4119bb14f8e59","sha256:ef0a87467c5ae36a24bd72c0c99014c096ee4330602143c744ebacf33f5cbf6c"],"state_sha256":"47240acf54d052d0cfb8c6a8d796943ac91de1b39660d0d07596eda356f7f054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKqKb67cUvRsqh8PO5Rm66WBtzYKY/YmHqz8Xjk37T+ahykEpUlNiD4ii3IQU5pRvF3hJTEIC02qWvjNTsUtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:41:42.153415Z","bundle_sha256":"ebb8524573a3b5450021fd6d738684d55e8ef401c96043ce467521126d5b6e27"}}