{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NSKY7XGZ4SPTGMSDUYPFFJT4IL","short_pith_number":"pith:NSKY7XGZ","schema_version":"1.0","canonical_sha256":"6c958fdcd9e49f333243a61e52a67c42ebd1e5ce7f5bcf30b5c829d92a8edeb6","source":{"kind":"arxiv","id":"0903.4569","version":3},"attestation_state":"computed","paper":{"title":"A note on the O(n)-storage implementation of the GKO algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Federico Poloni","submitted_at":"2009-03-26T13:18:57Z","abstract_excerpt":"We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems with Cauchy-like matrix. Despite its slightly higher computational cost, this new algorithm makes a more efficient use of the processor cache memory. Thus, for matrices of size larger than about 500-1000, it outperforms the existing algorithms.\n  We present an applicative case of Cauchy-like matrices with non-reconstructible main diagonal. In this special instance, the O(n) space algorithms can be adapted nicely to provide an efficient implementation of basic linear algebra operations in t"},"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":"0903.4569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-03-26T13:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"950b8e7f83fda409a2f0e35aec0d9426127d7f29d4ee034c3644c44aaca88052","abstract_canon_sha256":"1a05fde5aa232a355fe9f7564234962a8d6ae85d8ab72091845a147b0c2d6340"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.311446Z","signature_b64":"hokp0N34k8i0pRjmCFiuhyCHuSkUl/dF1kHJMlGbwSz+kVBt9gC00psxlpCJ3N+GFi7sHjN7CSNZUdk4ctFsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c958fdcd9e49f333243a61e52a67c42ebd1e5ce7f5bcf30b5c829d92a8edeb6","last_reissued_at":"2026-05-18T04:23:22.310973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.310973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the O(n)-storage implementation of the GKO algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Federico Poloni","submitted_at":"2009-03-26T13:18:57Z","abstract_excerpt":"We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems with Cauchy-like matrix. Despite its slightly higher computational cost, this new algorithm makes a more efficient use of the processor cache memory. Thus, for matrices of size larger than about 500-1000, it outperforms the existing algorithms.\n  We present an applicative case of Cauchy-like matrices with non-reconstructible main diagonal. In this special instance, the O(n) space algorithms can be adapted nicely to provide an efficient implementation of basic linear algebra operations in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4569","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":"0903.4569","created_at":"2026-05-18T04:23:22.311043+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.4569v3","created_at":"2026-05-18T04:23:22.311043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4569","created_at":"2026-05-18T04:23:22.311043+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSKY7XGZ4SPT","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSKY7XGZ4SPTGMSD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSKY7XGZ","created_at":"2026-05-18T12:26:00.592388+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/NSKY7XGZ4SPTGMSDUYPFFJT4IL","json":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL.json","graph_json":"https://pith.science/api/pith-number/NSKY7XGZ4SPTGMSDUYPFFJT4IL/graph.json","events_json":"https://pith.science/api/pith-number/NSKY7XGZ4SPTGMSDUYPFFJT4IL/events.json","paper":"https://pith.science/paper/NSKY7XGZ"},"agent_actions":{"view_html":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL","download_json":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL.json","view_paper":"https://pith.science/paper/NSKY7XGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.4569&json=true","fetch_graph":"https://pith.science/api/pith-number/NSKY7XGZ4SPTGMSDUYPFFJT4IL/graph.json","fetch_events":"https://pith.science/api/pith-number/NSKY7XGZ4SPTGMSDUYPFFJT4IL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL/action/storage_attestation","attest_author":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL/action/author_attestation","sign_citation":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL/action/citation_signature","submit_replication":"https://pith.science/pith/NSKY7XGZ4SPTGMSDUYPFFJT4IL/action/replication_record"}},"created_at":"2026-05-18T04:23:22.311043+00:00","updated_at":"2026-05-18T04:23:22.311043+00:00"}