{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UHIWCSS3OMTRP4N63C7QGUEKBX","short_pith_number":"pith:UHIWCSS3","schema_version":"1.0","canonical_sha256":"a1d1614a5b732717f1bed8bf03508a0dcade562b9ebed1f95b4800c06f19421d","source":{"kind":"arxiv","id":"2106.13508","version":2},"attestation_state":"computed","paper":{"title":"MARS: A second-order reduction algorithm for high-dimensional sparse precision matrices estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME"],"primary_cat":"stat.CO","authors_text":"Binyan Jiang, Defeng Sun, Qian Li","submitted_at":"2021-06-25T09:00:10Z","abstract_excerpt":"Estimation of the precision matrix (or inverse covariance matrix) is of great importance in statistical data analysis and machine learning. However, as the number of parameters scales quadratically with the dimension $p$, computation becomes very challenging when $p$ is large. In this paper, we propose an adaptive sieving reduction algorithm to generate a solution path for the estimation of precision matrices under the $\\ell_1$ penalized D-trace loss, with each subproblem being solved by a second-order algorithm. In each iteration of our algorithm, we are able to greatly reduce the number of v"},"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":"2106.13508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2021-06-25T09:00:10Z","cross_cats_sorted":["math.OC","stat.ME"],"title_canon_sha256":"084b3ba18262552fa3464a202899332ce505b055db1a58fb76acce3a39655f57","abstract_canon_sha256":"32cffab4e0b3a862c8ce185c56e66682670cafc4cca4706a055002fa28353ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:08.608623Z","signature_b64":"Qlkp7aqnWGFkHMImHJ3IzFnbLzVLk5XDaIsPgySnF2tabwQ96y2bgG7W7AWoMhSIOUkojE9Rh5/aD48mQqNpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1d1614a5b732717f1bed8bf03508a0dcade562b9ebed1f95b4800c06f19421d","last_reissued_at":"2026-07-05T05:12:08.608135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:08.608135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MARS: A second-order reduction algorithm for high-dimensional sparse precision matrices estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME"],"primary_cat":"stat.CO","authors_text":"Binyan Jiang, Defeng Sun, Qian Li","submitted_at":"2021-06-25T09:00:10Z","abstract_excerpt":"Estimation of the precision matrix (or inverse covariance matrix) is of great importance in statistical data analysis and machine learning. However, as the number of parameters scales quadratically with the dimension $p$, computation becomes very challenging when $p$ is large. In this paper, we propose an adaptive sieving reduction algorithm to generate a solution path for the estimation of precision matrices under the $\\ell_1$ penalized D-trace loss, with each subproblem being solved by a second-order algorithm. In each iteration of our algorithm, we are able to greatly reduce the number of v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13508","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.13508/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":"2106.13508","created_at":"2026-07-05T05:12:08.608194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13508v2","created_at":"2026-07-05T05:12:08.608194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13508","created_at":"2026-07-05T05:12:08.608194+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHIWCSS3OMTR","created_at":"2026-07-05T05:12:08.608194+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHIWCSS3OMTRP4N6","created_at":"2026-07-05T05:12:08.608194+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHIWCSS3","created_at":"2026-07-05T05:12:08.608194+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/UHIWCSS3OMTRP4N63C7QGUEKBX","json":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX.json","graph_json":"https://pith.science/api/pith-number/UHIWCSS3OMTRP4N63C7QGUEKBX/graph.json","events_json":"https://pith.science/api/pith-number/UHIWCSS3OMTRP4N63C7QGUEKBX/events.json","paper":"https://pith.science/paper/UHIWCSS3"},"agent_actions":{"view_html":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX","download_json":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX.json","view_paper":"https://pith.science/paper/UHIWCSS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13508&json=true","fetch_graph":"https://pith.science/api/pith-number/UHIWCSS3OMTRP4N63C7QGUEKBX/graph.json","fetch_events":"https://pith.science/api/pith-number/UHIWCSS3OMTRP4N63C7QGUEKBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX/action/storage_attestation","attest_author":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX/action/author_attestation","sign_citation":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX/action/citation_signature","submit_replication":"https://pith.science/pith/UHIWCSS3OMTRP4N63C7QGUEKBX/action/replication_record"}},"created_at":"2026-07-05T05:12:08.608194+00:00","updated_at":"2026-07-05T05:12:08.608194+00:00"}