{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FYPYQICINVOOMYSBBERWQB6UBA","short_pith_number":"pith:FYPYQICI","canonical_record":{"source":{"id":"1504.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-20T20:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"0fff8afad7d12211ed5e83d255aa08bf7cfc825326469b8874c80497148f2d20","abstract_canon_sha256":"5a01c483824426e2706e93485107fd8f5baae5edf0560b060c8d451b89facf3f"},"schema_version":"1.0"},"canonical_sha256":"2e1f8820486d5ce6624109236807d4082a4117e4fdfb8ed66be6d987b75f5d8e","source":{"kind":"arxiv","id":"1504.05208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05208","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05208v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05208","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"FYPYQICINVOO","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYPYQICINVOOMYSB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYPYQICI","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FYPYQICINVOOMYSBBERWQB6UBA","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-20T20:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"0fff8afad7d12211ed5e83d255aa08bf7cfc825326469b8874c80497148f2d20","abstract_canon_sha256":"5a01c483824426e2706e93485107fd8f5baae5edf0560b060c8d451b89facf3f"},"schema_version":"1.0"},"canonical_sha256":"2e1f8820486d5ce6624109236807d4082a4117e4fdfb8ed66be6d987b75f5d8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.839385Z","signature_b64":"OuZGWlvEb8mW/V+NDJeAoZZGyD6VwRRTzrVpO3hCOSxsvuOBTQJwrz0A7WQyGUxpB4btXiFQvs9t90OpgX4DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1f8820486d5ce6624109236807d4082a4117e4fdfb8ed66be6d987b75f5d8e","last_reissued_at":"2026-05-18T02:18:14.838767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.838767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05208","source_version":1,"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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqsLHXJdTP+0cvAy1nHyn+qY4awgeDjpB5dWi19BSv/++y527csvkgoGTZZS9eMrW+4Beby6Xw7ZSy/vUiHpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:28:25.185800Z"},"content_sha256":"a3807fae729cb3c016d33dfcfa8ec36aac80ffb46a2d76cb801058c9b3562d38","schema_version":"1.0","event_id":"sha256:a3807fae729cb3c016d33dfcfa8ec36aac80ffb46a2d76cb801058c9b3562d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FYPYQICINVOOMYSBBERWQB6UBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Regularization Paths for Nuclear Norm Minimization Using Singular Value Bounds -- With Implementation and Extended Appendix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Bo Wahlberg, Cristian R. Rojas, Niclas Blomberg","submitted_at":"2015-04-20T20:07:07Z","abstract_excerpt":"The widely used nuclear norm heuristic for rank minimization problems introduces a regularization parameter which is difficult to tune. We have recently proposed a method to approximate the regularization path, i.e., the optimal solution as a function of the parameter, which requires solving the problem only for a sparse set of points. In this paper, we extend the algorithm to provide error bounds for the singular values of the approximation. We exemplify the algorithms on large scale benchmark examples in model order reduction. Here, the order of a dynamical system is reduced by means of cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05208","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"},"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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRc3KDxp6tG+UgGDF9MGTtWSX9LVZNf93ZlRVRjua1hjf8PzvrC1OvmJZ8jscDgWONx+b8p+Lreg3391NuR0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:28:25.186157Z"},"content_sha256":"b3fee3af2e5fae62e46070d210d86f5e662126f4cf850ec15f7950e335d1a64b","schema_version":"1.0","event_id":"sha256:b3fee3af2e5fae62e46070d210d86f5e662126f4cf850ec15f7950e335d1a64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYPYQICINVOOMYSBBERWQB6UBA/bundle.json","state_url":"https://pith.science/pith/FYPYQICINVOOMYSBBERWQB6UBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYPYQICINVOOMYSBBERWQB6UBA/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-12T00:28:25Z","links":{"resolver":"https://pith.science/pith/FYPYQICINVOOMYSBBERWQB6UBA","bundle":"https://pith.science/pith/FYPYQICINVOOMYSBBERWQB6UBA/bundle.json","state":"https://pith.science/pith/FYPYQICINVOOMYSBBERWQB6UBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYPYQICINVOOMYSBBERWQB6UBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FYPYQICINVOOMYSBBERWQB6UBA","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":"5a01c483824426e2706e93485107fd8f5baae5edf0560b060c8d451b89facf3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-20T20:07:07Z","title_canon_sha256":"0fff8afad7d12211ed5e83d255aa08bf7cfc825326469b8874c80497148f2d20"},"schema_version":"1.0","source":{"id":"1504.05208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05208","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05208v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05208","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"FYPYQICINVOO","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYPYQICINVOOMYSB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYPYQICI","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:b3fee3af2e5fae62e46070d210d86f5e662126f4cf850ec15f7950e335d1a64b","target":"graph","created_at":"2026-05-18T02:18:14Z","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":"The widely used nuclear norm heuristic for rank minimization problems introduces a regularization parameter which is difficult to tune. We have recently proposed a method to approximate the regularization path, i.e., the optimal solution as a function of the parameter, which requires solving the problem only for a sparse set of points. In this paper, we extend the algorithm to provide error bounds for the singular values of the approximation. We exemplify the algorithms on large scale benchmark examples in model order reduction. Here, the order of a dynamical system is reduced by means of cons","authors_text":"Bo Wahlberg, Cristian R. Rojas, Niclas Blomberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-20T20:07:07Z","title":"Approximate Regularization Paths for Nuclear Norm Minimization Using Singular Value Bounds -- With Implementation and Extended Appendix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05208","kind":"arxiv","version":1},"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:a3807fae729cb3c016d33dfcfa8ec36aac80ffb46a2d76cb801058c9b3562d38","target":"record","created_at":"2026-05-18T02:18:14Z","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":"5a01c483824426e2706e93485107fd8f5baae5edf0560b060c8d451b89facf3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-20T20:07:07Z","title_canon_sha256":"0fff8afad7d12211ed5e83d255aa08bf7cfc825326469b8874c80497148f2d20"},"schema_version":"1.0","source":{"id":"1504.05208","kind":"arxiv","version":1}},"canonical_sha256":"2e1f8820486d5ce6624109236807d4082a4117e4fdfb8ed66be6d987b75f5d8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e1f8820486d5ce6624109236807d4082a4117e4fdfb8ed66be6d987b75f5d8e","first_computed_at":"2026-05-18T02:18:14.838767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.838767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OuZGWlvEb8mW/V+NDJeAoZZGyD6VwRRTzrVpO3hCOSxsvuOBTQJwrz0A7WQyGUxpB4btXiFQvs9t90OpgX4DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.839385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3807fae729cb3c016d33dfcfa8ec36aac80ffb46a2d76cb801058c9b3562d38","sha256:b3fee3af2e5fae62e46070d210d86f5e662126f4cf850ec15f7950e335d1a64b"],"state_sha256":"f9607661cc973a4248cfccb141dc2e0595062558b36ef04197b38e4d2a9c5c02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9icjumJEhfKR49G67INDXk6NqKpNdIJe9QKUnhtrzUaAEgkhrLdXmGRiMRGMuiZfl2VygBJANKKPGmKq/cIiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:28:25.188060Z","bundle_sha256":"223cb2f0b6c69c4c5d238eb4fdea3ef5fa32b4dd1dbf64760b371b5277a98d8d"}}