{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UCQOTFC5MRM5ZY43VGRRGDAUPH","short_pith_number":"pith:UCQOTFC5","schema_version":"1.0","canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","source":{"kind":"arxiv","id":"1611.01559","version":1},"attestation_state":"computed","paper":{"title":"How hard is the tensor rank?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yaroslav Shitov","submitted_at":"2016-11-04T22:46:27Z","abstract_excerpt":"We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time equivalent to solving a system of polynomial equations over this integral domain. Our result gives a complete description of the algorithmic complexity of tensor rank and allows one to solve several known open problems. In particular, the tensor rank over $\\mathbb{Z}$ turns out to be undecidable, which answers the question posed by Gonzalez and Ja'Ja' in 1980. "},"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":"1611.01559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T22:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"0270e2f1b77e43bb49157af9601549346875daa7795ab3b2599f67343e83cd18","abstract_canon_sha256":"1686064a2458b04bb2b49f5b269a7b1aea3662c9ef09f892097f4ca0f5c84bbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.010609Z","signature_b64":"2YucKcuDrDlYcAk0XHmgGKucaVg5q5nHILGjMfCR7KKdWZuNj+XTcTwOppw4yWkxJVqkk3jTKvTL1WyOPIKPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","last_reissued_at":"2026-05-18T01:00:05.010129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.010129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How hard is the tensor rank?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yaroslav Shitov","submitted_at":"2016-11-04T22:46:27Z","abstract_excerpt":"We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time equivalent to solving a system of polynomial equations over this integral domain. Our result gives a complete description of the algorithmic complexity of tensor rank and allows one to solve several known open problems. In particular, the tensor rank over $\\mathbb{Z}$ turns out to be undecidable, which answers the question posed by Gonzalez and Ja'Ja' in 1980. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01559","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":""},"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":"1611.01559","created_at":"2026-05-18T01:00:05.010206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01559v1","created_at":"2026-05-18T01:00:05.010206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01559","created_at":"2026-05-18T01:00:05.010206+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCQOTFC5MRM5","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCQOTFC5MRM5ZY43","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCQOTFC5","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.11701","citing_title":"Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH","json":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH.json","graph_json":"https://pith.science/api/pith-number/UCQOTFC5MRM5ZY43VGRRGDAUPH/graph.json","events_json":"https://pith.science/api/pith-number/UCQOTFC5MRM5ZY43VGRRGDAUPH/events.json","paper":"https://pith.science/paper/UCQOTFC5"},"agent_actions":{"view_html":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH","download_json":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH.json","view_paper":"https://pith.science/paper/UCQOTFC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01559&json=true","fetch_graph":"https://pith.science/api/pith-number/UCQOTFC5MRM5ZY43VGRRGDAUPH/graph.json","fetch_events":"https://pith.science/api/pith-number/UCQOTFC5MRM5ZY43VGRRGDAUPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/action/storage_attestation","attest_author":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/action/author_attestation","sign_citation":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/action/citation_signature","submit_replication":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/action/replication_record"}},"created_at":"2026-05-18T01:00:05.010206+00:00","updated_at":"2026-05-18T01:00:05.010206+00:00"}