{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PVTPT3HFZXXITTNZBVU3KCMTHJ","short_pith_number":"pith:PVTPT3HF","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"},"canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","source":{"kind":"arxiv","id":"1710.05481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05481","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05481v1","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05481","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"PVTPT3HFZXXI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVTPT3HFZXXITTNZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVTPT3HF","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PVTPT3HFZXXITTNZBVU3KCMTHJ","target":"record","payload":{"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"},"canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","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"},"source_kind":"arxiv","source_id":"1710.05481","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-18T00:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3rbvRPBmB2HLXWw4hUHJ6ec2WWM85d0WOeHHJRMuaGEngxQ/zOXVVIlFtqDYFxnqHF74+TAPo/a8WDNxQt4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:48:38.849278Z"},"content_sha256":"fa00e0479c12dea35a48eb60cf8dd06d4f60635f0bd85038ac66e4f027622d4b","schema_version":"1.0","event_id":"sha256:fa00e0479c12dea35a48eb60cf8dd06d4f60635f0bd85038ac66e4f027622d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PVTPT3HFZXXITTNZBVU3KCMTHJ","target":"graph","payload":{"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"},"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-18T00:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3fJ/cZLxSQP+r6CvT9KciSjS5kjoHDaprlNGZ+urTrQysSSvZF4zNM3Z+GPzSNpWKk+93MuAkcEoiuotmvuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:48:38.849968Z"},"content_sha256":"2389db68019c3be6f426c82148f6a824fae4a58418cf9951ee5d1e5695e4c40e","schema_version":"1.0","event_id":"sha256:2389db68019c3be6f426c82148f6a824fae4a58418cf9951ee5d1e5695e4c40e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/bundle.json","state_url":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/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-11T08:48:38Z","links":{"resolver":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ","bundle":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/bundle.json","state":"https://pith.science/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVTPT3HFZXXITTNZBVU3KCMTHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PVTPT3HFZXXITTNZBVU3KCMTHJ","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":"061de193ae915dc6e15b36167728aa5ceebc76d2f8065d72cbb8d6291e470268","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-10-16T03:01:52Z","title_canon_sha256":"b4bcf394087b2c06aeaba0cb0aae8603e24ba4cce38603345fe5f4a4d419c55d"},"schema_version":"1.0","source":{"id":"1710.05481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05481","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05481v1","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05481","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"PVTPT3HFZXXI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVTPT3HFZXXITTNZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVTPT3HF","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2389db68019c3be6f426c82148f6a824fae4a58418cf9951ee5d1e5695e4c40e","target":"graph","created_at":"2026-05-18T00:32:49Z","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":"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","authors_text":"Nutan Limaye, Srikanth Srinivasan, Suryajith Chillara","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-10-16T03:01:52Z","title":"Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05481","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:fa00e0479c12dea35a48eb60cf8dd06d4f60635f0bd85038ac66e4f027622d4b","target":"record","created_at":"2026-05-18T00:32:49Z","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":"061de193ae915dc6e15b36167728aa5ceebc76d2f8065d72cbb8d6291e470268","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-10-16T03:01:52Z","title_canon_sha256":"b4bcf394087b2c06aeaba0cb0aae8603e24ba4cce38603345fe5f4a4d419c55d"},"schema_version":"1.0","source":{"id":"1710.05481","kind":"arxiv","version":1}},"canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d66f9ece5cdee89cdb90d69b509933a443d25585cfc98fa4b3bf42fb99a9616","first_computed_at":"2026-05-18T00:32:49.250224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:49.250224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dbq6eInPhJ73LdgIWRSoKroNSWyk5fuVt2svqRJ7QFTxXQmJely6qLZzoo4RNLWwyqe2H3vFSSzKO00LjnJDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:49.250874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa00e0479c12dea35a48eb60cf8dd06d4f60635f0bd85038ac66e4f027622d4b","sha256:2389db68019c3be6f426c82148f6a824fae4a58418cf9951ee5d1e5695e4c40e"],"state_sha256":"d00253332498d1b1742bfc7d6b435ecbc581cdbbf8cf3eacf04ef3875829f3de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlJAKm2Envx1YyieUPLaEsoOdgRy+sz23YeV/RPfQxYj2fYoRg7JTQVezQQov0BP4yhiqfF19RuYEXjHg69gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:48:38.853909Z","bundle_sha256":"fec2b36303fd66cf4709027a82c5b8e660f1eca86a8b72db1bd62b919e54d1f7"}}