{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4NIOZX6DIVKDWS22AZS5KQFYIV","short_pith_number":"pith:4NIOZX6D","schema_version":"1.0","canonical_sha256":"e350ecdfc345543b4b5a0665d540b8455444cbb51054ba58e8e9f3c137da8e65","source":{"kind":"arxiv","id":"1601.01242","version":1},"attestation_state":"computed","paper":{"title":"Fixed-point algorithms for frequency estimation and structured low rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fredrik Andersson, Marcus Carlsson","submitted_at":"2016-01-06T17:18:26Z","abstract_excerpt":"We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic formulation of the fixed-point algorithm we show that it converges to the minimum of the convex envelope of the original objective function along with its structured matrix constraint. It often happens that this solution agrees with the solution to the original minimization problem, and we provide a simple criterium for when this is true. We also provide mor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1601.01242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-06T17:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"36f29b9755a82f9cb3bc9f7806e1db4d92ca789613a34b8d324e475a5f199181","abstract_canon_sha256":"c21b44ac081d5b8e9f7104abd77e4b7411908c4107b16e697b0f52f57c7a9dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:17.441719Z","signature_b64":"+OJg6f9GuiRAXwyPRQW+Hb1468lNOGCNWrHdu+FrBbMFo2PI4TfF4bbvj4amDnGRHiCAofjujGQ4XF4EUyynCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e350ecdfc345543b4b5a0665d540b8455444cbb51054ba58e8e9f3c137da8e65","last_reissued_at":"2026-05-18T01:23:17.440960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:17.440960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-point algorithms for frequency estimation and structured low rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fredrik Andersson, Marcus Carlsson","submitted_at":"2016-01-06T17:18:26Z","abstract_excerpt":"We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic formulation of the fixed-point algorithm we show that it converges to the minimum of the convex envelope of the original objective function along with its structured matrix constraint. It often happens that this solution agrees with the solution to the original minimization problem, and we provide a simple criterium for when this is true. We also provide mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01242","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.01242","created_at":"2026-05-18T01:23:17.441096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01242v1","created_at":"2026-05-18T01:23:17.441096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01242","created_at":"2026-05-18T01:23:17.441096+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NIOZX6DIVKD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NIOZX6DIVKDWS22","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NIOZX6D","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV","json":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV.json","graph_json":"https://pith.science/api/pith-number/4NIOZX6DIVKDWS22AZS5KQFYIV/graph.json","events_json":"https://pith.science/api/pith-number/4NIOZX6DIVKDWS22AZS5KQFYIV/events.json","paper":"https://pith.science/paper/4NIOZX6D"},"agent_actions":{"view_html":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV","download_json":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV.json","view_paper":"https://pith.science/paper/4NIOZX6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/4NIOZX6DIVKDWS22AZS5KQFYIV/graph.json","fetch_events":"https://pith.science/api/pith-number/4NIOZX6DIVKDWS22AZS5KQFYIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV/action/storage_attestation","attest_author":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV/action/author_attestation","sign_citation":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV/action/citation_signature","submit_replication":"https://pith.science/pith/4NIOZX6DIVKDWS22AZS5KQFYIV/action/replication_record"}},"created_at":"2026-05-18T01:23:17.441096+00:00","updated_at":"2026-05-18T01:23:17.441096+00:00"}