{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WNQJ73OJEIE7BNCUMOSVOTS6AS","short_pith_number":"pith:WNQJ73OJ","canonical_record":{"source":{"id":"1510.00040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T21:27:11Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"907aa0bb47eef4fcb5fae0912c1cfd1db6c3d1051de742714578062ad1321ddd","abstract_canon_sha256":"09cd8e207ada2cf169b9cf3eb85c5270d8a1bcab0f048c300672a25e848953f9"},"schema_version":"1.0"},"canonical_sha256":"b3609fedc92209f0b45463a5574e5e048e5e76ccedbd34691c36d8224703f32c","source":{"kind":"arxiv","id":"1510.00040","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00040","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00040v3","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00040","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"WNQJ73OJEIE7","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_16","alias_value":"WNQJ73OJEIE7BNCU","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_8","alias_value":"WNQJ73OJ","created_at":"2026-06-04T17:09:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WNQJ73OJEIE7BNCUMOSVOTS6AS","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T21:27:11Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"907aa0bb47eef4fcb5fae0912c1cfd1db6c3d1051de742714578062ad1321ddd","abstract_canon_sha256":"09cd8e207ada2cf169b9cf3eb85c5270d8a1bcab0f048c300672a25e848953f9"},"schema_version":"1.0"},"canonical_sha256":"b3609fedc92209f0b45463a5574e5e048e5e76ccedbd34691c36d8224703f32c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T17:09:39.632572Z","signature_b64":"XQPoBu+s6uEYhAu0vct+XhzPKqdPy8IEfB2iH+XKPJd0PtRre36wZtLAY/tipjXVYk3A2Mv62zNduUXs2DstAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3609fedc92209f0b45463a5574e5e048e5e76ccedbd34691c36d8224703f32c","last_reissued_at":"2026-06-04T17:09:39.632146Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T17:09:39.632146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00040","source_version":3,"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-06-04T17:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XodxNCwPal+pepiANc1wfhYKLQ/YbEMXI81mG2jzVbpCp5+lTxzuEx5q0mwnTIMcEWS2lefgc4c8RkwRQnIPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:25:52.291366Z"},"content_sha256":"bd3cea7f52f708369f54742a32997259978d464bff0630ebd6961abc6c21cced","schema_version":"1.0","event_id":"sha256:bd3cea7f52f708369f54742a32997259978d464bff0630ebd6961abc6c21cced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WNQJ73OJEIE7BNCUMOSVOTS6AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RADI: A low-rank ADI-type algorithm for large scale algebraic Riccati equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jens Saak, Patrick K\\\"urschner, Peter Benner, Zvonimir Bujanovi\\'c","submitted_at":"2015-09-30T21:27:11Z","abstract_excerpt":"This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-factored variant of the Lyapunov ADI method. We discuss important implementation aspects of the algorithm, such as reducing the use of complex arithmetic and shift selection strategies. We show that there is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature -- all of these seemingly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00040","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1510.00040/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-04T17:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrqszupI9ee+sbVkJ0GfHJ0LnwHYy9kUJlrKlnXLLLJbQTq1MebMVi1NVxeVhOU4FAu/jV2kCOR0UFo/+tqwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:25:52.292264Z"},"content_sha256":"71f271516132840e8ac79254337593883f62ddd077f5aaa246829cc1dd6e1554","schema_version":"1.0","event_id":"sha256:71f271516132840e8ac79254337593883f62ddd077f5aaa246829cc1dd6e1554"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/bundle.json","state_url":"https://pith.science/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/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-12T03:25:52Z","links":{"resolver":"https://pith.science/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS","bundle":"https://pith.science/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/bundle.json","state":"https://pith.science/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNQJ73OJEIE7BNCUMOSVOTS6AS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WNQJ73OJEIE7BNCUMOSVOTS6AS","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":"09cd8e207ada2cf169b9cf3eb85c5270d8a1bcab0f048c300672a25e848953f9","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T21:27:11Z","title_canon_sha256":"907aa0bb47eef4fcb5fae0912c1cfd1db6c3d1051de742714578062ad1321ddd"},"schema_version":"1.0","source":{"id":"1510.00040","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00040","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00040v3","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00040","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"WNQJ73OJEIE7","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_16","alias_value":"WNQJ73OJEIE7BNCU","created_at":"2026-06-04T17:09:39Z"},{"alias_kind":"pith_short_8","alias_value":"WNQJ73OJ","created_at":"2026-06-04T17:09:39Z"}],"graph_snapshots":[{"event_id":"sha256:71f271516132840e8ac79254337593883f62ddd077f5aaa246829cc1dd6e1554","target":"graph","created_at":"2026-06-04T17:09:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1510.00040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-factored variant of the Lyapunov ADI method. We discuss important implementation aspects of the algorithm, such as reducing the use of complex arithmetic and shift selection strategies. We show that there is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature -- all of these seemingly ","authors_text":"Jens Saak, Patrick K\\\"urschner, Peter Benner, Zvonimir Bujanovi\\'c","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T21:27:11Z","title":"RADI: A low-rank ADI-type algorithm for large scale algebraic Riccati equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00040","kind":"arxiv","version":3},"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:bd3cea7f52f708369f54742a32997259978d464bff0630ebd6961abc6c21cced","target":"record","created_at":"2026-06-04T17:09:39Z","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":"09cd8e207ada2cf169b9cf3eb85c5270d8a1bcab0f048c300672a25e848953f9","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T21:27:11Z","title_canon_sha256":"907aa0bb47eef4fcb5fae0912c1cfd1db6c3d1051de742714578062ad1321ddd"},"schema_version":"1.0","source":{"id":"1510.00040","kind":"arxiv","version":3}},"canonical_sha256":"b3609fedc92209f0b45463a5574e5e048e5e76ccedbd34691c36d8224703f32c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3609fedc92209f0b45463a5574e5e048e5e76ccedbd34691c36d8224703f32c","first_computed_at":"2026-06-04T17:09:39.632146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T17:09:39.632146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQPoBu+s6uEYhAu0vct+XhzPKqdPy8IEfB2iH+XKPJd0PtRre36wZtLAY/tipjXVYk3A2Mv62zNduUXs2DstAw==","signature_status":"signed_v1","signed_at":"2026-06-04T17:09:39.632572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00040","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd3cea7f52f708369f54742a32997259978d464bff0630ebd6961abc6c21cced","sha256:71f271516132840e8ac79254337593883f62ddd077f5aaa246829cc1dd6e1554"],"state_sha256":"fbdf2c9b0578c68e69e6606bd5a97ed256c87ba3c7f0bf4367ce368078083c63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pptx2Zp14i/TRMKiY6ci7n4YhBeHNo0T16KQIPGcLV9UEX9eVt2nmbIKRvgOR1kduVD5jBevgu4/3AvgD8crCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:25:52.295756Z","bundle_sha256":"a9c4f175b885675a7995182c25c095c23754742d86a9c22407dc9c6d2fe29852"}}