{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MK7XK2OQKXAGIVRKFNGBKHELBX","short_pith_number":"pith:MK7XK2OQ","schema_version":"1.0","canonical_sha256":"62bf7569d055c064562a2b4c151c8b0dc089177d6361298a0ab3879120c0b211","source":{"kind":"arxiv","id":"2406.19061","version":2},"attestation_state":"computed","paper":{"title":"Entrywise dynamics and universality of general first order methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Qiyang Han","submitted_at":"2024-06-27T10:28:50Z","abstract_excerpt":"General first order methods (GFOMs), including various gradient descent and AMP algorithms, constitute a broad class of iterative algorithms in modern statistical learning problems. Some GFOMs also serve as constructive proof devices, iteratively characterizing the empirical distributions of statistical estimators in the large system limits for any fixed number of iterations.\n  This paper develops a non-asymptotic, entrywise characterization for a general class of GFOMs. Our characterizations capture the precise entrywise behavior of the GFOMs, and hold universally across a broad class of hete"},"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":"2406.19061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-06-27T10:28:50Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"fa2fc02cf4b3fe7ace231fb48cbee77da0dc7fb31b81f8a81bb9bf0936caf03d","abstract_canon_sha256":"d15530950d67daeb3b412111c520a723e8dff57c98f15380cb19a1c5e49b47d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:33.067675Z","signature_b64":"K7pS4TK4GM2cyiQ4f/rjvMotgVFraQNwnFQ1tzKINQFDYW0ti9RxolMvWviAyU5/30V/cLhUqNLuMRwM5KEUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62bf7569d055c064562a2b4c151c8b0dc089177d6361298a0ab3879120c0b211","last_reissued_at":"2026-07-05T11:11:33.067114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:33.067114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entrywise dynamics and universality of general first order methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Qiyang Han","submitted_at":"2024-06-27T10:28:50Z","abstract_excerpt":"General first order methods (GFOMs), including various gradient descent and AMP algorithms, constitute a broad class of iterative algorithms in modern statistical learning problems. Some GFOMs also serve as constructive proof devices, iteratively characterizing the empirical distributions of statistical estimators in the large system limits for any fixed number of iterations.\n  This paper develops a non-asymptotic, entrywise characterization for a general class of GFOMs. Our characterizations capture the precise entrywise behavior of the GFOMs, and hold universally across a broad class of hete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19061","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/2406.19061/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":"2406.19061","created_at":"2026-07-05T11:11:33.067175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19061v2","created_at":"2026-07-05T11:11:33.067175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19061","created_at":"2026-07-05T11:11:33.067175+00:00"},{"alias_kind":"pith_short_12","alias_value":"MK7XK2OQKXAG","created_at":"2026-07-05T11:11:33.067175+00:00"},{"alias_kind":"pith_short_16","alias_value":"MK7XK2OQKXAGIVRK","created_at":"2026-07-05T11:11:33.067175+00:00"},{"alias_kind":"pith_short_8","alias_value":"MK7XK2OQ","created_at":"2026-07-05T11:11:33.067175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.16329","citing_title":"High-Dimensional Private Linear Regression with Optimal Rates","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX","json":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX.json","graph_json":"https://pith.science/api/pith-number/MK7XK2OQKXAGIVRKFNGBKHELBX/graph.json","events_json":"https://pith.science/api/pith-number/MK7XK2OQKXAGIVRKFNGBKHELBX/events.json","paper":"https://pith.science/paper/MK7XK2OQ"},"agent_actions":{"view_html":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX","download_json":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX.json","view_paper":"https://pith.science/paper/MK7XK2OQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19061&json=true","fetch_graph":"https://pith.science/api/pith-number/MK7XK2OQKXAGIVRKFNGBKHELBX/graph.json","fetch_events":"https://pith.science/api/pith-number/MK7XK2OQKXAGIVRKFNGBKHELBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX/action/storage_attestation","attest_author":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX/action/author_attestation","sign_citation":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX/action/citation_signature","submit_replication":"https://pith.science/pith/MK7XK2OQKXAGIVRKFNGBKHELBX/action/replication_record"}},"created_at":"2026-07-05T11:11:33.067175+00:00","updated_at":"2026-07-05T11:11:33.067175+00:00"}