{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5OUV7DVAJFO65KTDW5RHXBMWS5","short_pith_number":"pith:5OUV7DVA","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"},"canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","source":{"kind":"arxiv","id":"1512.03607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03607","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03607v1","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03607","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"5OUV7DVAJFO6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5OUV7DVAJFO65KTD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5OUV7DVA","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5OUV7DVAJFO65KTDW5RHXBMWS5","target":"record","payload":{"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"},"canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","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"},"source_kind":"arxiv","source_id":"1512.03607","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-18T01:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaplK5zOMFE0q39B3Dn28DT1fFcIsGp5s51MvtwxgeBk/0iBJkPffas5fGlN2HghEuGZ6pXHyp816N4/EIppCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:36:40.827021Z"},"content_sha256":"fce6fd19aa67099daaa06a8346423b4162c7b86ea86d767f5f9f439de5211204","schema_version":"1.0","event_id":"sha256:fce6fd19aa67099daaa06a8346423b4162c7b86ea86d767f5f9f439de5211204"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5OUV7DVAJFO65KTDW5RHXBMWS5","target":"graph","payload":{"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"},"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-18T01:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoL84bEqT3Q1xl2uSiwGUoFFCZLi5XDPWCeoWDaNQ9aXUOv1DlSbAn7ZqidhmkLjrJeZ4C8rLJwmW342AovQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:36:40.827756Z"},"content_sha256":"39d8225f66e0d59649dfa087063a5dfe499831110cc7a424282758e1e2fc2f9a","schema_version":"1.0","event_id":"sha256:39d8225f66e0d59649dfa087063a5dfe499831110cc7a424282758e1e2fc2f9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/bundle.json","state_url":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/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-10T21:36:40Z","links":{"resolver":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5","bundle":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/bundle.json","state":"https://pith.science/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OUV7DVAJFO65KTDW5RHXBMWS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5OUV7DVAJFO65KTDW5RHXBMWS5","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":"faa9f864c61ee93a6fdf20d439fd1b29e4266ffa9b4c3153881104b70a67d53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T11:43:49Z","title_canon_sha256":"158a1e47200ebdc03a579df696145d5c9e848e0d690ba4a76278ef3940d13624"},"schema_version":"1.0","source":{"id":"1512.03607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03607","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03607v1","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03607","created_at":"2026-05-18T01:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"5OUV7DVAJFO6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5OUV7DVAJFO65KTD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5OUV7DVA","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:39d8225f66e0d59649dfa087063a5dfe499831110cc7a424282758e1e2fc2f9a","target":"graph","created_at":"2026-05-18T01:24:31Z","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 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","authors_text":"B.V. Raghavendra Rao, C. Ramya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T11:43:49Z","title":"Limitations of sum of products of Read-Once Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03607","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:fce6fd19aa67099daaa06a8346423b4162c7b86ea86d767f5f9f439de5211204","target":"record","created_at":"2026-05-18T01:24:31Z","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":"faa9f864c61ee93a6fdf20d439fd1b29e4266ffa9b4c3153881104b70a67d53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T11:43:49Z","title_canon_sha256":"158a1e47200ebdc03a579df696145d5c9e848e0d690ba4a76278ef3940d13624"},"schema_version":"1.0","source":{"id":"1512.03607","kind":"arxiv","version":1}},"canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eba95f8ea0495deeaa63b7627b859697725309aa75e796b3b05712987dc668e1","first_computed_at":"2026-05-18T01:24:31.925505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:31.925505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5wyweOZHslH/YuWZnKvUs4XRLPssULmjOFRB+efWdWtPqI7Z7RYBJGjPQJhMfdrfRdRMpxt5x4K9/9NGs0DCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:31.926069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fce6fd19aa67099daaa06a8346423b4162c7b86ea86d767f5f9f439de5211204","sha256:39d8225f66e0d59649dfa087063a5dfe499831110cc7a424282758e1e2fc2f9a"],"state_sha256":"f165950f6dc9f9162d06876f0a49e2895d567a278a513a10bc357f06f731b928"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BGrQ+HqOciP7i9IK58EgdLTJ0yT1GZZB3sqcHU26+Zo32+UoUp9UiRHbZSOw5ap/d9xZhTbpBUqQdyW0RS9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:36:40.831915Z","bundle_sha256":"5e672c8df7653249d520e441077cb56ff40812e8364ecdd7d30b12afe232874f"}}