{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7F7ZYDD5E3S5TD4MRYIX7CNUYJ","short_pith_number":"pith:7F7ZYDD5","canonical_record":{"source":{"id":"1510.03110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-11T23:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"6b849423d1ea74869c314c1f52c53dbb3378a2371311e1ff59c94ff4772e7f63","abstract_canon_sha256":"6ec74b55115ca396125b297d4f61d93460361bb6661ab6a560aef7702b086142"},"schema_version":"1.0"},"canonical_sha256":"f97f9c0c7d26e5d98f8c8e117f89b4c25a635016db42ec8c734e30b87af7025c","source":{"kind":"arxiv","id":"1510.03110","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03110","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03110v2","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03110","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"7F7ZYDD5E3S5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7F7ZYDD5E3S5TD4M","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7F7ZYDD5","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7F7ZYDD5E3S5TD4MRYIX7CNUYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-11T23:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"6b849423d1ea74869c314c1f52c53dbb3378a2371311e1ff59c94ff4772e7f63","abstract_canon_sha256":"6ec74b55115ca396125b297d4f61d93460361bb6661ab6a560aef7702b086142"},"schema_version":"1.0"},"canonical_sha256":"f97f9c0c7d26e5d98f8c8e117f89b4c25a635016db42ec8c734e30b87af7025c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.886458Z","signature_b64":"Y4Dn97444zjTr60+o9UkOagZxXzZrHjJZkumD42B6X1uT+k94EHKBPuIcdOOKG2n3HMZPV8kJKauJxWimESJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97f9c0c7d26e5d98f8c8e117f89b4c25a635016db42ec8c734e30b87af7025c","last_reissued_at":"2026-05-18T01:29:38.885993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.885993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03110","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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ax7g5S3QQYWYvdcNNIUmxwDQpvJZCdJGWLXmwu/hHFfeufmyLi2L8QSuzYvHz98mZfQTKRDfVgcTNRG4N7Y2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:27:55.155737Z"},"content_sha256":"7ca4746549124ad4d0b1777f29e1aebab893b37fdad4899e8cb302e85782dfa4","schema_version":"1.0","event_id":"sha256:7ca4746549124ad4d0b1777f29e1aebab893b37fdad4899e8cb302e85782dfa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7F7ZYDD5E3S5TD4MRYIX7CNUYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An O(log N) Parallel Algorithm for Newton Step Computations with Applications to Moving Horizon Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Isak Nielsen","submitted_at":"2015-10-11T23:08:20Z","abstract_excerpt":"In Moving Horizon Estimation (MHE) the computed estimate is found by solving a constrained finite-time optimal estimation problem in real-time at each sample in a receding horizon fashion. The constrained estimation problem can be solved by, e.g., interior-point (IP) or active-set (AS) methods, where the main computational effort in both methods is known to be the computation of the search direction, i.e., the Newton step. This is often done using generic sparsity exploiting algorithms or serial Riccati recursions, but as parallel hardware is becoming more commonly available the need for paral"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03110","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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6f6wu2WDIptOIbnvNSqgEfxS/sRUMuiLeuMsAjesc6JBXqcLDZpP356eFHJKxv0PYpqaeWKKB38my1HDt+9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:27:55.156516Z"},"content_sha256":"79726c21f3c9ecf6633201c68df3cc1e2e6ba3b1d9058b6c8c824943596b8ba8","schema_version":"1.0","event_id":"sha256:79726c21f3c9ecf6633201c68df3cc1e2e6ba3b1d9058b6c8c824943596b8ba8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/bundle.json","state_url":"https://pith.science/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/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-12T02:27:55Z","links":{"resolver":"https://pith.science/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ","bundle":"https://pith.science/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/bundle.json","state":"https://pith.science/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7F7ZYDD5E3S5TD4MRYIX7CNUYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7F7ZYDD5E3S5TD4MRYIX7CNUYJ","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":"6ec74b55115ca396125b297d4f61d93460361bb6661ab6a560aef7702b086142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-11T23:08:20Z","title_canon_sha256":"6b849423d1ea74869c314c1f52c53dbb3378a2371311e1ff59c94ff4772e7f63"},"schema_version":"1.0","source":{"id":"1510.03110","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03110","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03110v2","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03110","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"7F7ZYDD5E3S5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7F7ZYDD5E3S5TD4M","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7F7ZYDD5","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:79726c21f3c9ecf6633201c68df3cc1e2e6ba3b1d9058b6c8c824943596b8ba8","target":"graph","created_at":"2026-05-18T01:29:38Z","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":"In Moving Horizon Estimation (MHE) the computed estimate is found by solving a constrained finite-time optimal estimation problem in real-time at each sample in a receding horizon fashion. The constrained estimation problem can be solved by, e.g., interior-point (IP) or active-set (AS) methods, where the main computational effort in both methods is known to be the computation of the search direction, i.e., the Newton step. This is often done using generic sparsity exploiting algorithms or serial Riccati recursions, but as parallel hardware is becoming more commonly available the need for paral","authors_text":"Daniel Axehill, Isak Nielsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-11T23:08:20Z","title":"An O(log N) Parallel Algorithm for Newton Step Computations with Applications to Moving Horizon Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03110","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:7ca4746549124ad4d0b1777f29e1aebab893b37fdad4899e8cb302e85782dfa4","target":"record","created_at":"2026-05-18T01:29:38Z","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":"6ec74b55115ca396125b297d4f61d93460361bb6661ab6a560aef7702b086142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-11T23:08:20Z","title_canon_sha256":"6b849423d1ea74869c314c1f52c53dbb3378a2371311e1ff59c94ff4772e7f63"},"schema_version":"1.0","source":{"id":"1510.03110","kind":"arxiv","version":2}},"canonical_sha256":"f97f9c0c7d26e5d98f8c8e117f89b4c25a635016db42ec8c734e30b87af7025c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f97f9c0c7d26e5d98f8c8e117f89b4c25a635016db42ec8c734e30b87af7025c","first_computed_at":"2026-05-18T01:29:38.885993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:38.885993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y4Dn97444zjTr60+o9UkOagZxXzZrHjJZkumD42B6X1uT+k94EHKBPuIcdOOKG2n3HMZPV8kJKauJxWimESJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:38.886458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03110","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ca4746549124ad4d0b1777f29e1aebab893b37fdad4899e8cb302e85782dfa4","sha256:79726c21f3c9ecf6633201c68df3cc1e2e6ba3b1d9058b6c8c824943596b8ba8"],"state_sha256":"debc2d7521b2bf2af55f2909a705a8ad35231db0845c546ffb6422f42d003a54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDqsWT3Z9FsMLWDZKzZsT5AmvfCYmW1apQ6qDMuEe25i5lt/o90pOdJLazs1MAbU2XkjkFYLE9Gfs6ZmWk6DBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:27:55.162171Z","bundle_sha256":"f97f8db98d00781c1f4c588ba813af7fc339e914779ac902097889a0f8adb0cb"}}