{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:O4AMFGIIKQRHMPIHTXJ6CZ4TSG","short_pith_number":"pith:O4AMFGII","schema_version":"1.0","canonical_sha256":"7700c299085422763d079dd3e1679391a36efca03e0368ad5de041aed5472833","source":{"kind":"arxiv","id":"2003.12507","version":1},"attestation_state":"computed","paper":{"title":"Iterative Cauchy Thresholding: Regularisation with a heavy-tailed prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.IV","authors_text":"Alin Achim, Perla Mayo, Robin Holmes","submitted_at":"2020-03-27T16:15:47Z","abstract_excerpt":"In the machine learning era, sparsity continues to attract significant interest due to the benefits it provides to learning models. Algorithms aiming to optimise the \\(\\ell_0\\)- and \\(\\ell_1\\)-norm are the common choices to achieve sparsity. In this work, an alternative algorithm is proposed, which is derived based on the assumption of a Cauchy distribution characterising the coefficients in sparse domains. The Cauchy distribution is known to be able to capture heavy-tails in the data, which are linked to sparse processes. We begin by deriving the Cauchy proximal operator and subsequently prop"},"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":"2003.12507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2020-03-27T16:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"ff067bc6dc0a6ff2b028320fdee91ef67c6f7e11ed5406770f042c92f19f0acb","abstract_canon_sha256":"e13396c70e584f952814989a028bc8f66e7b132d68ac31dff5859823dd74f4ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:49.139082Z","signature_b64":"tmLM2GYiJ5C6O8TYKUlb6KKReg56rxDItTROuiVg/c+gKJQ/SszdlPj4lo63vt0CgEk2vfHUaKV7uarfsrryCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7700c299085422763d079dd3e1679391a36efca03e0368ad5de041aed5472833","last_reissued_at":"2026-07-05T01:53:49.138668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:49.138668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Cauchy Thresholding: Regularisation with a heavy-tailed prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.IV","authors_text":"Alin Achim, Perla Mayo, Robin Holmes","submitted_at":"2020-03-27T16:15:47Z","abstract_excerpt":"In the machine learning era, sparsity continues to attract significant interest due to the benefits it provides to learning models. Algorithms aiming to optimise the \\(\\ell_0\\)- and \\(\\ell_1\\)-norm are the common choices to achieve sparsity. In this work, an alternative algorithm is proposed, which is derived based on the assumption of a Cauchy distribution characterising the coefficients in sparse domains. The Cauchy distribution is known to be able to capture heavy-tails in the data, which are linked to sparse processes. We begin by deriving the Cauchy proximal operator and subsequently prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12507","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.12507/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.12507","created_at":"2026-07-05T01:53:49.138730+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.12507v1","created_at":"2026-07-05T01:53:49.138730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12507","created_at":"2026-07-05T01:53:49.138730+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4AMFGIIKQRH","created_at":"2026-07-05T01:53:49.138730+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4AMFGIIKQRHMPIH","created_at":"2026-07-05T01:53:49.138730+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4AMFGII","created_at":"2026-07-05T01:53:49.138730+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05204","citing_title":"Design and Control of a Bipedal Robotic Character","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG","json":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG.json","graph_json":"https://pith.science/api/pith-number/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/graph.json","events_json":"https://pith.science/api/pith-number/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/events.json","paper":"https://pith.science/paper/O4AMFGII"},"agent_actions":{"view_html":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG","download_json":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG.json","view_paper":"https://pith.science/paper/O4AMFGII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.12507&json=true","fetch_graph":"https://pith.science/api/pith-number/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/graph.json","fetch_events":"https://pith.science/api/pith-number/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/action/storage_attestation","attest_author":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/action/author_attestation","sign_citation":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/action/citation_signature","submit_replication":"https://pith.science/pith/O4AMFGIIKQRHMPIHTXJ6CZ4TSG/action/replication_record"}},"created_at":"2026-07-05T01:53:49.138730+00:00","updated_at":"2026-07-05T01:53:49.138730+00:00"}