{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2MWVZQ73QH6RDFE2537PRTO7SX","short_pith_number":"pith:2MWVZQ73","schema_version":"1.0","canonical_sha256":"d32d5cc3fb81fd11949aeefef8cddf95f2515c311407da55fe0e0b304e0cd2d0","source":{"kind":"arxiv","id":"1512.04386","version":1},"attestation_state":"computed","paper":{"title":"Read-once polynomials: How many summands suffice?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anuj Tawari, Meena Mahajan","submitted_at":"2015-12-14T16:16:44Z","abstract_excerpt":"An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over $+, \\times$ where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression."},"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.04386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-14T16:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc59d33b95be67fcb157391022b933572db4b359c187d96f8f9ae221b9022c93","abstract_canon_sha256":"a69e85ce545b0c2bce544e0f3ffbc5910e3fc84d85688e230b3305e5bf7c9700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.326783Z","signature_b64":"CGJ42MEvi35YC9D0PUW/omXD9QpkUUEeqdEpvnnMCBR1vmrWsVIS32b7pGUPgTIV6gUDcYmcYv/mqiOqYECbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d32d5cc3fb81fd11949aeefef8cddf95f2515c311407da55fe0e0b304e0cd2d0","last_reissued_at":"2026-05-18T01:24:22.326245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.326245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Read-once polynomials: How many summands suffice?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anuj Tawari, Meena Mahajan","submitted_at":"2015-12-14T16:16:44Z","abstract_excerpt":"An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over $+, \\times$ where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04386","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.04386","created_at":"2026-05-18T01:24:22.326325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04386v1","created_at":"2026-05-18T01:24:22.326325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04386","created_at":"2026-05-18T01:24:22.326325+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MWVZQ73QH6R","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MWVZQ73QH6RDFE2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MWVZQ73","created_at":"2026-05-18T12:29:02.477457+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/2MWVZQ73QH6RDFE2537PRTO7SX","json":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX.json","graph_json":"https://pith.science/api/pith-number/2MWVZQ73QH6RDFE2537PRTO7SX/graph.json","events_json":"https://pith.science/api/pith-number/2MWVZQ73QH6RDFE2537PRTO7SX/events.json","paper":"https://pith.science/paper/2MWVZQ73"},"agent_actions":{"view_html":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX","download_json":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX.json","view_paper":"https://pith.science/paper/2MWVZQ73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04386&json=true","fetch_graph":"https://pith.science/api/pith-number/2MWVZQ73QH6RDFE2537PRTO7SX/graph.json","fetch_events":"https://pith.science/api/pith-number/2MWVZQ73QH6RDFE2537PRTO7SX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX/action/storage_attestation","attest_author":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX/action/author_attestation","sign_citation":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX/action/citation_signature","submit_replication":"https://pith.science/pith/2MWVZQ73QH6RDFE2537PRTO7SX/action/replication_record"}},"created_at":"2026-05-18T01:24:22.326325+00:00","updated_at":"2026-05-18T01:24:22.326325+00:00"}