{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XJ6CELGVS6Y6IP6TSXD6RPG5PL","short_pith_number":"pith:XJ6CELGV","schema_version":"1.0","canonical_sha256":"ba7c222cd597b1e43fd395c7e8bcdd7ad54f6e45b1cdd61288786c45d9df7c5a","source":{"kind":"arxiv","id":"1309.5727","version":2},"attestation_state":"computed","paper":{"title":"On the (non)existence of best low-rank approximations of generic IxJx2 arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alwin Stegeman","submitted_at":"2013-09-23T08:43:13Z","abstract_excerpt":"Several conjectures and partial proofs have been formulated on the (non)existence of a best low-rank approximation of real-valued IxJx2 arrays. We analyze this problem using the Generalized Schur Decomposition and prove (non)existence of a best rank-R approximation for generic IxJx2 arrays, for all values of I,J,R. Moreover, for cases where a best rank-R approximation exists on a set of positive volume only, we provide easy-to-check necessary and sufficient conditions for the existence of a best rank-R approximation."},"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":"1309.5727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-09-23T08:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"abcccfad46e00c10ff985b6bcf9f15d36168696a61c4c62f2f9871e3d7f586cd","abstract_canon_sha256":"f4a573c43cece06ec183a23736728d8d28874934ee51b38b30cb1243cac9655d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:38.090384Z","signature_b64":"ztLj8akxNrh4fre0NBnzGXME1FjaiOleTQTRybqk1cdByRQPZbNMWY1p9UcGEwV/mhsGMNTbXPHpzvh408y7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7c222cd597b1e43fd395c7e8bcdd7ad54f6e45b1cdd61288786c45d9df7c5a","last_reissued_at":"2026-05-18T02:03:38.089946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:38.089946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the (non)existence of best low-rank approximations of generic IxJx2 arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alwin Stegeman","submitted_at":"2013-09-23T08:43:13Z","abstract_excerpt":"Several conjectures and partial proofs have been formulated on the (non)existence of a best low-rank approximation of real-valued IxJx2 arrays. We analyze this problem using the Generalized Schur Decomposition and prove (non)existence of a best rank-R approximation for generic IxJx2 arrays, for all values of I,J,R. Moreover, for cases where a best rank-R approximation exists on a set of positive volume only, we provide easy-to-check necessary and sufficient conditions for the existence of a best rank-R approximation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5727","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":"1309.5727","created_at":"2026-05-18T02:03:38.090009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5727v2","created_at":"2026-05-18T02:03:38.090009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5727","created_at":"2026-05-18T02:03:38.090009+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJ6CELGVS6Y6","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJ6CELGVS6Y6IP6T","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJ6CELGV","created_at":"2026-05-18T12:28:06.772260+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/XJ6CELGVS6Y6IP6TSXD6RPG5PL","json":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL.json","graph_json":"https://pith.science/api/pith-number/XJ6CELGVS6Y6IP6TSXD6RPG5PL/graph.json","events_json":"https://pith.science/api/pith-number/XJ6CELGVS6Y6IP6TSXD6RPG5PL/events.json","paper":"https://pith.science/paper/XJ6CELGV"},"agent_actions":{"view_html":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL","download_json":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL.json","view_paper":"https://pith.science/paper/XJ6CELGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5727&json=true","fetch_graph":"https://pith.science/api/pith-number/XJ6CELGVS6Y6IP6TSXD6RPG5PL/graph.json","fetch_events":"https://pith.science/api/pith-number/XJ6CELGVS6Y6IP6TSXD6RPG5PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL/action/storage_attestation","attest_author":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL/action/author_attestation","sign_citation":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL/action/citation_signature","submit_replication":"https://pith.science/pith/XJ6CELGVS6Y6IP6TSXD6RPG5PL/action/replication_record"}},"created_at":"2026-05-18T02:03:38.090009+00:00","updated_at":"2026-05-18T02:03:38.090009+00:00"}