{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UCQOTFC5MRM5ZY43VGRRGDAUPH","short_pith_number":"pith:UCQOTFC5","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"},"canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","source":{"kind":"arxiv","id":"1611.01559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01559","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01559v1","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01559","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCQOTFC5MRM5","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UCQOTFC5MRM5ZY43","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UCQOTFC5","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UCQOTFC5MRM5ZY43VGRRGDAUPH","target":"record","payload":{"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"},"canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","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"},"source_kind":"arxiv","source_id":"1611.01559","source_version":1,"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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXPiGaB1HjNVVi5wg6lNteaUZtPk7Z9Rz1qulPRSc6KIqwHCwz2isrjtHIma0PIzOgpZ5A6j4+BKI2249DIeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:00:00.497920Z"},"content_sha256":"54a3471e27d0580d5730d59f747e16882fc4810d012c0960816e3258e7988b2c","schema_version":"1.0","event_id":"sha256:54a3471e27d0580d5730d59f747e16882fc4810d012c0960816e3258e7988b2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UCQOTFC5MRM5ZY43VGRRGDAUPH","target":"graph","payload":{"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"},"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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T68jmndkwixn5QoQXLaCiBgh4cr0HgytP4ejrEo06k+GBc9OUVmXlYDv1IEqJpg8uOO1OFUHZywO7tnqhu+QBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:00:00.498250Z"},"content_sha256":"76dc4b92966f9a9c0f99e5984b69354eb1eda06775623bfaad44d1edc8564cf9","schema_version":"1.0","event_id":"sha256:76dc4b92966f9a9c0f99e5984b69354eb1eda06775623bfaad44d1edc8564cf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/bundle.json","state_url":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/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-29T22:00:00Z","links":{"resolver":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH","bundle":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/bundle.json","state":"https://pith.science/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCQOTFC5MRM5ZY43VGRRGDAUPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UCQOTFC5MRM5ZY43VGRRGDAUPH","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":"1686064a2458b04bb2b49f5b269a7b1aea3662c9ef09f892097f4ca0f5c84bbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T22:46:27Z","title_canon_sha256":"0270e2f1b77e43bb49157af9601549346875daa7795ab3b2599f67343e83cd18"},"schema_version":"1.0","source":{"id":"1611.01559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01559","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01559v1","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01559","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCQOTFC5MRM5","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UCQOTFC5MRM5ZY43","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UCQOTFC5","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:76dc4b92966f9a9c0f99e5984b69354eb1eda06775623bfaad44d1edc8564cf9","target":"graph","created_at":"2026-05-18T01:00:05Z","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 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. ","authors_text":"Yaroslav Shitov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T22:46:27Z","title":"How hard is the tensor rank?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01559","kind":"arxiv","version":1},"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:54a3471e27d0580d5730d59f747e16882fc4810d012c0960816e3258e7988b2c","target":"record","created_at":"2026-05-18T01:00:05Z","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":"1686064a2458b04bb2b49f5b269a7b1aea3662c9ef09f892097f4ca0f5c84bbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T22:46:27Z","title_canon_sha256":"0270e2f1b77e43bb49157af9601549346875daa7795ab3b2599f67343e83cd18"},"schema_version":"1.0","source":{"id":"1611.01559","kind":"arxiv","version":1}},"canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0a0e9945d6459dce39ba9a3130c1479f92cdfd5838a42e747a69f7ce056d892","first_computed_at":"2026-05-18T01:00:05.010129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.010129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2YucKcuDrDlYcAk0XHmgGKucaVg5q5nHILGjMfCR7KKdWZuNj+XTcTwOppw4yWkxJVqkk3jTKvTL1WyOPIKPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.010609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54a3471e27d0580d5730d59f747e16882fc4810d012c0960816e3258e7988b2c","sha256:76dc4b92966f9a9c0f99e5984b69354eb1eda06775623bfaad44d1edc8564cf9"],"state_sha256":"19e020208f7b2fc805447e90aadd39c1c59c04f2d8c78c8c4c64b66c3c31dcf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/8UuA8+OIVw1YK3W/VJ2ONw0oFQXIJU026JH2CSsGekUC1y66ftvsZU3qumWd8ccV1MPdkOqPTbKR0HQFo5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:00:00.500039Z","bundle_sha256":"48ca991cf696be37f8f37018fba9328d3fe7a6821c7d383fec29b2a00727ba4e"}}