{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3YXHRM6D2CEGBUYSCDFO6EZYUG","short_pith_number":"pith:3YXHRM6D","canonical_record":{"source":{"id":"1407.3410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-12T18:29:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"2e0372324bd451802b88343ae1232dc513d5d62269afb0afe8a3d573b72ccabc","abstract_canon_sha256":"14a80ddfe2ab0b888e96d1e434d4873589d448b6316b4d2e3148ff6bfbd3f050"},"schema_version":"1.0"},"canonical_sha256":"de2e78b3c3d08860d31210caef1338a198bc14dd73f6d9457aa3e5741a34470f","source":{"kind":"arxiv","id":"1407.3410","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3410","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3410v1","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3410","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"pith_short_12","alias_value":"3YXHRM6D2CEG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YXHRM6D2CEGBUYS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YXHRM6D","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3YXHRM6D2CEGBUYSCDFO6EZYUG","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-12T18:29:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"2e0372324bd451802b88343ae1232dc513d5d62269afb0afe8a3d573b72ccabc","abstract_canon_sha256":"14a80ddfe2ab0b888e96d1e434d4873589d448b6316b4d2e3148ff6bfbd3f050"},"schema_version":"1.0"},"canonical_sha256":"de2e78b3c3d08860d31210caef1338a198bc14dd73f6d9457aa3e5741a34470f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:42.994573Z","signature_b64":"DBEHesmRInm7OErM3oJaWe65e0IHXKv2dPm6P9kdWcuyoegZ2lxlDeobinhr6T7kerVO6/6ZeWE4a9HO4uWKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de2e78b3c3d08860d31210caef1338a198bc14dd73f6d9457aa3e5741a34470f","last_reissued_at":"2026-05-18T02:47:42.993821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:42.993821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3410","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:47:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLLWAc0ArvaYxFJwyvLT1amBkE9tzMnRtXzknorUTVcrDr4Thv5LuM78WGGZLtCWtkMMSnMtcPkh+/CJsmaECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:44:24.953756Z"},"content_sha256":"5fd2bbd3a8f393822cbca0dc4d1842063b736e436e893c7791f3b99349d1d75a","schema_version":"1.0","event_id":"sha256:5fd2bbd3a8f393822cbca0dc4d1842063b736e436e893c7791f3b99349d1d75a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3YXHRM6D2CEGBUYSCDFO6EZYUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Strategies Are Good For Low-Rank Matrix Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Cristian R. Rojas, Kezhi Li, Magnus Jansson, Martin Sundin, Saikat Chatterjee","submitted_at":"2014-07-12T18:29:15Z","abstract_excerpt":"This article focuses on the problem of reconstructing low-rank matrices from underdetermined measurements using alternating optimization strategies. We endeavour to combine an alternating least-squares based estimation strategy with ideas from the alternating direction method of multipliers (ADMM) to recover structured low-rank matrices, such as Hankel structure. We show that merging these two alternating strategies leads to a better performance than the existing alternating least squares (ALS) strategy. The performance is evaluated via numerical simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3410","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:47:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/ZcjYpHy4SmP+uIpaYs+rtKAbgbm9FLDwf4agcRN9fmpEYFEtFDO0veCjE74/UaPi44jLpPP8QxEEvsYrnMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:44:24.954471Z"},"content_sha256":"cee5e87182996515d14d2179180ae0427aa401a4a8190859ab8cfe68242ce33d","schema_version":"1.0","event_id":"sha256:cee5e87182996515d14d2179180ae0427aa401a4a8190859ab8cfe68242ce33d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/bundle.json","state_url":"https://pith.science/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/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-08T14:44:24Z","links":{"resolver":"https://pith.science/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG","bundle":"https://pith.science/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/bundle.json","state":"https://pith.science/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YXHRM6D2CEGBUYSCDFO6EZYUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3YXHRM6D2CEGBUYSCDFO6EZYUG","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":"14a80ddfe2ab0b888e96d1e434d4873589d448b6316b4d2e3148ff6bfbd3f050","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-12T18:29:15Z","title_canon_sha256":"2e0372324bd451802b88343ae1232dc513d5d62269afb0afe8a3d573b72ccabc"},"schema_version":"1.0","source":{"id":"1407.3410","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3410","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3410v1","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3410","created_at":"2026-05-18T02:47:42Z"},{"alias_kind":"pith_short_12","alias_value":"3YXHRM6D2CEG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YXHRM6D2CEGBUYS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YXHRM6D","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:cee5e87182996515d14d2179180ae0427aa401a4a8190859ab8cfe68242ce33d","target":"graph","created_at":"2026-05-18T02:47:42Z","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":"This article focuses on the problem of reconstructing low-rank matrices from underdetermined measurements using alternating optimization strategies. We endeavour to combine an alternating least-squares based estimation strategy with ideas from the alternating direction method of multipliers (ADMM) to recover structured low-rank matrices, such as Hankel structure. We show that merging these two alternating strategies leads to a better performance than the existing alternating least squares (ALS) strategy. The performance is evaluated via numerical simulations.","authors_text":"Cristian R. Rojas, Kezhi Li, Magnus Jansson, Martin Sundin, Saikat Chatterjee","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-12T18:29:15Z","title":"Alternating Strategies Are Good For Low-Rank Matrix Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3410","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:5fd2bbd3a8f393822cbca0dc4d1842063b736e436e893c7791f3b99349d1d75a","target":"record","created_at":"2026-05-18T02:47:42Z","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":"14a80ddfe2ab0b888e96d1e434d4873589d448b6316b4d2e3148ff6bfbd3f050","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-12T18:29:15Z","title_canon_sha256":"2e0372324bd451802b88343ae1232dc513d5d62269afb0afe8a3d573b72ccabc"},"schema_version":"1.0","source":{"id":"1407.3410","kind":"arxiv","version":1}},"canonical_sha256":"de2e78b3c3d08860d31210caef1338a198bc14dd73f6d9457aa3e5741a34470f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de2e78b3c3d08860d31210caef1338a198bc14dd73f6d9457aa3e5741a34470f","first_computed_at":"2026-05-18T02:47:42.993821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:42.993821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DBEHesmRInm7OErM3oJaWe65e0IHXKv2dPm6P9kdWcuyoegZ2lxlDeobinhr6T7kerVO6/6ZeWE4a9HO4uWKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:42.994573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3410","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fd2bbd3a8f393822cbca0dc4d1842063b736e436e893c7791f3b99349d1d75a","sha256:cee5e87182996515d14d2179180ae0427aa401a4a8190859ab8cfe68242ce33d"],"state_sha256":"55c8be500f286be60ad3b7e423d8c5ee9f0543893aa3c8f1b9867f666933f8fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdAQE7mYhUmAue514X7PzbarkZHKZZrW7WKIMIzA41f640YPknQ2Ga1FiINo9TKMvZOy9aSyxY+V7fT+q/xzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:44:24.958137Z","bundle_sha256":"5347a5cb04fdc3382d404321c2a5f6cef61d720c7575f4df46af4af0ecca4d11"}}