{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7ZLIK4UF42CPNEDGKI5S5XRL6G","short_pith_number":"pith:7ZLIK4UF","canonical_record":{"source":{"id":"1903.01818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T13:39:06Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"5817ab23995547f5c1396db2ee7ae5392d04585d4c1ae82d83e7c9d14470229f","abstract_canon_sha256":"9730ec4db500a4929f65f13915ca9e7e3bef02d97dec6168a45a81586b958445"},"schema_version":"1.0"},"canonical_sha256":"fe56857285e684f69066523b2ede2bf19b1d22cd57b1b29e2e15e8874ba435b4","source":{"kind":"arxiv","id":"1903.01818","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01818","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01818v3","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01818","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"7ZLIK4UF42CP","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"7ZLIK4UF42CPNEDG","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"7ZLIK4UF","created_at":"2026-07-05T01:07:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7ZLIK4UF42CPNEDGKI5S5XRL6G","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T13:39:06Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"5817ab23995547f5c1396db2ee7ae5392d04585d4c1ae82d83e7c9d14470229f","abstract_canon_sha256":"9730ec4db500a4929f65f13915ca9e7e3bef02d97dec6168a45a81586b958445"},"schema_version":"1.0"},"canonical_sha256":"fe56857285e684f69066523b2ede2bf19b1d22cd57b1b29e2e15e8874ba435b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:10.548347Z","signature_b64":"CaH5qNKYRwYpVf0VhXThYrMcdFMq3QSovgAtTqwm0KxMh5+O+/a7QxRhgkfrVZA9YFQmqiDjbVTit/AOkHQODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe56857285e684f69066523b2ede2bf19b1d22cd57b1b29e2e15e8874ba435b4","last_reissued_at":"2026-07-05T01:07:10.547730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:10.547730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01818","source_version":3,"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-07-05T01:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JThbFO/UH4pISgLKYA+BlYi9iPr0N+E47kdZoqeN7eK3Vc7TQD9gxMJgzKnB1yx9UcFKgwHXfdSZ85F47o6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:16:45.472600Z"},"content_sha256":"526989c3827405927c54823b083fd0c3f726c70c6622613e3c1b363bbc665b85","schema_version":"1.0","event_id":"sha256:526989c3827405927c54823b083fd0c3f726c70c6622613e3c1b363bbc665b85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7ZLIK4UF42CPNEDGKI5S5XRL6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos","submitted_at":"2019-03-05T13:39:06Z","abstract_excerpt":"We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order methods: (1) they allow using two different extrapolation points to evaluate the gradients and to add the inertial force (we will empirically show that it is more efficient than using a single extrapolation point), (2) they allow to randomly picking the block of variables to update, and (3) they do not require a restarting step. We prove the subsequential converg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01818","kind":"arxiv","version":3},"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/1903.01818/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-07-05T01:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zj7kbzl47lC2OrWrvxk6IhqSjP1bR2cIK3Jky7ZbjzNtlsvTirr98jsYwN/aZaAg7yeI9VzMgtEk/kAZ+vNiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:16:45.473503Z"},"content_sha256":"9fc8b408fec97dad1fee105ab7cedc571257cc03cd64851ef2e1b5904f808fc5","schema_version":"1.0","event_id":"sha256:9fc8b408fec97dad1fee105ab7cedc571257cc03cd64851ef2e1b5904f808fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/bundle.json","state_url":"https://pith.science/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/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-08-16T21:16:45Z","links":{"resolver":"https://pith.science/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G","bundle":"https://pith.science/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/bundle.json","state":"https://pith.science/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZLIK4UF42CPNEDGKI5S5XRL6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7ZLIK4UF42CPNEDGKI5S5XRL6G","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":"9730ec4db500a4929f65f13915ca9e7e3bef02d97dec6168a45a81586b958445","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T13:39:06Z","title_canon_sha256":"5817ab23995547f5c1396db2ee7ae5392d04585d4c1ae82d83e7c9d14470229f"},"schema_version":"1.0","source":{"id":"1903.01818","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01818","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01818v3","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01818","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"7ZLIK4UF42CP","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"7ZLIK4UF42CPNEDG","created_at":"2026-07-05T01:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"7ZLIK4UF","created_at":"2026-07-05T01:07:10Z"}],"graph_snapshots":[{"event_id":"sha256:9fc8b408fec97dad1fee105ab7cedc571257cc03cd64851ef2e1b5904f808fc5","target":"graph","created_at":"2026-07-05T01:07:10Z","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/1903.01818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order methods: (1) they allow using two different extrapolation points to evaluate the gradients and to add the inertial force (we will empirically show that it is more efficient than using a single extrapolation point), (2) they allow to randomly picking the block of variables to update, and (3) they do not require a restarting step. We prove the subsequential converg","authors_text":"Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos","cross_cats":["cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T13:39:06Z","title":"Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01818","kind":"arxiv","version":3},"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:526989c3827405927c54823b083fd0c3f726c70c6622613e3c1b363bbc665b85","target":"record","created_at":"2026-07-05T01:07:10Z","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":"9730ec4db500a4929f65f13915ca9e7e3bef02d97dec6168a45a81586b958445","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T13:39:06Z","title_canon_sha256":"5817ab23995547f5c1396db2ee7ae5392d04585d4c1ae82d83e7c9d14470229f"},"schema_version":"1.0","source":{"id":"1903.01818","kind":"arxiv","version":3}},"canonical_sha256":"fe56857285e684f69066523b2ede2bf19b1d22cd57b1b29e2e15e8874ba435b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe56857285e684f69066523b2ede2bf19b1d22cd57b1b29e2e15e8874ba435b4","first_computed_at":"2026-07-05T01:07:10.547730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:10.547730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CaH5qNKYRwYpVf0VhXThYrMcdFMq3QSovgAtTqwm0KxMh5+O+/a7QxRhgkfrVZA9YFQmqiDjbVTit/AOkHQODg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:10.548347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01818","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:526989c3827405927c54823b083fd0c3f726c70c6622613e3c1b363bbc665b85","sha256:9fc8b408fec97dad1fee105ab7cedc571257cc03cd64851ef2e1b5904f808fc5"],"state_sha256":"251f4e92f6afbf476c02cd36db7dd67cdb1bf1a4f30b1ba0a4ed9928c980359f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6AAumyYlNmiaeec3hbivkKg3MZwsUt54kf1jyz4QzHjIz6nSN2weIDGGHlAGDNHzyM1hoMBvl50ADUKmRFAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:16:45.479155Z","bundle_sha256":"470db951f8599b6c73edc5771e800461dc9425b079527048f7230cf22be5110c"}}