{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6U7XYH4NQS3W5IW2KDSVPDVJ4G","short_pith_number":"pith:6U7XYH4N","canonical_record":{"source":{"id":"1210.8368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-31T15:36:30Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"0bae44c3030b8e0d7d4567a1d6990e022cbb8a84edf622e78893f09420f3da89","abstract_canon_sha256":"00a666b1317e95749c1f313c4b64758e8400ef41fee969a3f02ceca7451c85f9"},"schema_version":"1.0"},"canonical_sha256":"f53f7c1f8d84b76ea2da50e5578ea9e1b407e81a348b1316f98f93ff3655ff18","source":{"kind":"arxiv","id":"1210.8368","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8368","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8368v2","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8368","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"6U7XYH4NQS3W","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6U7XYH4NQS3W5IW2","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6U7XYH4N","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6U7XYH4NQS3W5IW2KDSVPDVJ4G","target":"record","payload":{"canonical_record":{"source":{"id":"1210.8368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-31T15:36:30Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"0bae44c3030b8e0d7d4567a1d6990e022cbb8a84edf622e78893f09420f3da89","abstract_canon_sha256":"00a666b1317e95749c1f313c4b64758e8400ef41fee969a3f02ceca7451c85f9"},"schema_version":"1.0"},"canonical_sha256":"f53f7c1f8d84b76ea2da50e5578ea9e1b407e81a348b1316f98f93ff3655ff18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:41.543624Z","signature_b64":"Kq+ykvTj8E0ViQEPfX3RApsXKOlhQ/SFCpPOvB8ugAcYiifzlBzLJYEOc0N3WUojBkHRQeRZJjcC9XuGKE4dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f53f7c1f8d84b76ea2da50e5578ea9e1b407e81a348b1316f98f93ff3655ff18","last_reissued_at":"2026-05-18T03:30:41.542978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:41.542978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.8368","source_version":2,"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-18T03:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcPqVyHJvVCb9M+qUeFjQV3xqRe7WIzz04V6VxJ1wizCz9hGgXmHzAgOSusYXk6YKsDplCKj832TC0H80VBvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:47:16.789429Z"},"content_sha256":"ec9421dd0fffb4e38db824ff011a7cbb0a69622d1d12f76ba3e769130bd39fc2","schema_version":"1.0","event_id":"sha256:ec9421dd0fffb4e38db824ff011a7cbb0a69622d1d12f76ba3e769130bd39fc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6U7XYH4NQS3W5IW2KDSVPDVJ4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit Lower Bounds via Geometric Complexity Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, Peter B\\\"urgisser","submitted_at":"2012-10-31T15:36:30Z","abstract_excerpt":"We prove the lower bound R(M_m) \\geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While this bound is weaker than the one recently obtained by Landsberg and Ottaviani, these are the first significant lower bounds obtained within the GCT program. Behind the proof is the new combinatorial concept of obstruction designs, which encode highest weight vectors in Sym^d\\otimes^3(C^n)^* and provide new insights into Kronecker coefficients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8368","kind":"arxiv","version":2},"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-18T03:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxfeSRsViTEXCntN8iJUHxDrlvtljhH0wASKEOAr6DYbmFi8ew4hkAjhQbp9WDVuvQKZZ7rLcIsFNQ/QBdLmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:47:16.789944Z"},"content_sha256":"ea73698d46366c8e37e65cbd972349cdd2f016f3209054d40678ef0affbccb17","schema_version":"1.0","event_id":"sha256:ea73698d46366c8e37e65cbd972349cdd2f016f3209054d40678ef0affbccb17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/bundle.json","state_url":"https://pith.science/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/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-01T01:47:16Z","links":{"resolver":"https://pith.science/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G","bundle":"https://pith.science/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/bundle.json","state":"https://pith.science/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6U7XYH4NQS3W5IW2KDSVPDVJ4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6U7XYH4NQS3W5IW2KDSVPDVJ4G","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":"00a666b1317e95749c1f313c4b64758e8400ef41fee969a3f02ceca7451c85f9","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-31T15:36:30Z","title_canon_sha256":"0bae44c3030b8e0d7d4567a1d6990e022cbb8a84edf622e78893f09420f3da89"},"schema_version":"1.0","source":{"id":"1210.8368","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8368","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8368v2","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8368","created_at":"2026-05-18T03:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"6U7XYH4NQS3W","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6U7XYH4NQS3W5IW2","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6U7XYH4N","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ea73698d46366c8e37e65cbd972349cdd2f016f3209054d40678ef0affbccb17","target":"graph","created_at":"2026-05-18T03:30:41Z","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":"We prove the lower bound R(M_m) \\geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While this bound is weaker than the one recently obtained by Landsberg and Ottaviani, these are the first significant lower bounds obtained within the GCT program. Behind the proof is the new combinatorial concept of obstruction designs, which encode highest weight vectors in Sym^d\\otimes^3(C^n)^* and provide new insights into Kronecker coefficients.","authors_text":"Christian Ikenmeyer, Peter B\\\"urgisser","cross_cats":["math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-31T15:36:30Z","title":"Explicit Lower Bounds via Geometric Complexity Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8368","kind":"arxiv","version":2},"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:ec9421dd0fffb4e38db824ff011a7cbb0a69622d1d12f76ba3e769130bd39fc2","target":"record","created_at":"2026-05-18T03:30:41Z","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":"00a666b1317e95749c1f313c4b64758e8400ef41fee969a3f02ceca7451c85f9","cross_cats_sorted":["math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-31T15:36:30Z","title_canon_sha256":"0bae44c3030b8e0d7d4567a1d6990e022cbb8a84edf622e78893f09420f3da89"},"schema_version":"1.0","source":{"id":"1210.8368","kind":"arxiv","version":2}},"canonical_sha256":"f53f7c1f8d84b76ea2da50e5578ea9e1b407e81a348b1316f98f93ff3655ff18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f53f7c1f8d84b76ea2da50e5578ea9e1b407e81a348b1316f98f93ff3655ff18","first_computed_at":"2026-05-18T03:30:41.542978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:41.542978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kq+ykvTj8E0ViQEPfX3RApsXKOlhQ/SFCpPOvB8ugAcYiifzlBzLJYEOc0N3WUojBkHRQeRZJjcC9XuGKE4dAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:41.543624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8368","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec9421dd0fffb4e38db824ff011a7cbb0a69622d1d12f76ba3e769130bd39fc2","sha256:ea73698d46366c8e37e65cbd972349cdd2f016f3209054d40678ef0affbccb17"],"state_sha256":"7e7637cd472b4548f94473f11014fff8be2f64c4f00509f869422bb803bfb5ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdOPiu3mxVEliJfvuaXItNu5yM9U36snbWCXyamV+gfqT7O93EKpjnt8sR1cVQNjg5nSY8Rlrn5m3IpUTv0XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:47:16.793058Z","bundle_sha256":"a65382a118016d547a7079d8d905225b65a319439ae6f7935819b6f67273b1d0"}}