{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QCQXHMPHYOZMMG6PMSW2GY4RZS","short_pith_number":"pith:QCQXHMPH","canonical_record":{"source":{"id":"1712.03010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"1353b03cd81d11af11255000635e02dd04f830f5de2f7c0f1909d75cb0df638b","abstract_canon_sha256":"8c388251106034840782d572f53397d6c0d3c13804810f17535c4fe5a8cb7167"},"schema_version":"1.0"},"canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","source":{"kind":"arxiv","id":"1712.03010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03010","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03010v2","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03010","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"QCQXHMPHYOZM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCQXHMPHYOZMMG6P","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCQXHMPH","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QCQXHMPHYOZMMG6PMSW2GY4RZS","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"1353b03cd81d11af11255000635e02dd04f830f5de2f7c0f1909d75cb0df638b","abstract_canon_sha256":"8c388251106034840782d572f53397d6c0d3c13804810f17535c4fe5a8cb7167"},"schema_version":"1.0"},"canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:17.822901Z","signature_b64":"hpFVKYKu/SdAFUYNpKecDbFi7pCj7Jc0zbkYqsIo3MESh3VDyjP76vZ96FXGe4bUXWXcfcy6nVLcp2YoEmj5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","last_reissued_at":"2026-05-17T23:59:17.822355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:17.822355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03010","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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuqM+EnmiPyyDktIoR6hwAlata/QsozpN2Cs69KAZfd7VxEbNGcDb4V1R8bV1qhFf6t52cSccZ21rjcg55XCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:55:32.039027Z"},"content_sha256":"f2b51eb6abfe9b2411374ae98327810b833855abf367db8ffec0e11de3c847e3","schema_version":"1.0","event_id":"sha256:f2b51eb6abfe9b2411374ae98327810b833855abf367db8ffec0e11de3c847e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QCQXHMPHYOZMMG6PMSW2GY4RZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coordinate Descent with Bandit Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","submitted_at":"2017-12-08T10:23:30Z","abstract_excerpt":"Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which would effectively negate the improvement in computational tractability that coordinate descent is intended to afford. To address this, we propose a new adaptive method for selecting a coordinate. First, we find a lower bound on the amount the cost function decreases when a coord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03010","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-17T23:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1nMmsI7BVd6JmA6E64i/26a6xHB1tliWcpaMnK1FKg7xR4SilwZ3sa+bqK9wY5U57P2vmkE7dFAHJ756dqlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:55:32.039416Z"},"content_sha256":"4673ee01690e5fcea105e59aa7b486e5b1be8162f476c8f492bcc3ad5cf934ea","schema_version":"1.0","event_id":"sha256:4673ee01690e5fcea105e59aa7b486e5b1be8162f476c8f492bcc3ad5cf934ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/bundle.json","state_url":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/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-24T03:55:32Z","links":{"resolver":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS","bundle":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/bundle.json","state":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QCQXHMPHYOZMMG6PMSW2GY4RZS","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":"8c388251106034840782d572f53397d6c0d3c13804810f17535c4fe5a8cb7167","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","title_canon_sha256":"1353b03cd81d11af11255000635e02dd04f830f5de2f7c0f1909d75cb0df638b"},"schema_version":"1.0","source":{"id":"1712.03010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03010","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03010v2","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03010","created_at":"2026-05-17T23:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"QCQXHMPHYOZM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCQXHMPHYOZMMG6P","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCQXHMPH","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:4673ee01690e5fcea105e59aa7b486e5b1be8162f476c8f492bcc3ad5cf934ea","target":"graph","created_at":"2026-05-17T23:59:17Z","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":"Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which would effectively negate the improvement in computational tractability that coordinate descent is intended to afford. To address this, we propose a new adaptive method for selecting a coordinate. First, we find a lower bound on the amount the cost function decreases when a coord","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","cross_cats":["cs.AI","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","title":"Coordinate Descent with Bandit Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03010","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:f2b51eb6abfe9b2411374ae98327810b833855abf367db8ffec0e11de3c847e3","target":"record","created_at":"2026-05-17T23:59:17Z","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":"8c388251106034840782d572f53397d6c0d3c13804810f17535c4fe5a8cb7167","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","title_canon_sha256":"1353b03cd81d11af11255000635e02dd04f830f5de2f7c0f1909d75cb0df638b"},"schema_version":"1.0","source":{"id":"1712.03010","kind":"arxiv","version":2}},"canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","first_computed_at":"2026-05-17T23:59:17.822355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:17.822355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hpFVKYKu/SdAFUYNpKecDbFi7pCj7Jc0zbkYqsIo3MESh3VDyjP76vZ96FXGe4bUXWXcfcy6nVLcp2YoEmj5BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:17.822901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2b51eb6abfe9b2411374ae98327810b833855abf367db8ffec0e11de3c847e3","sha256:4673ee01690e5fcea105e59aa7b486e5b1be8162f476c8f492bcc3ad5cf934ea"],"state_sha256":"664b3b1d8ea3667845222bff3692a989bcdbae4a8f9200717c945f147bd42048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gIwFE76SNx5My60EGHG2hx9vKBX1F5R8/QUQZE43+gnxhT3MXzAaWFWHSC1eJgt3iq6wmww0cfitQuczoQxdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T03:55:32.041837Z","bundle_sha256":"b8f8a15b2e79260cd0a0378a66b7f7c10dd5934bf25f3f3eaed025b81945d0db"}}