{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5OUV7DVAJFO65KTDW5RHXBMWS5","short_pith_number":"pith:5OUV7DVA","schema_version":"1.0","canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","source":{"kind":"arxiv","id":"1512.03607","version":1},"attestation_state":"computed","paper":{"title":"Limitations of sum of products of Read-Once Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"B.V. Raghavendra Rao, C. Ramya","submitted_at":"2015-12-11T11:43:49Z","abstract_excerpt":"We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas.\n  We prove an exponential lower bound for the size of the $\\Sigma\\Pi^{[N^{1/30}]}$ arithmetic circuits built over syntactically multi-linear $\\Sigma\\Pi\\Sigma^{[N^{8/15}]}$ arithmetic circuits computing a product of variable disjoint linear forms on $N$ variables. We extend the result to the case of $\\Sigma\\Pi^{[N^{1/30}]}$ arithmetic circuits built over ROPs of unbounded depth, where the number of variables with $+$ gates as a parent in"},"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":"1512.03607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T11:43:49Z","cross_cats_sorted":[],"title_canon_sha256":"158a1e47200ebdc03a579df696145d5c9e848e0d690ba4a76278ef3940d13624","abstract_canon_sha256":"faa9f864c61ee93a6fdf20d439fd1b29e4266ffa9b4c3153881104b70a67d53a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:31.926069Z","signature_b64":"Y5wyweOZHslH/YuWZnKvUs4XRLPssULmjOFRB+efWdWtPqI7Z7RYBJGjPQJhMfdrfRdRMpxt5x4K9/9NGs0DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","last_reissued_at":"2026-05-18T01:24:31.925505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:31.925505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limitations of sum of products of Read-Once Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"B.V. Raghavendra Rao, C. Ramya","submitted_at":"2015-12-11T11:43:49Z","abstract_excerpt":"We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas.\n  We prove an exponential lower bound for the size of the $\\Sigma\\Pi^{[N^{1/30}]}$ arithmetic circuits built over syntactically multi-linear $\\Sigma\\Pi\\Sigma^{[N^{8/15}]}$ arithmetic circuits computing a product of variable disjoint linear forms on $N$ variables. We extend the result to the case of $\\Sigma\\Pi^{[N^{1/30}]}$ arithmetic circuits built over ROPs of unbounded depth, where the number of variables with $+$ gates as a parent in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03607","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":"1512.03607","created_at":"2026-05-18T01:24:31.925601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03607v1","created_at":"2026-05-18T01:24:31.925601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03607","created_at":"2026-05-18T01:24:31.925601+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OUV7DVAJFO6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OUV7DVAJFO65KTD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OUV7DVA","created_at":"2026-05-18T12:29:05.191682+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/5OUV7DVAJFO65KTDW5RHXBMWS5","json":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5.json","graph_json":"https://pith.science/api/pith-number/5OUV7DVAJFO65KTDW5RHXBMWS5/graph.json","events_json":"https://pith.science/api/pith-number/5OUV7DVAJFO65KTDW5RHXBMWS5/events.json","paper":"https://pith.science/paper/5OUV7DVA"},"agent_actions":{"view_html":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5","download_json":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5.json","view_paper":"https://pith.science/paper/5OUV7DVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03607&json=true","fetch_graph":"https://pith.science/api/pith-number/5OUV7DVAJFO65KTDW5RHXBMWS5/graph.json","fetch_events":"https://pith.science/api/pith-number/5OUV7DVAJFO65KTDW5RHXBMWS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/action/storage_attestation","attest_author":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/action/author_attestation","sign_citation":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/action/citation_signature","submit_replication":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/action/replication_record"}},"created_at":"2026-05-18T01:24:31.925601+00:00","updated_at":"2026-05-18T01:24:31.925601+00:00"}