{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5WIEWD4D7ZSLULDGF7UM6W4MFH","short_pith_number":"pith:5WIEWD4D","canonical_record":{"source":{"id":"2607.02241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-02T14:37:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b9f68f6902d8bc6b9224b9d03cb6dd6f0f18309b41b5e0900bf8e996414a2a90","abstract_canon_sha256":"b1a32a8f6a7bf633af64a8358f46e1348b61cd0f5034d0bae3d996b21b1a8d02"},"schema_version":"1.0"},"canonical_sha256":"ed904b0f83fe64ba2c662fe8cf5b8c29c51cd2f342deb36e88389f449342186e","source":{"kind":"arxiv","id":"2607.02241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02241","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02241v1","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02241","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"5WIEWD4D7ZSL","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_16","alias_value":"5WIEWD4D7ZSLULDG","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_8","alias_value":"5WIEWD4D","created_at":"2026-07-03T01:17:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5WIEWD4D7ZSLULDGF7UM6W4MFH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.02241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-02T14:37:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b9f68f6902d8bc6b9224b9d03cb6dd6f0f18309b41b5e0900bf8e996414a2a90","abstract_canon_sha256":"b1a32a8f6a7bf633af64a8358f46e1348b61cd0f5034d0bae3d996b21b1a8d02"},"schema_version":"1.0"},"canonical_sha256":"ed904b0f83fe64ba2c662fe8cf5b8c29c51cd2f342deb36e88389f449342186e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:46.171096Z","signature_b64":"2W3m7M5kZEpFiFhmaTz97VwhEL96qXghddkABkcjPhxgMQv5v6I8d4aGhSILexPp9bnMmNx45+Bx02ROcr6mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed904b0f83fe64ba2c662fe8cf5b8c29c51cd2f342deb36e88389f449342186e","last_reissued_at":"2026-07-03T01:17:46.170670Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:46.170670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.02241","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-07-03T01:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbXMbx3yBLK0hvI1ScODQY4/vbwo0LNGIeQLIZmRHybp6fZYRDoCvbrZpeOavuvZmvc/QZ8K+DStWpMJDsx+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:50:55.860182Z"},"content_sha256":"1e730da79631743ee171a76fa520ea312facfaedbdf19c80ba8a0dec553f296b","schema_version":"1.0","event_id":"sha256:1e730da79631743ee171a76fa520ea312facfaedbdf19c80ba8a0dec553f296b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5WIEWD4D7ZSLULDGF7UM6W4MFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partition Rank and Algebraic Circuit Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Cornelius Brand, Jiaheng Wang, Petteri Kaski","submitted_at":"2026-07-02T14:37:35Z","abstract_excerpt":"Strassen's theory of bilinear complexity provides a mathematical characterization of the arithmetic complexity of primitives such as matrix multiplication via the rank of tensors. However, the connection to tensor rank is known to break down in higher degrees of multilinearity.\n  In this work, we highlight an unexplored connection between a generalized notion of tensor rank, which can be defined in Naslund's framework of partition ranks (JCTA 2020), and multiplicative complexity. These partition ranks allow us to control the multiplicative complexity, and thus arithmetic complexity, in any con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02241","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/2607.02241/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"},"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-07-03T01:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDhr1cwN/y2APAlczPWTLB2a4gtGjsRAJVh3e8omUDU/Nx4TlI1Eb956asC8syMeikWnhJoRGqs39TPL+jSvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:50:55.860573Z"},"content_sha256":"75e20684252decd85ab29d61c07986dc155a601dbba0149eacdd940408ff205f","schema_version":"1.0","event_id":"sha256:75e20684252decd85ab29d61c07986dc155a601dbba0149eacdd940408ff205f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/bundle.json","state_url":"https://pith.science/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/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-07-03T12:50:55Z","links":{"resolver":"https://pith.science/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH","bundle":"https://pith.science/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/bundle.json","state":"https://pith.science/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WIEWD4D7ZSLULDGF7UM6W4MFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5WIEWD4D7ZSLULDGF7UM6W4MFH","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":"b1a32a8f6a7bf633af64a8358f46e1348b61cd0f5034d0bae3d996b21b1a8d02","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-02T14:37:35Z","title_canon_sha256":"b9f68f6902d8bc6b9224b9d03cb6dd6f0f18309b41b5e0900bf8e996414a2a90"},"schema_version":"1.0","source":{"id":"2607.02241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02241","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02241v1","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02241","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"5WIEWD4D7ZSL","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_16","alias_value":"5WIEWD4D7ZSLULDG","created_at":"2026-07-03T01:17:46Z"},{"alias_kind":"pith_short_8","alias_value":"5WIEWD4D","created_at":"2026-07-03T01:17:46Z"}],"graph_snapshots":[{"event_id":"sha256:75e20684252decd85ab29d61c07986dc155a601dbba0149eacdd940408ff205f","target":"graph","created_at":"2026-07-03T01:17:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.02241/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Strassen's theory of bilinear complexity provides a mathematical characterization of the arithmetic complexity of primitives such as matrix multiplication via the rank of tensors. However, the connection to tensor rank is known to break down in higher degrees of multilinearity.\n  In this work, we highlight an unexplored connection between a generalized notion of tensor rank, which can be defined in Naslund's framework of partition ranks (JCTA 2020), and multiplicative complexity. These partition ranks allow us to control the multiplicative complexity, and thus arithmetic complexity, in any con","authors_text":"Cornelius Brand, Jiaheng Wang, Petteri Kaski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-02T14:37:35Z","title":"Partition Rank and Algebraic Circuit Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02241","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:1e730da79631743ee171a76fa520ea312facfaedbdf19c80ba8a0dec553f296b","target":"record","created_at":"2026-07-03T01:17:46Z","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":"b1a32a8f6a7bf633af64a8358f46e1348b61cd0f5034d0bae3d996b21b1a8d02","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-02T14:37:35Z","title_canon_sha256":"b9f68f6902d8bc6b9224b9d03cb6dd6f0f18309b41b5e0900bf8e996414a2a90"},"schema_version":"1.0","source":{"id":"2607.02241","kind":"arxiv","version":1}},"canonical_sha256":"ed904b0f83fe64ba2c662fe8cf5b8c29c51cd2f342deb36e88389f449342186e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed904b0f83fe64ba2c662fe8cf5b8c29c51cd2f342deb36e88389f449342186e","first_computed_at":"2026-07-03T01:17:46.170670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:46.170670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2W3m7M5kZEpFiFhmaTz97VwhEL96qXghddkABkcjPhxgMQv5v6I8d4aGhSILexPp9bnMmNx45+Bx02ROcr6mBQ==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:46.171096Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.02241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e730da79631743ee171a76fa520ea312facfaedbdf19c80ba8a0dec553f296b","sha256:75e20684252decd85ab29d61c07986dc155a601dbba0149eacdd940408ff205f"],"state_sha256":"83e246312ec340dd5c92c28ef51fa7630833f7d835b59f27fee458a17be37b86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbiNKQhVF3paFYabGq6/nKI8a7ZypYRTIEzt62oUH0NW4CLWxcRwiUWsKTzXTHJCB8UqbjbZ6wSRKESAfAmYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:50:55.862561Z","bundle_sha256":"ec5a6720d929a811d23a9f83263cc3d6c9c0ccee67839a32ae0854086d918b0e"}}