{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6VWVS2E5NZG2XYH3OSVLGMU4TK","short_pith_number":"pith:6VWVS2E5","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"},"canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","source":{"kind":"arxiv","id":"2407.18150","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.18150","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"2407.18150v5","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18150","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"6VWVS2E5NZG2","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VWVS2E5NZG2XYH3","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VWVS2E5","created_at":"2026-06-12T01:09:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6VWVS2E5NZG2XYH3OSVLGMU4TK","target":"record","payload":{"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"},"canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","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"},"source_kind":"arxiv","source_id":"2407.18150","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFQkEdRGt8ye8RJL8xnBrabVyKC+6CT8Nn7owPWxH6hw5ekwkZQ7pNWnD4ECec+aMB3twJMFf7IT/wwZNidmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:16:55.958455Z"},"content_sha256":"ce01b86b83625fbb37bdfd5ecaabe3085e79d550edc1d0d926a4c21626336f43","schema_version":"1.0","event_id":"sha256:ce01b86b83625fbb37bdfd5ecaabe3085e79d550edc1d0d926a4c21626336f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6VWVS2E5NZG2XYH3OSVLGMU4TK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+Zc993xTwXe6cTqER50awgzz7L1W/sP6MNVo1jtpE9BkUkmpXqAkqxPnp+EDksQlV45c9kZ9d552LYT8xNFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:16:55.958824Z"},"content_sha256":"3f18222e1065d96f162990addff9dccf78644ca4ff12df18dc535af29b20c43f","schema_version":"1.0","event_id":"sha256:3f18222e1065d96f162990addff9dccf78644ca4ff12df18dc535af29b20c43f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/bundle.json","state_url":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T08:16:55Z","links":{"resolver":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK","bundle":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/bundle.json","state":"https://pith.science/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VWVS2E5NZG2XYH3OSVLGMU4TK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6VWVS2E5NZG2XYH3OSVLGMU4TK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5db219d4dcfe9b1c8be656ec4482ec43a520014356d3d30d0fe865261cfb6ee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-25T16:00:16Z","title_canon_sha256":"cf56801b5b85cbf3d44acc7ae21f8b9a599ca55a7643d04df4eef146a833f4a5"},"schema_version":"1.0","source":{"id":"2407.18150","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.18150","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"2407.18150v5","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18150","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"6VWVS2E5NZG2","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VWVS2E5NZG2XYH3","created_at":"2026-06-12T01:09:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VWVS2E5","created_at":"2026-06-12T01:09:04Z"}],"graph_snapshots":[{"event_id":"sha256:3f18222e1065d96f162990addff9dccf78644ca4ff12df18dc535af29b20c43f","target":"graph","created_at":"2026-06-12T01:09:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.18150/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Cristofari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-25T16:00:16Z","title":"Block cubic Newton with greedy selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18150","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce01b86b83625fbb37bdfd5ecaabe3085e79d550edc1d0d926a4c21626336f43","target":"record","created_at":"2026-06-12T01:09:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5db219d4dcfe9b1c8be656ec4482ec43a520014356d3d30d0fe865261cfb6ee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-25T16:00:16Z","title_canon_sha256":"cf56801b5b85cbf3d44acc7ae21f8b9a599ca55a7643d04df4eef146a833f4a5"},"schema_version":"1.0","source":{"id":"2407.18150","kind":"arxiv","version":5}},"canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f56d59689d6e4dabe0fb74aab3329c9abe13b3cd65ee548c44ffafe4a0c4492f","first_computed_at":"2026-06-12T01:09:04.990091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:04.990091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpALOG0mdNxayauEW6NIgbSTQDrelviCzLsdq+bvDVPlcTipbcl/QVGOf0lkUlpB24wLMMbXNQI/Jz4vKEGfCw==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:04.991503Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.18150","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce01b86b83625fbb37bdfd5ecaabe3085e79d550edc1d0d926a4c21626336f43","sha256:3f18222e1065d96f162990addff9dccf78644ca4ff12df18dc535af29b20c43f"],"state_sha256":"5fb41800ea45f827773a161835c962d4dbeff4f39f57afb68dc2b785cc3e7c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/Oci1fPD4ke1xpWshNWNxIuCFk9YygnKC+BtCADgqYS1IZ3FFDG81bTR7XPj7D/aC2zkR8UZvv3+oy176g2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:16:55.960635Z","bundle_sha256":"1fc24b741b546a27e00b14f418dd33b0d3fa41c5f50bab4819922a666b062248"}}