{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4URAOBKF36TKLNCXYUIZAG22P2","short_pith_number":"pith:4URAOBKF","schema_version":"1.0","canonical_sha256":"e522070545dfa6a5b457c511901b5a7ea3f5d68a06480519867b31db41fdedaa","source":{"kind":"arxiv","id":"2211.07055","version":3},"attestation_state":"computed","paper":{"title":"Geometric complexity theory for product-plus-power","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, Fulvio Gesmundo, Gorav Jindal, Pranjal Dutta, Vladimir Lysikov","submitted_at":"2022-11-14T00:26:55Z","abstract_excerpt":"According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result and establish a tight connection between border Waring rank and the model of computation in Kumar's result. In this way, we obtain a new formulation of border Waring rank, up to a factor of the degree. We connect this new formulation to the orbit closure problem of the product-plus-power polynomial. We study this orbit closure from two directions: 1. We debord"},"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":"2211.07055","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-14T00:26:55Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d4d061d1a786e8d16da8b46cc999c4c77c6aaff27a4693b38f4793e401d503e7","abstract_canon_sha256":"3f09020af375f08c7ba8a40df7697ffc39172ce4016eb6151b4e6b1307d9e62f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:19.627554Z","signature_b64":"y8ndPp5PF+BgsWH7Ab39nK5cOQWD5HILb2esfBANTw3sAS+Ch0+cfbv5cWUn5uLge+ct1jIUV+jrwjNfJ5NICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e522070545dfa6a5b457c511901b5a7ea3f5d68a06480519867b31db41fdedaa","last_reissued_at":"2026-07-05T11:11:19.627005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:19.627005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric complexity theory for product-plus-power","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, Fulvio Gesmundo, Gorav Jindal, Pranjal Dutta, Vladimir Lysikov","submitted_at":"2022-11-14T00:26:55Z","abstract_excerpt":"According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result and establish a tight connection between border Waring rank and the model of computation in Kumar's result. In this way, we obtain a new formulation of border Waring rank, up to a factor of the degree. We connect this new formulation to the orbit closure problem of the product-plus-power polynomial. We study this orbit closure from two directions: 1. We debord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07055","kind":"arxiv","version":3},"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/2211.07055/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":"2211.07055","created_at":"2026-07-05T11:11:19.627072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.07055v3","created_at":"2026-07-05T11:11:19.627072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07055","created_at":"2026-07-05T11:11:19.627072+00:00"},{"alias_kind":"pith_short_12","alias_value":"4URAOBKF36TK","created_at":"2026-07-05T11:11:19.627072+00:00"},{"alias_kind":"pith_short_16","alias_value":"4URAOBKF36TKLNCX","created_at":"2026-07-05T11:11:19.627072+00:00"},{"alias_kind":"pith_short_8","alias_value":"4URAOBKF","created_at":"2026-07-05T11:11:19.627072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10007","citing_title":"Strength and partition rank under limits and field extensions","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2","json":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2.json","graph_json":"https://pith.science/api/pith-number/4URAOBKF36TKLNCXYUIZAG22P2/graph.json","events_json":"https://pith.science/api/pith-number/4URAOBKF36TKLNCXYUIZAG22P2/events.json","paper":"https://pith.science/paper/4URAOBKF"},"agent_actions":{"view_html":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2","download_json":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2.json","view_paper":"https://pith.science/paper/4URAOBKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.07055&json=true","fetch_graph":"https://pith.science/api/pith-number/4URAOBKF36TKLNCXYUIZAG22P2/graph.json","fetch_events":"https://pith.science/api/pith-number/4URAOBKF36TKLNCXYUIZAG22P2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2/action/storage_attestation","attest_author":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2/action/author_attestation","sign_citation":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2/action/citation_signature","submit_replication":"https://pith.science/pith/4URAOBKF36TKLNCXYUIZAG22P2/action/replication_record"}},"created_at":"2026-07-05T11:11:19.627072+00:00","updated_at":"2026-07-05T11:11:19.627072+00:00"}