{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BHACWP7HZAMIL3T3YIJHTWBOQG","short_pith_number":"pith:BHACWP7H","canonical_record":{"source":{"id":"1412.2681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-08T17:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"346a025613e6761abc5ce497c3bad0b98e40f3ff8380de8a3cdf0bc9ef7e1b42","abstract_canon_sha256":"dff55fad1bf744fa06af7ca3d04aa024cd26d1e70333963995cd48dbf4d1813f"},"schema_version":"1.0"},"canonical_sha256":"09c02b3fe7c81885ee7bc21279d82e81accfc84439d530b7c5ca9c54ffd504a4","source":{"kind":"arxiv","id":"1412.2681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2681","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2681v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2681","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"BHACWP7HZAMI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHACWP7HZAMIL3T3","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHACWP7H","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BHACWP7HZAMIL3T3YIJHTWBOQG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-08T17:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"346a025613e6761abc5ce497c3bad0b98e40f3ff8380de8a3cdf0bc9ef7e1b42","abstract_canon_sha256":"dff55fad1bf744fa06af7ca3d04aa024cd26d1e70333963995cd48dbf4d1813f"},"schema_version":"1.0"},"canonical_sha256":"09c02b3fe7c81885ee7bc21279d82e81accfc84439d530b7c5ca9c54ffd504a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.114330Z","signature_b64":"0pzjyUB9BrDpDA1R0MsKKcT5xeMPL/jrTYewSU3+E4Kwu3FKctMhwH191IuQMJle3xP6PSaWiVQU3Y9xbsRwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09c02b3fe7c81885ee7bc21279d82e81accfc84439d530b7c5ca9c54ffd504a4","last_reissued_at":"2026-05-18T01:24:04.113718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.113718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2681","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEhMA+o7y8cxaAEs5Hh9yQFSMTdMCEAVzrYruwkMkE8THiSmQb4p01uh9GVdoUciaFwSFK3CFI8RTJS/5DVYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:14:46.547620Z"},"content_sha256":"c6a0694440952c3104ccc06dbf9aa57363f0eb3aceb6d0c56a89cb0b4aa3bd1a","schema_version":"1.0","event_id":"sha256:c6a0694440952c3104ccc06dbf9aa57363f0eb3aceb6d0c56a89cb0b4aa3bd1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BHACWP7HZAMIL3T3YIJHTWBOQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Recovery and Approximation of Hidden Cauchy Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"J\\\"org Liesen, Robert Luce","submitted_at":"2014-12-08T17:55:37Z","abstract_excerpt":"We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by a Cauchy matrix with a particular focus on the recovery of Cauchy points from noisy data. We derive an approximation algorithm of optimal complexity for this task, and prove approximation bounds. Numerical examples illustrate our theoretical results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2681","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eg/b5lmI3JuvJ8JsOtYhWJVYYlh7UfMppIwnt5+Ek28AZgS4dlOFr39rpa5ENe8kU1DxZrzDPWoMxuMCm1RADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:14:46.547950Z"},"content_sha256":"e61576400a5301e40aac0304b1c1eb0f86f2b013c025b21e4b5b8245d97d24b5","schema_version":"1.0","event_id":"sha256:e61576400a5301e40aac0304b1c1eb0f86f2b013c025b21e4b5b8245d97d24b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/bundle.json","state_url":"https://pith.science/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T18:14:46Z","links":{"resolver":"https://pith.science/pith/BHACWP7HZAMIL3T3YIJHTWBOQG","bundle":"https://pith.science/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/bundle.json","state":"https://pith.science/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHACWP7HZAMIL3T3YIJHTWBOQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BHACWP7HZAMIL3T3YIJHTWBOQG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dff55fad1bf744fa06af7ca3d04aa024cd26d1e70333963995cd48dbf4d1813f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-08T17:55:37Z","title_canon_sha256":"346a025613e6761abc5ce497c3bad0b98e40f3ff8380de8a3cdf0bc9ef7e1b42"},"schema_version":"1.0","source":{"id":"1412.2681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2681","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2681v2","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2681","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"BHACWP7HZAMI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHACWP7HZAMIL3T3","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHACWP7H","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:e61576400a5301e40aac0304b1c1eb0f86f2b013c025b21e4b5b8245d97d24b5","target":"graph","created_at":"2026-05-18T01:24:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by a Cauchy matrix with a particular focus on the recovery of Cauchy points from noisy data. We derive an approximation algorithm of optimal complexity for this task, and prove approximation bounds. Numerical examples illustrate our theoretical results.","authors_text":"J\\\"org Liesen, Robert Luce","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-08T17:55:37Z","title":"Fast Recovery and Approximation of Hidden Cauchy Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2681","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6a0694440952c3104ccc06dbf9aa57363f0eb3aceb6d0c56a89cb0b4aa3bd1a","target":"record","created_at":"2026-05-18T01:24:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dff55fad1bf744fa06af7ca3d04aa024cd26d1e70333963995cd48dbf4d1813f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-08T17:55:37Z","title_canon_sha256":"346a025613e6761abc5ce497c3bad0b98e40f3ff8380de8a3cdf0bc9ef7e1b42"},"schema_version":"1.0","source":{"id":"1412.2681","kind":"arxiv","version":2}},"canonical_sha256":"09c02b3fe7c81885ee7bc21279d82e81accfc84439d530b7c5ca9c54ffd504a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09c02b3fe7c81885ee7bc21279d82e81accfc84439d530b7c5ca9c54ffd504a4","first_computed_at":"2026-05-18T01:24:04.113718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:04.113718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0pzjyUB9BrDpDA1R0MsKKcT5xeMPL/jrTYewSU3+E4Kwu3FKctMhwH191IuQMJle3xP6PSaWiVQU3Y9xbsRwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:04.114330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a0694440952c3104ccc06dbf9aa57363f0eb3aceb6d0c56a89cb0b4aa3bd1a","sha256:e61576400a5301e40aac0304b1c1eb0f86f2b013c025b21e4b5b8245d97d24b5"],"state_sha256":"cf39f31dbbcd4be34f7ece32a5481d5991fdc0fc7680ad709a7442d79e330248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPaJwqh+iYhVAxeaeZv97pb2V3RI2iPOc4VPIheXRsAkBXqY26ibOUAxSOpHK5XqxGVK/6L2UtN7IMKqt7+yBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:14:46.549781Z","bundle_sha256":"7c6672cd7cb2c1512e9e80e1ead86c13b551b9a32372a5326a5a8063928e0c5b"}}