{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PVTPT3HFZXXITTNZBVU3KCMTHJ","short_pith_number":"pith:PVTPT3HF","schema_version":"1.0","canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","source":{"kind":"arxiv","id":"1710.05481","version":1},"attestation_state":"computed","paper":{"title":"Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nutan Limaye, Srikanth Srinivasan, Suryajith Chillara","submitted_at":"2017-10-16T03:01:52Z","abstract_excerpt":"In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\\times 2$ matrices, denoted $\\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as long as the formulas are multilinear.\n  Formally, for each depth $\\Delta \\leq \\log d$, we show that any product-depth $\\Delta$ multilinear formula for $\\mathrm{IMM}_d$ must have size $\\exp(\\Omega(\\Delta d^{1/\\Delta})).$ It also follows from this that any multilinear circuit of product-depth $\\Delta$ for the same polynomial of the above form must have a size o"},"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":"1710.05481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-10-16T03:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"b4bcf394087b2c06aeaba0cb0aae8603e24ba4cce38603345fe5f4a4d419c55d","abstract_canon_sha256":"061de193ae915dc6e15b36167728aa5ceebc76d2f8065d72cbb8d6291e470268"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:49.250874Z","signature_b64":"dbq6eInPhJ73LdgIWRSoKroNSWyk5fuVt2svqRJ7QFTxXQmJely6qLZzoo4RNLWwyqe2H3vFSSzKO00LjnJDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","last_reissued_at":"2026-05-18T00:32:49.250224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:49.250224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nutan Limaye, Srikanth Srinivasan, Suryajith Chillara","submitted_at":"2017-10-16T03:01:52Z","abstract_excerpt":"In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\\times 2$ matrices, denoted $\\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as long as the formulas are multilinear.\n  Formally, for each depth $\\Delta \\leq \\log d$, we show that any product-depth $\\Delta$ multilinear formula for $\\mathrm{IMM}_d$ must have size $\\exp(\\Omega(\\Delta d^{1/\\Delta})).$ It also follows from this that any multilinear circuit of product-depth $\\Delta$ for the same polynomial of the above form must have a size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05481","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":"1710.05481","created_at":"2026-05-18T00:32:49.250349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05481v1","created_at":"2026-05-18T00:32:49.250349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05481","created_at":"2026-05-18T00:32:49.250349+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVTPT3HFZXXI","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVTPT3HFZXXITTNZ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVTPT3HF","created_at":"2026-05-18T12:31:37.085036+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/PVTPT3HFZXXITTNZBVU3KCMTHJ","json":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ.json","graph_json":"https://pith.science/api/pith-number/PVTPT3HFZXXITTNZBVU3KCMTHJ/graph.json","events_json":"https://pith.science/api/pith-number/PVTPT3HFZXXITTNZBVU3KCMTHJ/events.json","paper":"https://pith.science/paper/PVTPT3HF"},"agent_actions":{"view_html":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ","download_json":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ.json","view_paper":"https://pith.science/paper/PVTPT3HF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05481&json=true","fetch_graph":"https://pith.science/api/pith-number/PVTPT3HFZXXITTNZBVU3KCMTHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PVTPT3HFZXXITTNZBVU3KCMTHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/action/storage_attestation","attest_author":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/action/author_attestation","sign_citation":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/action/citation_signature","submit_replication":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/action/replication_record"}},"created_at":"2026-05-18T00:32:49.250349+00:00","updated_at":"2026-05-18T00:32:49.250349+00:00"}