{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OBGLDID3E7UGW33J3UI4OXBFQ3","short_pith_number":"pith:OBGLDID3","schema_version":"1.0","canonical_sha256":"704cb1a07b27e86b6f69dd11c75c2586eda8e689eec6ca3af8117e6b9c20df95","source":{"kind":"arxiv","id":"1103.5336","version":2},"attestation_state":"computed","paper":{"title":"Bounded-rank tensors are defined in bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Jan Draisma, Jochen Kuttler","submitted_at":"2011-03-28T12:10:58Z","abstract_excerpt":"Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this statement for tensors of arbitrary dimension, where matrices correspond to two-dimensional tensors. More specifically, we prove that for each k there exists an upper bound d = d(k) such that tensors of border rank at most k are defined by the vanishing of polynomials of degree at most d, regardless of the dimension of the tensor and regardless of its sizes in e"},"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":"1103.5336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-03-28T12:10:58Z","cross_cats_sorted":[],"title_canon_sha256":"451dcdebc2171b2f565fc80728293e48a74eb19012747c363db69658a67bef5f","abstract_canon_sha256":"7b9f778c6940de24c186933d1affd1b01ffac4a9544518386c2b8e9293b4f128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:32.749479Z","signature_b64":"Kh/pfupowbb9NoEtFeHb3fGoi7GGS76Tv3hcAvHd2NUz/sGF3DZ4mZcHPrN3pZ0wsLEiXElWPJzo/symYDMPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"704cb1a07b27e86b6f69dd11c75c2586eda8e689eec6ca3af8117e6b9c20df95","last_reissued_at":"2026-05-18T02:29:32.748992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:32.748992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded-rank tensors are defined in bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Jan Draisma, Jochen Kuttler","submitted_at":"2011-03-28T12:10:58Z","abstract_excerpt":"Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this statement for tensors of arbitrary dimension, where matrices correspond to two-dimensional tensors. More specifically, we prove that for each k there exists an upper bound d = d(k) such that tensors of border rank at most k are defined by the vanishing of polynomials of degree at most d, regardless of the dimension of the tensor and regardless of its sizes in e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5336","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5336","created_at":"2026-05-18T02:29:32.749052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5336v2","created_at":"2026-05-18T02:29:32.749052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5336","created_at":"2026-05-18T02:29:32.749052+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBGLDID3E7UG","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBGLDID3E7UGW33J","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBGLDID3","created_at":"2026-05-18T12:26:37.096874+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/OBGLDID3E7UGW33J3UI4OXBFQ3","json":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3.json","graph_json":"https://pith.science/api/pith-number/OBGLDID3E7UGW33J3UI4OXBFQ3/graph.json","events_json":"https://pith.science/api/pith-number/OBGLDID3E7UGW33J3UI4OXBFQ3/events.json","paper":"https://pith.science/paper/OBGLDID3"},"agent_actions":{"view_html":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3","download_json":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3.json","view_paper":"https://pith.science/paper/OBGLDID3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5336&json=true","fetch_graph":"https://pith.science/api/pith-number/OBGLDID3E7UGW33J3UI4OXBFQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/OBGLDID3E7UGW33J3UI4OXBFQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3/action/storage_attestation","attest_author":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3/action/author_attestation","sign_citation":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3/action/citation_signature","submit_replication":"https://pith.science/pith/OBGLDID3E7UGW33J3UI4OXBFQ3/action/replication_record"}},"created_at":"2026-05-18T02:29:32.749052+00:00","updated_at":"2026-05-18T02:29:32.749052+00:00"}