{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GS5ID4QXDNOALFG3Z4QJTJEM2M","short_pith_number":"pith:GS5ID4QX","canonical_record":{"source":{"id":"1011.3432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-11-15T15:58:19Z","cross_cats_sorted":[],"title_canon_sha256":"18aee16806bbc7bb9e74ff9de334dadf00f5378ed8f773f47a75a52a1d5401ea","abstract_canon_sha256":"9e69efe98c0d3cf192ea57e1fceadfdd26be40ce135679163568922199669e95"},"schema_version":"1.0"},"canonical_sha256":"34ba81f2171b5c0594dbcf2099a48cd30afb92d0fcfedb144c58aff20384c3f9","source":{"kind":"arxiv","id":"1011.3432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3432","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3432v1","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3432","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"GS5ID4QXDNOA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GS5ID4QXDNOALFG3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GS5ID4QX","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GS5ID4QXDNOALFG3Z4QJTJEM2M","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-11-15T15:58:19Z","cross_cats_sorted":[],"title_canon_sha256":"18aee16806bbc7bb9e74ff9de334dadf00f5378ed8f773f47a75a52a1d5401ea","abstract_canon_sha256":"9e69efe98c0d3cf192ea57e1fceadfdd26be40ce135679163568922199669e95"},"schema_version":"1.0"},"canonical_sha256":"34ba81f2171b5c0594dbcf2099a48cd30afb92d0fcfedb144c58aff20384c3f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:55.862150Z","signature_b64":"RHR2vbzzjxoC/ix4ozfKwr4MCfbStm8VvjblkPCSZckLitx7kgm2mu7EDFzMkTI6DTXRyFQwGkAd10C8j0gMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ba81f2171b5c0594dbcf2099a48cd30afb92d0fcfedb144c58aff20384c3f9","last_reissued_at":"2026-05-18T04:35:55.861679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:55.861679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3432","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-18T04:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qq9HD4B/80kb875xgil6mhMn2eza6EzL9QZ5969bbQ2BvbREfJ4cxbERtGlhk6MxmPvEELoKpucujUcWjVoIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:10:18.541270Z"},"content_sha256":"a518d7de373da032f1b4353a7d98e67fdaf149bbf213c1f939773ca74ed981c2","schema_version":"1.0","event_id":"sha256:a518d7de373da032f1b4353a7d98e67fdaf149bbf213c1f939773ca74ed981c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GS5ID4QXDNOALFG3Z4QJTJEM2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Generalized Schur Decomposition and the rank-$R$ set of real $I\\times J\\times 2$ arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alwin Stegeman","submitted_at":"2010-11-15T15:58:19Z","abstract_excerpt":"It is known that a best low-rank approximation to multi-way arrays or higher-order tensors may not exist. This is due to the fact that the set of multi-way arrays with rank at most $R$ is not closed. Nonexistence of the best low-rank approximation results in diverging rank-1 components when an attempt is made to compute the approximation. Recently, a solution to this problem has been proposed for real $I\\times J\\times 2$ arrays. Instead of a best rank-$R$ approximation the best fitting Generalized Schur Decomposition (GSD) is computed. Under the restriction of nonsingular upper triangular matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3432","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-18T04:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c90MRw+ECRPWsFoTospqJVZoGRjFZYuA/7e8n/M4NskW5dHhJgleVm/EU5KXg1t+YpC0FnyKKIutFdRSJXrFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:10:18.541662Z"},"content_sha256":"65bdc4dc8444d7546e007e4763cd811304635fbe2b522559f96af34c5c8cc8f9","schema_version":"1.0","event_id":"sha256:65bdc4dc8444d7546e007e4763cd811304635fbe2b522559f96af34c5c8cc8f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/bundle.json","state_url":"https://pith.science/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/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-05-30T06:10:18Z","links":{"resolver":"https://pith.science/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M","bundle":"https://pith.science/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/bundle.json","state":"https://pith.science/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GS5ID4QXDNOALFG3Z4QJTJEM2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GS5ID4QXDNOALFG3Z4QJTJEM2M","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":"9e69efe98c0d3cf192ea57e1fceadfdd26be40ce135679163568922199669e95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-11-15T15:58:19Z","title_canon_sha256":"18aee16806bbc7bb9e74ff9de334dadf00f5378ed8f773f47a75a52a1d5401ea"},"schema_version":"1.0","source":{"id":"1011.3432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3432","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3432v1","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3432","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"GS5ID4QXDNOA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GS5ID4QXDNOALFG3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GS5ID4QX","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:65bdc4dc8444d7546e007e4763cd811304635fbe2b522559f96af34c5c8cc8f9","target":"graph","created_at":"2026-05-18T04:35:55Z","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":"It is known that a best low-rank approximation to multi-way arrays or higher-order tensors may not exist. This is due to the fact that the set of multi-way arrays with rank at most $R$ is not closed. Nonexistence of the best low-rank approximation results in diverging rank-1 components when an attempt is made to compute the approximation. Recently, a solution to this problem has been proposed for real $I\\times J\\times 2$ arrays. Instead of a best rank-$R$ approximation the best fitting Generalized Schur Decomposition (GSD) is computed. Under the restriction of nonsingular upper triangular matr","authors_text":"Alwin Stegeman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-11-15T15:58:19Z","title":"The Generalized Schur Decomposition and the rank-$R$ set of real $I\\times J\\times 2$ arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3432","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:a518d7de373da032f1b4353a7d98e67fdaf149bbf213c1f939773ca74ed981c2","target":"record","created_at":"2026-05-18T04:35:55Z","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":"9e69efe98c0d3cf192ea57e1fceadfdd26be40ce135679163568922199669e95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-11-15T15:58:19Z","title_canon_sha256":"18aee16806bbc7bb9e74ff9de334dadf00f5378ed8f773f47a75a52a1d5401ea"},"schema_version":"1.0","source":{"id":"1011.3432","kind":"arxiv","version":1}},"canonical_sha256":"34ba81f2171b5c0594dbcf2099a48cd30afb92d0fcfedb144c58aff20384c3f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ba81f2171b5c0594dbcf2099a48cd30afb92d0fcfedb144c58aff20384c3f9","first_computed_at":"2026-05-18T04:35:55.861679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:55.861679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RHR2vbzzjxoC/ix4ozfKwr4MCfbStm8VvjblkPCSZckLitx7kgm2mu7EDFzMkTI6DTXRyFQwGkAd10C8j0gMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:55.862150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a518d7de373da032f1b4353a7d98e67fdaf149bbf213c1f939773ca74ed981c2","sha256:65bdc4dc8444d7546e007e4763cd811304635fbe2b522559f96af34c5c8cc8f9"],"state_sha256":"1e66526e5a66cd6cba63e72327af53131262690a986172966b7bd321d0741469"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os0JexGzAh2gOu+ThcmRt6oDBE7XQN6CR6kzZTwwJXsRQGUWv/vkz0nlu6iqkOAtjKhJn64V+dj/fTLpSuqvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:10:18.544020Z","bundle_sha256":"a293a8e321453ba7607f53bb9089363dc24739ec1bce464c13144eaaf50fc85a"}}