{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FCJEPP3RSN7EDQQ6CLWFFFPXD5","short_pith_number":"pith:FCJEPP3R","schema_version":"1.0","canonical_sha256":"289247bf71937e41c21e12ec5295f71f673dc513994f426787ff482679b0f012","source":{"kind":"arxiv","id":"2407.10143","version":1},"attestation_state":"computed","paper":{"title":"Explicit Commutative ROABPs from Partial Derivatives","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anamay Tengse, Vishwas Bhargava","submitted_at":"2024-07-14T10:29:50Z","abstract_excerpt":"The dimension of partial derivatives (Nisan and Wigderson, 1997) is a popular measure for proving lower bounds in algebraic complexity. It is used to give strong lower bounds on the Waring decomposition of polynomials (called Waring rank). This naturally leads to an interesting open question: does this measure essentially characterize the Waring rank of any polynomial?\n  The well-studied model of Read-once Oblivious ABPs (ROABPs for short) lends itself to an interesting hierarchy of 'sub-models': Any-Order-ROABPs (ARO), Commutative ROABPs, and Diagonal ROABPs. It follows from previous works th"},"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":"2407.10143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-14T10:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"57ceca9df4463e70fae4c9d8e74f3e61eac528cca5a69b668321b029929c83e6","abstract_canon_sha256":"577d3c90b6efc75df2b2889e66c9809b01c61581333d69e924b4f0c371a3da38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:39.711955Z","signature_b64":"41XZ/h1ELTSDurIW99fzyNIp87sVDFs5mLQfaH1yuh3BIrCZnO+1L1uOOi8Tc2qg+A2qsw+XLvNxcTBtxSKCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"289247bf71937e41c21e12ec5295f71f673dc513994f426787ff482679b0f012","last_reissued_at":"2026-07-05T08:43:39.711521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:39.711521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Commutative ROABPs from Partial Derivatives","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anamay Tengse, Vishwas Bhargava","submitted_at":"2024-07-14T10:29:50Z","abstract_excerpt":"The dimension of partial derivatives (Nisan and Wigderson, 1997) is a popular measure for proving lower bounds in algebraic complexity. It is used to give strong lower bounds on the Waring decomposition of polynomials (called Waring rank). This naturally leads to an interesting open question: does this measure essentially characterize the Waring rank of any polynomial?\n  The well-studied model of Read-once Oblivious ABPs (ROABPs for short) lends itself to an interesting hierarchy of 'sub-models': Any-Order-ROABPs (ARO), Commutative ROABPs, and Diagonal ROABPs. It follows from previous works th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10143","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.10143/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.10143","created_at":"2026-07-05T08:43:39.711576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10143v1","created_at":"2026-07-05T08:43:39.711576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10143","created_at":"2026-07-05T08:43:39.711576+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCJEPP3RSN7E","created_at":"2026-07-05T08:43:39.711576+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCJEPP3RSN7EDQQ6","created_at":"2026-07-05T08:43:39.711576+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCJEPP3R","created_at":"2026-07-05T08:43:39.711576+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18981","citing_title":"The Complexity of Order-Finding for ROABPs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5","json":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5.json","graph_json":"https://pith.science/api/pith-number/FCJEPP3RSN7EDQQ6CLWFFFPXD5/graph.json","events_json":"https://pith.science/api/pith-number/FCJEPP3RSN7EDQQ6CLWFFFPXD5/events.json","paper":"https://pith.science/paper/FCJEPP3R"},"agent_actions":{"view_html":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5","download_json":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5.json","view_paper":"https://pith.science/paper/FCJEPP3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10143&json=true","fetch_graph":"https://pith.science/api/pith-number/FCJEPP3RSN7EDQQ6CLWFFFPXD5/graph.json","fetch_events":"https://pith.science/api/pith-number/FCJEPP3RSN7EDQQ6CLWFFFPXD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5/action/storage_attestation","attest_author":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5/action/author_attestation","sign_citation":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5/action/citation_signature","submit_replication":"https://pith.science/pith/FCJEPP3RSN7EDQQ6CLWFFFPXD5/action/replication_record"}},"created_at":"2026-07-05T08:43:39.711576+00:00","updated_at":"2026-07-05T08:43:39.711576+00:00"}