{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R46K2MYMGTZH3VMRE3LFXBARKH","short_pith_number":"pith:R46K2MYM","schema_version":"1.0","canonical_sha256":"8f3cad330c34f27dd59126d65b841151d9edd799c106b8d740522c48f7eb64d2","source":{"kind":"arxiv","id":"1604.01560","version":2},"attestation_state":"computed","paper":{"title":"Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Igor Razgon, Oded Lachish","submitted_at":"2016-04-06T09:43:16Z","abstract_excerpt":"In this paper we establish an exponential lower bound on the size of syntactic non-deterministic read $d$-times branching programs for $d \\leq \\log n /10^5$ computing a class of monotone CNFs with a linear number of clauses. This result provides the first separation of classes NP and co-NP for syntactic branching programs with a logarithmic repetition and the first separation of syntactic non-deterministic branching programs with a logarithmic repetition from small monotone CNFs."},"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":"1604.01560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-06T09:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"98fca48257427549047a9bb1bb5c9ed75c02c9f07aa7f419d9acdf055507cf32","abstract_canon_sha256":"3af53cef7e96ad138e5bfa611d72ea16527d6973c7e5d336e4d65263b858abeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:32.210279Z","signature_b64":"YULvsu7ooa6nHK53a/VcZ2Fow1hmQUshSOUf26HaCIpWCSSis6ovgLKoLPiFixNij77b6QrKysMv4LTZXHASAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f3cad330c34f27dd59126d65b841151d9edd799c106b8d740522c48f7eb64d2","last_reissued_at":"2026-05-18T01:17:32.209640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:32.209640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Igor Razgon, Oded Lachish","submitted_at":"2016-04-06T09:43:16Z","abstract_excerpt":"In this paper we establish an exponential lower bound on the size of syntactic non-deterministic read $d$-times branching programs for $d \\leq \\log n /10^5$ computing a class of monotone CNFs with a linear number of clauses. This result provides the first separation of classes NP and co-NP for syntactic branching programs with a logarithmic repetition and the first separation of syntactic non-deterministic branching programs with a logarithmic repetition from small monotone CNFs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01560","kind":"arxiv","version":2},"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":"1604.01560","created_at":"2026-05-18T01:17:32.209732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01560v2","created_at":"2026-05-18T01:17:32.209732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01560","created_at":"2026-05-18T01:17:32.209732+00:00"},{"alias_kind":"pith_short_12","alias_value":"R46K2MYMGTZH","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R46K2MYMGTZH3VMR","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R46K2MYM","created_at":"2026-05-18T12:30:41.710351+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/R46K2MYMGTZH3VMRE3LFXBARKH","json":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH.json","graph_json":"https://pith.science/api/pith-number/R46K2MYMGTZH3VMRE3LFXBARKH/graph.json","events_json":"https://pith.science/api/pith-number/R46K2MYMGTZH3VMRE3LFXBARKH/events.json","paper":"https://pith.science/paper/R46K2MYM"},"agent_actions":{"view_html":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH","download_json":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH.json","view_paper":"https://pith.science/paper/R46K2MYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01560&json=true","fetch_graph":"https://pith.science/api/pith-number/R46K2MYMGTZH3VMRE3LFXBARKH/graph.json","fetch_events":"https://pith.science/api/pith-number/R46K2MYMGTZH3VMRE3LFXBARKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH/action/storage_attestation","attest_author":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH/action/author_attestation","sign_citation":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH/action/citation_signature","submit_replication":"https://pith.science/pith/R46K2MYMGTZH3VMRE3LFXBARKH/action/replication_record"}},"created_at":"2026-05-18T01:17:32.209732+00:00","updated_at":"2026-05-18T01:17:32.209732+00:00"}