{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E7BJWVBNELQS4UZQN7Z6ULAO6E","short_pith_number":"pith:E7BJWVBN","schema_version":"1.0","canonical_sha256":"27c29b542d22e12e53306ff3ea2c0ef1012d68c72d7686b7fb0df541668b7320","source":{"kind":"arxiv","id":"1012.3196","version":7},"attestation_state":"computed","paper":{"title":"Fast and accurate con-eigenvalue algorithm for optimal rational approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"G. Beylkin, T. S. Haut","submitted_at":"2010-12-15T00:10:54Z","abstract_excerpt":"The need to compute small con-eigenvalues and the associated con-eigenvectors of positive-definite Cauchy matrices naturally arises when constructing rational approximations with a (near) optimally small $L^{\\infty}$ error. Specifically, given a rational function with $n$ poles in the unit disk, a rational approximation with $m\\ll n$ poles in the unit disk may be obtained from the $m$th con-eigenvector of an $n\\times n$ Cauchy matrix, where the associated con-eigenvalue $\\lambda_{m}>0$ gives the approximation error in the $L^{\\infty}$ norm. Unfortunately, standard algorithms do not accurately "},"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":"1012.3196","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-12-15T00:10:54Z","cross_cats_sorted":[],"title_canon_sha256":"c982e1e439cceb02a74999312314afea5b030c0c069dd181d081d14e07dca72c","abstract_canon_sha256":"f5a0eb6e3fa9f19e112be4786fcc4189e44c3a479aaabeda73217177fe16fc4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:07.223114Z","signature_b64":"XdV/5pBBz/26V5lgW9UKOLoaOdKM7PdQYrAZ9Hg6khPDG4OdLYSyLAqMKPeJI4lxJEODD527NpezZQZBFUz6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27c29b542d22e12e53306ff3ea2c0ef1012d68c72d7686b7fb0df541668b7320","last_reissued_at":"2026-05-18T02:23:07.222541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:07.222541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and accurate con-eigenvalue algorithm for optimal rational approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"G. Beylkin, T. S. Haut","submitted_at":"2010-12-15T00:10:54Z","abstract_excerpt":"The need to compute small con-eigenvalues and the associated con-eigenvectors of positive-definite Cauchy matrices naturally arises when constructing rational approximations with a (near) optimally small $L^{\\infty}$ error. Specifically, given a rational function with $n$ poles in the unit disk, a rational approximation with $m\\ll n$ poles in the unit disk may be obtained from the $m$th con-eigenvector of an $n\\times n$ Cauchy matrix, where the associated con-eigenvalue $\\lambda_{m}>0$ gives the approximation error in the $L^{\\infty}$ norm. Unfortunately, standard algorithms do not accurately "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3196","kind":"arxiv","version":7},"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":"1012.3196","created_at":"2026-05-18T02:23:07.222627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3196v7","created_at":"2026-05-18T02:23:07.222627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3196","created_at":"2026-05-18T02:23:07.222627+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7BJWVBNELQS","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7BJWVBNELQS4UZQ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7BJWVBN","created_at":"2026-05-18T12:26:06.534383+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/E7BJWVBNELQS4UZQN7Z6ULAO6E","json":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E.json","graph_json":"https://pith.science/api/pith-number/E7BJWVBNELQS4UZQN7Z6ULAO6E/graph.json","events_json":"https://pith.science/api/pith-number/E7BJWVBNELQS4UZQN7Z6ULAO6E/events.json","paper":"https://pith.science/paper/E7BJWVBN"},"agent_actions":{"view_html":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E","download_json":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E.json","view_paper":"https://pith.science/paper/E7BJWVBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3196&json=true","fetch_graph":"https://pith.science/api/pith-number/E7BJWVBNELQS4UZQN7Z6ULAO6E/graph.json","fetch_events":"https://pith.science/api/pith-number/E7BJWVBNELQS4UZQN7Z6ULAO6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E/action/storage_attestation","attest_author":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E/action/author_attestation","sign_citation":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E/action/citation_signature","submit_replication":"https://pith.science/pith/E7BJWVBNELQS4UZQN7Z6ULAO6E/action/replication_record"}},"created_at":"2026-05-18T02:23:07.222627+00:00","updated_at":"2026-05-18T02:23:07.222627+00:00"}