{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JH3QZ6DE63FVTKGEPAI7Z4737O","short_pith_number":"pith:JH3QZ6DE","schema_version":"1.0","canonical_sha256":"49f70cf864f6cb59a8c47811fcf3fbfb9b30a68804736c1a7c964634e1d9a2fa","source":{"kind":"arxiv","id":"1809.02334","version":3},"attestation_state":"computed","paper":{"title":"Rectangular maximum volume and projective volume search algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexander Osinsky","submitted_at":"2018-09-07T07:46:32Z","abstract_excerpt":"New methods for finding submatrices of (locally) maximal volume and large projective volume are proposed and studied. Detailed analysis is also carried out for existing methods. The effectiveness of the new methods is shown in the construction of cross approximations, and estimates are also proved in the case of their application for the search for a strongly nondegenerate submatrix. Much attention is also paid to the choice of the starting submatrix."},"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":"1809.02334","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-07T07:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"3c5ef9e326e6ce5a6165b51fb2e8c3271062855faac3c99648f8f5a1abaf41f7","abstract_canon_sha256":"576188f09912af9b3b1dd890f41ee3f8675e30070c8812193dc40bbbeaf3bf7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:50.815457Z","signature_b64":"u83/qlvLRgCcWar4QYLFVk9SQxJw3EWSLXbJft1hvKwsPyu5mMe3UBqG6iEWAy3FkYkyKq1SC8nz+IlTnSsOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49f70cf864f6cb59a8c47811fcf3fbfb9b30a68804736c1a7c964634e1d9a2fa","last_reissued_at":"2026-05-17T23:48:50.814671Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:50.814671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rectangular maximum volume and projective volume search algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexander Osinsky","submitted_at":"2018-09-07T07:46:32Z","abstract_excerpt":"New methods for finding submatrices of (locally) maximal volume and large projective volume are proposed and studied. Detailed analysis is also carried out for existing methods. The effectiveness of the new methods is shown in the construction of cross approximations, and estimates are also proved in the case of their application for the search for a strongly nondegenerate submatrix. Much attention is also paid to the choice of the starting submatrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02334","kind":"arxiv","version":3},"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":"1809.02334","created_at":"2026-05-17T23:48:50.814805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02334v3","created_at":"2026-05-17T23:48:50.814805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02334","created_at":"2026-05-17T23:48:50.814805+00:00"},{"alias_kind":"pith_short_12","alias_value":"JH3QZ6DE63FV","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JH3QZ6DE63FVTKGE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JH3QZ6DE","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.05247","citing_title":"Accelerated alternating minimization algorithm for low-rank approximations in the Chebyshev norm","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14418","citing_title":"Subset selection for matrices by column exchange","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O","json":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O.json","graph_json":"https://pith.science/api/pith-number/JH3QZ6DE63FVTKGEPAI7Z4737O/graph.json","events_json":"https://pith.science/api/pith-number/JH3QZ6DE63FVTKGEPAI7Z4737O/events.json","paper":"https://pith.science/paper/JH3QZ6DE"},"agent_actions":{"view_html":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O","download_json":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O.json","view_paper":"https://pith.science/paper/JH3QZ6DE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02334&json=true","fetch_graph":"https://pith.science/api/pith-number/JH3QZ6DE63FVTKGEPAI7Z4737O/graph.json","fetch_events":"https://pith.science/api/pith-number/JH3QZ6DE63FVTKGEPAI7Z4737O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O/action/storage_attestation","attest_author":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O/action/author_attestation","sign_citation":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O/action/citation_signature","submit_replication":"https://pith.science/pith/JH3QZ6DE63FVTKGEPAI7Z4737O/action/replication_record"}},"created_at":"2026-05-17T23:48:50.814805+00:00","updated_at":"2026-05-17T23:48:50.814805+00:00"}