{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O5R5BF56XVZKTIBBFOSRHLPOA2","short_pith_number":"pith:O5R5BF56","schema_version":"1.0","canonical_sha256":"7763d097bebd72a9a0212ba513adee0682b4782451a8323f2405876c25fa08f9","source":{"kind":"arxiv","id":"2509.06294","version":1},"attestation_state":"computed","paper":{"title":"Slice rank and partition rank of the determinant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Amichai Lampert, Guy Moshkovitz","submitted_at":"2025-09-08T02:35:50Z","abstract_excerpt":"The Laplace expansion expresses the $n \\times n$ determinant $\\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we:\n  - Fully determine the slice rank decompositions of $\\det_n$ (where each product must contain a linear factor): In this case, we show that $n$ summands are necessary, and moreover, the only such expansions with $n$ summands are equivalent (in a precise sense) to the Laplace expansion. \n  - Prove a logarithmic lower bound for the partition rank of $\\det_n$ (where each product is of multilinear forms): In this case, we show that at least $\\log_2(n)+1$ su"},"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":"2509.06294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T02:35:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"10e93a0961d0eaa4aa886b2f5e80d2a7ea44dcc5b893fc3c8c3901e802313e6a","abstract_canon_sha256":"9877430370d2f23e95fae7b7c843900e016902ce2de99e54d7b97d225c7ea1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:33.237282Z","signature_b64":"oA9o1HXraxaf/td3Il4G30xpnX0mvHO4/wHpi0qVODmlac2k+BW4FEaauPI33cx0glxtoIG0IMreti0UOS7DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7763d097bebd72a9a0212ba513adee0682b4782451a8323f2405876c25fa08f9","last_reissued_at":"2026-07-05T12:06:33.236652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:33.236652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slice rank and partition rank of the determinant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Amichai Lampert, Guy Moshkovitz","submitted_at":"2025-09-08T02:35:50Z","abstract_excerpt":"The Laplace expansion expresses the $n \\times n$ determinant $\\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we:\n  - Fully determine the slice rank decompositions of $\\det_n$ (where each product must contain a linear factor): In this case, we show that $n$ summands are necessary, and moreover, the only such expansions with $n$ summands are equivalent (in a precise sense) to the Laplace expansion. \n  - Prove a logarithmic lower bound for the partition rank of $\\det_n$ (where each product is of multilinear forms): In this case, we show that at least $\\log_2(n)+1$ su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06294","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/2509.06294/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":"2509.06294","created_at":"2026-07-05T12:06:33.236739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06294v1","created_at":"2026-07-05T12:06:33.236739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06294","created_at":"2026-07-05T12:06:33.236739+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5R5BF56XVZK","created_at":"2026-07-05T12:06:33.236739+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5R5BF56XVZKTIBB","created_at":"2026-07-05T12:06:33.236739+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5R5BF56","created_at":"2026-07-05T12:06:33.236739+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/O5R5BF56XVZKTIBBFOSRHLPOA2","json":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2.json","graph_json":"https://pith.science/api/pith-number/O5R5BF56XVZKTIBBFOSRHLPOA2/graph.json","events_json":"https://pith.science/api/pith-number/O5R5BF56XVZKTIBBFOSRHLPOA2/events.json","paper":"https://pith.science/paper/O5R5BF56"},"agent_actions":{"view_html":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2","download_json":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2.json","view_paper":"https://pith.science/paper/O5R5BF56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06294&json=true","fetch_graph":"https://pith.science/api/pith-number/O5R5BF56XVZKTIBBFOSRHLPOA2/graph.json","fetch_events":"https://pith.science/api/pith-number/O5R5BF56XVZKTIBBFOSRHLPOA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2/action/storage_attestation","attest_author":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2/action/author_attestation","sign_citation":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2/action/citation_signature","submit_replication":"https://pith.science/pith/O5R5BF56XVZKTIBBFOSRHLPOA2/action/replication_record"}},"created_at":"2026-07-05T12:06:33.236739+00:00","updated_at":"2026-07-05T12:06:33.236739+00:00"}