{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IJUEHVJBYMJG2EXQG6XOEGAUXT","short_pith_number":"pith:IJUEHVJB","canonical_record":{"source":{"id":"1610.00040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-30T21:55:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2f41ee31d24925dbf28f68e705e5c242dc39063c23fbb5c8c11ae247f785c6ac","abstract_canon_sha256":"f65f6ee0a7f16934132d17b7fffb41da3e14293e9d8ecd6958665ba0fb74ec4c"},"schema_version":"1.0"},"canonical_sha256":"426843d521c3126d12f037aee21814bcc5810f40fea09c8b572988d2962f2995","source":{"kind":"arxiv","id":"1610.00040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00040","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00040v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00040","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"IJUEHVJBYMJG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJUEHVJBYMJG2EXQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJUEHVJB","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IJUEHVJBYMJG2EXQG6XOEGAUXT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-30T21:55:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2f41ee31d24925dbf28f68e705e5c242dc39063c23fbb5c8c11ae247f785c6ac","abstract_canon_sha256":"f65f6ee0a7f16934132d17b7fffb41da3e14293e9d8ecd6958665ba0fb74ec4c"},"schema_version":"1.0"},"canonical_sha256":"426843d521c3126d12f037aee21814bcc5810f40fea09c8b572988d2962f2995","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.090278Z","signature_b64":"JyjiHAOi0+2lMDGsg0OQuiQNBvOiMWw1nY681QR/eoVqf8fzouUjR5t2ZqoMQLrOUIRi+KZRie3BpoNPYGnTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426843d521c3126d12f037aee21814bcc5810f40fea09c8b572988d2962f2995","last_reissued_at":"2026-05-18T00:52:55.089662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.089662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00040","source_version":2,"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-05-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHYILVSJnwvu55tUxdfPLJ3ZCNNO/+BL1V3c3tpRpLWipYdvYJ77E9mYbwW6MuUQgwP8GrRElAAL5cX6T1xNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:22:20.212152Z"},"content_sha256":"d815998ee1fb770a80cdb8fc47da0ae0e3b23c4898368b38ede9cb396888d167","schema_version":"1.0","event_id":"sha256:d815998ee1fb770a80cdb8fc47da0ae0e3b23c4898368b38ede9cb396888d167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IJUEHVJBYMJG2EXQG6XOEGAUXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Primer on Coordinate Descent Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hao-Jun Michael Shi, Shenyinying Tu, Wotao Yin, Yangyang Xu","submitted_at":"2016-09-30T21:55:55Z","abstract_excerpt":"This monograph presents a class of algorithms called coordinate descent algorithms for mathematicians, statisticians, and engineers outside the field of optimization. This particular class of algorithms has recently gained popularity due to their effectiveness in solving large-scale optimization problems in machine learning, compressed sensing, image processing, and computational statistics. Coordinate descent algorithms solve optimization problems by successively minimizing along each coordinate or coordinate hyperplane, which is ideal for parallelized and distributed computing. Avoiding deta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00040","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":""},"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-05-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6morYMoee7e19t+qc+vBUktTCx6fja3zZFd1eP4wDD9ROhpQy47e8R+gjX6UbbJfiJu8UVESfIu/cCcGDxu6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:22:20.213082Z"},"content_sha256":"8361cdb2aa051920ad92180b81d866b9e74b1604bcf412464371bb82d069e37b","schema_version":"1.0","event_id":"sha256:8361cdb2aa051920ad92180b81d866b9e74b1604bcf412464371bb82d069e37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/bundle.json","state_url":"https://pith.science/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/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-05-30T18:22:20Z","links":{"resolver":"https://pith.science/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT","bundle":"https://pith.science/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/bundle.json","state":"https://pith.science/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJUEHVJBYMJG2EXQG6XOEGAUXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IJUEHVJBYMJG2EXQG6XOEGAUXT","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":"f65f6ee0a7f16934132d17b7fffb41da3e14293e9d8ecd6958665ba0fb74ec4c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-30T21:55:55Z","title_canon_sha256":"2f41ee31d24925dbf28f68e705e5c242dc39063c23fbb5c8c11ae247f785c6ac"},"schema_version":"1.0","source":{"id":"1610.00040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00040","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00040v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00040","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"IJUEHVJBYMJG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJUEHVJBYMJG2EXQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJUEHVJB","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:8361cdb2aa051920ad92180b81d866b9e74b1604bcf412464371bb82d069e37b","target":"graph","created_at":"2026-05-18T00:52:55Z","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"},"paper":{"abstract_excerpt":"This monograph presents a class of algorithms called coordinate descent algorithms for mathematicians, statisticians, and engineers outside the field of optimization. This particular class of algorithms has recently gained popularity due to their effectiveness in solving large-scale optimization problems in machine learning, compressed sensing, image processing, and computational statistics. Coordinate descent algorithms solve optimization problems by successively minimizing along each coordinate or coordinate hyperplane, which is ideal for parallelized and distributed computing. Avoiding deta","authors_text":"Hao-Jun Michael Shi, Shenyinying Tu, Wotao Yin, Yangyang Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-30T21:55:55Z","title":"A Primer on Coordinate Descent Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00040","kind":"arxiv","version":2},"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:d815998ee1fb770a80cdb8fc47da0ae0e3b23c4898368b38ede9cb396888d167","target":"record","created_at":"2026-05-18T00:52:55Z","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":"f65f6ee0a7f16934132d17b7fffb41da3e14293e9d8ecd6958665ba0fb74ec4c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-30T21:55:55Z","title_canon_sha256":"2f41ee31d24925dbf28f68e705e5c242dc39063c23fbb5c8c11ae247f785c6ac"},"schema_version":"1.0","source":{"id":"1610.00040","kind":"arxiv","version":2}},"canonical_sha256":"426843d521c3126d12f037aee21814bcc5810f40fea09c8b572988d2962f2995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"426843d521c3126d12f037aee21814bcc5810f40fea09c8b572988d2962f2995","first_computed_at":"2026-05-18T00:52:55.089662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:55.089662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JyjiHAOi0+2lMDGsg0OQuiQNBvOiMWw1nY681QR/eoVqf8fzouUjR5t2ZqoMQLrOUIRi+KZRie3BpoNPYGnTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:55.090278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d815998ee1fb770a80cdb8fc47da0ae0e3b23c4898368b38ede9cb396888d167","sha256:8361cdb2aa051920ad92180b81d866b9e74b1604bcf412464371bb82d069e37b"],"state_sha256":"82edda466546f90ee057638c1e49c9e1fca3358e06be26dddf28020731ee8b45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjnPH6qbkurTlEgyXjmAvNgL3jmiYBFRicfudDb99JaPa7Xh3NJS/A7fWja1E77I36iy1LP4axrfvIUW8jqpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:22:20.217968Z","bundle_sha256":"ec488b7341a8d96e1fcff91fa4f3c41ef6be9a607545e42948436fa1a190983e"}}