{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OVRLD3IN3DZJXD4KLBBACSVU45","short_pith_number":"pith:OVRLD3IN","schema_version":"1.0","canonical_sha256":"7562b1ed0dd8f29b8f8a5842014ab4e77802603d2cab3fff3d5b6cfd5ac2b98e","source":{"kind":"arxiv","id":"2606.13628","version":1},"attestation_state":"computed","paper":{"title":"A near-quadratic lower bound on the border determinantal complexity of $\\sum_i x_i^n$ via conormal specialization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karthik Sheshadri","submitted_at":"2026-06-11T17:40:51Z","abstract_excerpt":"The border determinantal complexity $\\dcb(f)$ of a polynomial $f$ is the least $m$ such that $f$ is a limit of determinants of $m\\times m$ matrices of affine-linear forms. We prove that for every $n\\ge3$, over $\\CC$, \\[\n  \\dcb\\Big(\\sum_{i=1}^n x_i^n\\Big)\\ \\ge\\ \\frac{(n-1)^2}{4e},\n  \\qquad\n  \\sdcb\\Big(\\sum_{i=1}^n x_i^n\\Big)\\ \\ge\\ \\frac{(n-1)^2}{2e} \\] in the ordinary and symmetric models respectively; both match the known $O(n^2)$ upper bounds up to the constant. To our knowledge these are the first border determinantal lower bounds for an explicit family that are superlinear in the number of "},"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":"2606.13628","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-11T17:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"5e7e4ac9306c944a01fa404309ada0f796a74b175a5d6247792a6cb0eca0f1b1","abstract_canon_sha256":"b8aff8d109a7f09542119dd6a000ce755f8ffe2169d6f4656501115c3b6aef36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:15.925866Z","signature_b64":"4C29q4iqqTB9XF7O9seYfpROLMuenx+XSBqgYg8E2edYZ2byGgE8uEAmc+zPZ8TGYBKVzCTCkVgi8QjnZehyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7562b1ed0dd8f29b8f8a5842014ab4e77802603d2cab3fff3d5b6cfd5ac2b98e","last_reissued_at":"2026-06-12T01:10:15.924913Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:15.924913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A near-quadratic lower bound on the border determinantal complexity of $\\sum_i x_i^n$ via conormal specialization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karthik Sheshadri","submitted_at":"2026-06-11T17:40:51Z","abstract_excerpt":"The border determinantal complexity $\\dcb(f)$ of a polynomial $f$ is the least $m$ such that $f$ is a limit of determinants of $m\\times m$ matrices of affine-linear forms. We prove that for every $n\\ge3$, over $\\CC$, \\[\n  \\dcb\\Big(\\sum_{i=1}^n x_i^n\\Big)\\ \\ge\\ \\frac{(n-1)^2}{4e},\n  \\qquad\n  \\sdcb\\Big(\\sum_{i=1}^n x_i^n\\Big)\\ \\ge\\ \\frac{(n-1)^2}{2e} \\] in the ordinary and symmetric models respectively; both match the known $O(n^2)$ upper bounds up to the constant. To our knowledge these are the first border determinantal lower bounds for an explicit family that are superlinear in the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13628","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/2606.13628/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":"2606.13628","created_at":"2026-06-12T01:10:15.925068+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13628v1","created_at":"2026-06-12T01:10:15.925068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13628","created_at":"2026-06-12T01:10:15.925068+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVRLD3IN3DZJ","created_at":"2026-06-12T01:10:15.925068+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVRLD3IN3DZJXD4K","created_at":"2026-06-12T01:10:15.925068+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVRLD3IN","created_at":"2026-06-12T01:10:15.925068+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/OVRLD3IN3DZJXD4KLBBACSVU45","json":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45.json","graph_json":"https://pith.science/api/pith-number/OVRLD3IN3DZJXD4KLBBACSVU45/graph.json","events_json":"https://pith.science/api/pith-number/OVRLD3IN3DZJXD4KLBBACSVU45/events.json","paper":"https://pith.science/paper/OVRLD3IN"},"agent_actions":{"view_html":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45","download_json":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45.json","view_paper":"https://pith.science/paper/OVRLD3IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13628&json=true","fetch_graph":"https://pith.science/api/pith-number/OVRLD3IN3DZJXD4KLBBACSVU45/graph.json","fetch_events":"https://pith.science/api/pith-number/OVRLD3IN3DZJXD4KLBBACSVU45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45/action/storage_attestation","attest_author":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45/action/author_attestation","sign_citation":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45/action/citation_signature","submit_replication":"https://pith.science/pith/OVRLD3IN3DZJXD4KLBBACSVU45/action/replication_record"}},"created_at":"2026-06-12T01:10:15.925068+00:00","updated_at":"2026-06-12T01:10:15.925068+00:00"}