{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6VWVS2E5NZG2XYH3OSVLGMU4TK","short_pith_number":"pith:6VWVS2E5","schema_version":"1.0","canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","source":{"kind":"arxiv","id":"2407.18150","version":5},"attestation_state":"computed","paper":{"title":"Block cubic Newton with greedy selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari","submitted_at":"2024-07-25T16:00:16Z","abstract_excerpt":"A second-order block coordinate descent method is proposed for the unconstrained minimization of an objective function with a Lipschitz continuous Hessian. At each iteration, a block of variables is selected by means of a greedy (Gauss-Southwell) rule which considers the amount of first-order stationarity violation, then an approximate minimizer of a cubic model is computed for the block update. In the proposed scheme, blocks are not required to have a predetermined structure and their size may change during the iterations. For non-convex objective functions, global convergence to stationary p"},"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":"2407.18150","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-25T16:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"cf56801b5b85cbf3d44acc7ae21f8b9a599ca55a7643d04df4eef146a833f4a5","abstract_canon_sha256":"5db219d4dcfe9b1c8be656ec4482ec43a520014356d3d30d0fe865261cfb6ee0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:04.991503Z","signature_b64":"lpALOG0mdNxayauEW6NIgbSTQDrelviCzLsdq+bvDVPlcTipbcl/QVGOf0lkUlpB24wLMMbXNQI/Jz4vKEGfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","last_reissued_at":"2026-06-12T01:09:04.990091Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:04.990091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block cubic Newton with greedy selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari","submitted_at":"2024-07-25T16:00:16Z","abstract_excerpt":"A second-order block coordinate descent method is proposed for the unconstrained minimization of an objective function with a Lipschitz continuous Hessian. At each iteration, a block of variables is selected by means of a greedy (Gauss-Southwell) rule which considers the amount of first-order stationarity violation, then an approximate minimizer of a cubic model is computed for the block update. In the proposed scheme, blocks are not required to have a predetermined structure and their size may change during the iterations. For non-convex objective functions, global convergence to stationary p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18150","kind":"arxiv","version":5},"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/2407.18150/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":"2407.18150","created_at":"2026-06-12T01:09:04.990233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.18150v5","created_at":"2026-06-12T01:09:04.990233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18150","created_at":"2026-06-12T01:09:04.990233+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VWVS2E5NZG2","created_at":"2026-06-12T01:09:04.990233+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VWVS2E5NZG2XYH3","created_at":"2026-06-12T01:09:04.990233+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VWVS2E5","created_at":"2026-06-12T01:09:04.990233+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/6VWVS2E5NZG2XYH3OSVLGMU4TK","json":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK.json","graph_json":"https://pith.science/api/pith-number/6VWVS2E5NZG2XYH3OSVLGMU4TK/graph.json","events_json":"https://pith.science/api/pith-number/6VWVS2E5NZG2XYH3OSVLGMU4TK/events.json","paper":"https://pith.science/paper/6VWVS2E5"},"agent_actions":{"view_html":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK","download_json":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK.json","view_paper":"https://pith.science/paper/6VWVS2E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.18150&json=true","fetch_graph":"https://pith.science/api/pith-number/6VWVS2E5NZG2XYH3OSVLGMU4TK/graph.json","fetch_events":"https://pith.science/api/pith-number/6VWVS2E5NZG2XYH3OSVLGMU4TK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/action/storage_attestation","attest_author":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/action/author_attestation","sign_citation":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/action/citation_signature","submit_replication":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/action/replication_record"}},"created_at":"2026-06-12T01:09:04.990233+00:00","updated_at":"2026-06-12T01:09:04.990233+00:00"}