{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VNPHRG3VSWK4IFJVPD67FNBPWT","short_pith_number":"pith:VNPHRG3V","schema_version":"1.0","canonical_sha256":"ab5e789b759595c4153578fdf2b42fb4c11a15b970a0a74718378f5737de47e0","source":{"kind":"arxiv","id":"1704.07406","version":1},"attestation_state":"computed","paper":{"title":"Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arman Yousefi, Rafail Ostrovsky, Yuval Rabani","submitted_at":"2017-04-24T18:37:25Z","abstract_excerpt":"Osborne's iteration is a method for balancing $n\\times n$ matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral computation. The iteration can be implemented in any norm over $\\mathbb{R}^n$, but it is normally used in the $L_2$ norm. The choice of norm not only affects the desired balance condition, but also defines the iterated balancing step itself.\n  In this paper we focus on Osborne's iteration in any $L_p$ norm, where $p < \\infty$. We design a specific implementation of Osborne's iteration in any $L_p$ norm that converges"},"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":"1704.07406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T18:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"8ae2cc33ed02a2b3c44cdb3fde925b82d72947f956f996510cdebcf78d051002","abstract_canon_sha256":"ffedd685821c72820ede458840c03f0bd505fae5c8c7321f3608d02ac52d86eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:38.194442Z","signature_b64":"+vGcT50w3Jj2JHTdZHZnqaOyMJcF7fooukWteMrPnotpqJEebMl2trmlWin4eGJpdCOjkaPT4KvJmtnP10jGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5e789b759595c4153578fdf2b42fb4c11a15b970a0a74718378f5737de47e0","last_reissued_at":"2026-05-18T00:45:38.193854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:38.193854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arman Yousefi, Rafail Ostrovsky, Yuval Rabani","submitted_at":"2017-04-24T18:37:25Z","abstract_excerpt":"Osborne's iteration is a method for balancing $n\\times n$ matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral computation. The iteration can be implemented in any norm over $\\mathbb{R}^n$, but it is normally used in the $L_2$ norm. The choice of norm not only affects the desired balance condition, but also defines the iterated balancing step itself.\n  In this paper we focus on Osborne's iteration in any $L_p$ norm, where $p < \\infty$. We design a specific implementation of Osborne's iteration in any $L_p$ norm that converges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07406","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":""},"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":"1704.07406","created_at":"2026-05-18T00:45:38.193991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07406v1","created_at":"2026-05-18T00:45:38.193991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07406","created_at":"2026-05-18T00:45:38.193991+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNPHRG3VSWK4","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNPHRG3VSWK4IFJV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNPHRG3V","created_at":"2026-05-18T12:31:49.984773+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/VNPHRG3VSWK4IFJVPD67FNBPWT","json":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT.json","graph_json":"https://pith.science/api/pith-number/VNPHRG3VSWK4IFJVPD67FNBPWT/graph.json","events_json":"https://pith.science/api/pith-number/VNPHRG3VSWK4IFJVPD67FNBPWT/events.json","paper":"https://pith.science/paper/VNPHRG3V"},"agent_actions":{"view_html":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT","download_json":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT.json","view_paper":"https://pith.science/paper/VNPHRG3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07406&json=true","fetch_graph":"https://pith.science/api/pith-number/VNPHRG3VSWK4IFJVPD67FNBPWT/graph.json","fetch_events":"https://pith.science/api/pith-number/VNPHRG3VSWK4IFJVPD67FNBPWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT/action/storage_attestation","attest_author":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT/action/author_attestation","sign_citation":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT/action/citation_signature","submit_replication":"https://pith.science/pith/VNPHRG3VSWK4IFJVPD67FNBPWT/action/replication_record"}},"created_at":"2026-05-18T00:45:38.193991+00:00","updated_at":"2026-05-18T00:45:38.193991+00:00"}