{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7AEVOHDNXWP5SHIIJXCQSS3CEE","short_pith_number":"pith:7AEVOHDN","schema_version":"1.0","canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","source":{"kind":"arxiv","id":"1712.05742","version":2},"attestation_state":"computed","paper":{"title":"On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AG"],"primary_cat":"math.NA","authors_text":"Jos\\'e Henrique De Morais Goulart, Pierre Comon","submitted_at":"2017-12-15T16:40:23Z","abstract_excerpt":"Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \\times n$ pencil $A + \\lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a pair of minimal ranks, which is unique up to a permutation. This notion can be defined for matrix pencils and, more generally, also for matrix polynomials of arbitrary degree. In this paper, we provide a formal definition of the minimal ranks, discuss its properties and the natural hierarchy it induces in a pencil space. Then, we show how the minimal ranks "},"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":"1712.05742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-15T16:40:23Z","cross_cats_sorted":["cs.NA","math.AG"],"title_canon_sha256":"d89af26c460370456198786c143cf9ba3379c11b776a0745c6a74ec09b2a3697","abstract_canon_sha256":"c3805f3e5a278600d5da249c15a80220fd17ca86e624000abc1a347ea097ccf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:53.821515Z","signature_b64":"UiCwFkWWP+CwDAKcKQFDRwi5yccuiLmLzF8DdWnybud197lOrPfGEBKNS3xEDZy4N485+M1pPQJNs7IIhunRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","last_reissued_at":"2026-05-18T00:12:53.820903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:53.820903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AG"],"primary_cat":"math.NA","authors_text":"Jos\\'e Henrique De Morais Goulart, Pierre Comon","submitted_at":"2017-12-15T16:40:23Z","abstract_excerpt":"Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \\times n$ pencil $A + \\lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a pair of minimal ranks, which is unique up to a permutation. This notion can be defined for matrix pencils and, more generally, also for matrix polynomials of arbitrary degree. In this paper, we provide a formal definition of the minimal ranks, discuss its properties and the natural hierarchy it induces in a pencil space. Then, we show how the minimal ranks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05742","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":"1712.05742","created_at":"2026-05-18T00:12:53.820983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05742v2","created_at":"2026-05-18T00:12:53.820983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05742","created_at":"2026-05-18T00:12:53.820983+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AEVOHDNXWP5","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AEVOHDNXWP5SHII","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AEVOHDN","created_at":"2026-05-18T12:31:03.183658+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/7AEVOHDNXWP5SHIIJXCQSS3CEE","json":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE.json","graph_json":"https://pith.science/api/pith-number/7AEVOHDNXWP5SHIIJXCQSS3CEE/graph.json","events_json":"https://pith.science/api/pith-number/7AEVOHDNXWP5SHIIJXCQSS3CEE/events.json","paper":"https://pith.science/paper/7AEVOHDN"},"agent_actions":{"view_html":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE","download_json":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE.json","view_paper":"https://pith.science/paper/7AEVOHDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05742&json=true","fetch_graph":"https://pith.science/api/pith-number/7AEVOHDNXWP5SHIIJXCQSS3CEE/graph.json","fetch_events":"https://pith.science/api/pith-number/7AEVOHDNXWP5SHIIJXCQSS3CEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/action/storage_attestation","attest_author":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/action/author_attestation","sign_citation":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/action/citation_signature","submit_replication":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/action/replication_record"}},"created_at":"2026-05-18T00:12:53.820983+00:00","updated_at":"2026-05-18T00:12:53.820983+00:00"}