{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7AEVOHDNXWP5SHIIJXCQSS3CEE","short_pith_number":"pith:7AEVOHDN","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"},"canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","source":{"kind":"arxiv","id":"1712.05742","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05742","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05742v2","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05742","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"7AEVOHDNXWP5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7AEVOHDNXWP5SHII","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7AEVOHDN","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7AEVOHDNXWP5SHIIJXCQSS3CEE","target":"record","payload":{"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"},"canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","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"},"source_kind":"arxiv","source_id":"1712.05742","source_version":2,"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-18T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhk8GHJpJlh1sGJA69/H5bZsE4ib3+w3K1eFrSCYzG5Va8YwpZhuBG5XyDypa3JIlFATuTBql5sjkfV5oWVECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:14.262451Z"},"content_sha256":"36909ebcaa16f6d2765b8b25b870ee31397588baba5ecb7a1186c8d036be99dc","schema_version":"1.0","event_id":"sha256:36909ebcaa16f6d2765b8b25b870ee31397588baba5ecb7a1186c8d036be99dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7AEVOHDNXWP5SHIIJXCQSS3CEE","target":"graph","payload":{"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"},"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-18T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ/b+qN/ffk25MMA+II5ZWzM67Vvl5a9DsBmw0Z/TXpHlMSWXPMkkUgJJvFx8wJPYmSmmHm/ViW9ZaQwievcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:14.262889Z"},"content_sha256":"51bd70ea2003433688be78d31457e88f70cc6447dcdabe32f4f30197d7b9359c","schema_version":"1.0","event_id":"sha256:51bd70ea2003433688be78d31457e88f70cc6447dcdabe32f4f30197d7b9359c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/bundle.json","state_url":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/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-30T05:00:14Z","links":{"resolver":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE","bundle":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/bundle.json","state":"https://pith.science/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AEVOHDNXWP5SHIIJXCQSS3CEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7AEVOHDNXWP5SHIIJXCQSS3CEE","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":"c3805f3e5a278600d5da249c15a80220fd17ca86e624000abc1a347ea097ccf1","cross_cats_sorted":["cs.NA","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-15T16:40:23Z","title_canon_sha256":"d89af26c460370456198786c143cf9ba3379c11b776a0745c6a74ec09b2a3697"},"schema_version":"1.0","source":{"id":"1712.05742","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05742","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05742v2","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05742","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"7AEVOHDNXWP5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7AEVOHDNXWP5SHII","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7AEVOHDN","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:51bd70ea2003433688be78d31457e88f70cc6447dcdabe32f4f30197d7b9359c","target":"graph","created_at":"2026-05-18T00:12:53Z","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":"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 ","authors_text":"Jos\\'e Henrique De Morais Goulart, Pierre Comon","cross_cats":["cs.NA","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-15T16:40:23Z","title":"On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05742","kind":"arxiv","version":2},"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:36909ebcaa16f6d2765b8b25b870ee31397588baba5ecb7a1186c8d036be99dc","target":"record","created_at":"2026-05-18T00:12:53Z","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":"c3805f3e5a278600d5da249c15a80220fd17ca86e624000abc1a347ea097ccf1","cross_cats_sorted":["cs.NA","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-15T16:40:23Z","title_canon_sha256":"d89af26c460370456198786c143cf9ba3379c11b776a0745c6a74ec09b2a3697"},"schema_version":"1.0","source":{"id":"1712.05742","kind":"arxiv","version":2}},"canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f809571c6dbd9fd91d084dc5094b62211617ba89f06b7167ea78a118be0aad39","first_computed_at":"2026-05-18T00:12:53.820903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:53.820903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UiCwFkWWP+CwDAKcKQFDRwi5yccuiLmLzF8DdWnybud197lOrPfGEBKNS3xEDZy4N485+M1pPQJNs7IIhunRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:53.821515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05742","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36909ebcaa16f6d2765b8b25b870ee31397588baba5ecb7a1186c8d036be99dc","sha256:51bd70ea2003433688be78d31457e88f70cc6447dcdabe32f4f30197d7b9359c"],"state_sha256":"3d7988861b79796b59d9e4153124becaf34bb3977699fb37b80d47b4e6be04b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCx/RekLdQGuNQ+Mn9hc7KEAqDf/aB/tW6Oz1OBc7eEzK3iJHwGu5wrP09l0rLZImmMqLSTzi0RoLFQARyUZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:00:14.265729Z","bundle_sha256":"22a61ac2d0a04b0814e48311eb1ea995caf954d25992e59db173423201d5afce"}}