{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6IFMBBENNG6WKTCIZI67YOT24W","short_pith_number":"pith:6IFMBBEN","schema_version":"1.0","canonical_sha256":"f20ac0848d69bd654c48ca3dfc3a7ae5aaf5a0fc9663ef5aa31b180a9f8fecef","source":{"kind":"arxiv","id":"2408.16631","version":1},"attestation_state":"computed","paper":{"title":"Submatrices with the best-bounded inverses: Studying $\\mathds{R}^{n \\times 2}$ and $\\mathds{C}^{n \\times 2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.DG"],"primary_cat":"math.NA","authors_text":"Yuri Nesterenko","submitted_at":"2024-08-29T15:38:07Z","abstract_excerpt":"In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in Euclidean spaces.\n  This study thereby provides a new geometrical point of view on the $2$-dimensional case of the problem formulated by Goreinov, Tyrtyshnikov and Zamarashkin \\cite{GTZ1997}, and at the same time presents a new application of the results by Hausmann and Knutson \\cite{HK1997}."},"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":"2408.16631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-08-29T15:38:07Z","cross_cats_sorted":["cs.NA","math.DG"],"title_canon_sha256":"3dc10e48cbf55e1f76227c1605dad54b8662cde1780c6513f7a3f902be80c310","abstract_canon_sha256":"99e9e03f6f23331c7cd4605c5ca4d216aea80cac7e08acfa64a44a876b4c31ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:44.269408Z","signature_b64":"tXiHXpIW307S38ALDFF4Jn+nid7iKHA4MuIrtg5twuBd4IZ0MjgqoVI2sk+qQHSDKjwm6c0JsBbpuqt+PAZoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20ac0848d69bd654c48ca3dfc3a7ae5aaf5a0fc9663ef5aa31b180a9f8fecef","last_reissued_at":"2026-07-05T09:00:44.268953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:44.268953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submatrices with the best-bounded inverses: Studying $\\mathds{R}^{n \\times 2}$ and $\\mathds{C}^{n \\times 2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.DG"],"primary_cat":"math.NA","authors_text":"Yuri Nesterenko","submitted_at":"2024-08-29T15:38:07Z","abstract_excerpt":"In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in Euclidean spaces.\n  This study thereby provides a new geometrical point of view on the $2$-dimensional case of the problem formulated by Goreinov, Tyrtyshnikov and Zamarashkin \\cite{GTZ1997}, and at the same time presents a new application of the results by Hausmann and Knutson \\cite{HK1997}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16631","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.16631/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.16631","created_at":"2026-07-05T09:00:44.269009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.16631v1","created_at":"2026-07-05T09:00:44.269009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16631","created_at":"2026-07-05T09:00:44.269009+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IFMBBENNG6W","created_at":"2026-07-05T09:00:44.269009+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IFMBBENNG6WKTCI","created_at":"2026-07-05T09:00:44.269009+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IFMBBEN","created_at":"2026-07-05T09:00:44.269009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24087","citing_title":"Submatrices with the best-bounded inverses: an asymptotically tight upper bound for $\\mathbb{C}^{n \\times 2}$","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05944","citing_title":"On the submatrices with the best-bounded inverses","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14050","citing_title":"Submatrices with the best-bounded inverses: the equality criterion for $\\mathbb{R}^{n \\times 2}$","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W","json":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W.json","graph_json":"https://pith.science/api/pith-number/6IFMBBENNG6WKTCIZI67YOT24W/graph.json","events_json":"https://pith.science/api/pith-number/6IFMBBENNG6WKTCIZI67YOT24W/events.json","paper":"https://pith.science/paper/6IFMBBEN"},"agent_actions":{"view_html":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W","download_json":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W.json","view_paper":"https://pith.science/paper/6IFMBBEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.16631&json=true","fetch_graph":"https://pith.science/api/pith-number/6IFMBBENNG6WKTCIZI67YOT24W/graph.json","fetch_events":"https://pith.science/api/pith-number/6IFMBBENNG6WKTCIZI67YOT24W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W/action/storage_attestation","attest_author":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W/action/author_attestation","sign_citation":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W/action/citation_signature","submit_replication":"https://pith.science/pith/6IFMBBENNG6WKTCIZI67YOT24W/action/replication_record"}},"created_at":"2026-07-05T09:00:44.269009+00:00","updated_at":"2026-07-05T09:00:44.269009+00:00"}