{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JA2UWO5QVNJ6ICFRWNNDVI4MSE","short_pith_number":"pith:JA2UWO5Q","canonical_record":{"source":{"id":"1502.02643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:31:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"25623174143f8f7aba362048d8e8d686ca65806aae835e5d575f82294285476e","abstract_canon_sha256":"83cdf52aeb7c8e3e8e6627d5bbb540e55f20d866cbd624c0a71a6bb75e51e8ab"},"schema_version":"1.0"},"canonical_sha256":"48354b3bb0ab53e408b1b35a3aa38c91117def5902b8898082f3371753de9ba8","source":{"kind":"arxiv","id":"1502.02643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02643","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02643v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02643","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"JA2UWO5QVNJ6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JA2UWO5QVNJ6ICFR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JA2UWO5Q","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JA2UWO5QVNJ6ICFRWNNDVI4MSE","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:31:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"25623174143f8f7aba362048d8e8d686ca65806aae835e5d575f82294285476e","abstract_canon_sha256":"83cdf52aeb7c8e3e8e6627d5bbb540e55f20d866cbd624c0a71a6bb75e51e8ab"},"schema_version":"1.0"},"canonical_sha256":"48354b3bb0ab53e408b1b35a3aa38c91117def5902b8898082f3371753de9ba8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:41.572509Z","signature_b64":"/BvnrTXEgQd6pdOAM3HDpTLzR+pUq9+D+YdawOljyS/mPgZyutoII+9216dDxVy0sW1gzJTC4moQLOzxCXnGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48354b3bb0ab53e408b1b35a3aa38c91117def5902b8898082f3371753de9ba8","last_reissued_at":"2026-05-18T02:27:41.571553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:41.571553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02643","source_version":1,"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-18T02:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKG0SayQMquiQqPYCW8mfKh2avmR40pqxlepBrT/MdaG8JyjIJCcHBfIUhpMx+kFYkJjCP4G+Iu38S6nGVKDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:21:48.728084Z"},"content_sha256":"0d9412ab995ffc3184b36ca13e407b0a89d101e934a662e432b279b4f2c2f126","schema_version":"1.0","event_id":"sha256:0d9412ab995ffc3184b36ca13e407b0a89d101e934a662e432b279b4f2c2f126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JA2UWO5QVNJ6ICFRWNNDVI4MSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2015-02-09T20:31:18Z","abstract_excerpt":"Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have high running times and are unsuitable for large-scale problems. Recent work have used convex optimization techniques to obtain very practical algorithms for minimizing functions that are sums of ``simple\" functions. In this paper, we use random coordinate descent methods to obtain algorithms with faster linear convergence rates and cheaper iteration costs. C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02643","kind":"arxiv","version":1},"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-18T02:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wGmhxFJzMP+1DdTKKDslBw95ZojdMjtXJxd8fVtjAxYcl3jdGit1kSyxA7unVoAQiI7njXzK0p3g2xbMCrGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:21:48.728729Z"},"content_sha256":"d3826f50cf3109450f6bb81f0204a30ba602717e7d399d89ac9c715de7de6f9e","schema_version":"1.0","event_id":"sha256:d3826f50cf3109450f6bb81f0204a30ba602717e7d399d89ac9c715de7de6f9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/bundle.json","state_url":"https://pith.science/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/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-11T22:21:48Z","links":{"resolver":"https://pith.science/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE","bundle":"https://pith.science/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/bundle.json","state":"https://pith.science/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA2UWO5QVNJ6ICFRWNNDVI4MSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JA2UWO5QVNJ6ICFRWNNDVI4MSE","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":"83cdf52aeb7c8e3e8e6627d5bbb540e55f20d866cbd624c0a71a6bb75e51e8ab","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:31:18Z","title_canon_sha256":"25623174143f8f7aba362048d8e8d686ca65806aae835e5d575f82294285476e"},"schema_version":"1.0","source":{"id":"1502.02643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02643","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02643v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02643","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"JA2UWO5QVNJ6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JA2UWO5QVNJ6ICFR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JA2UWO5Q","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d3826f50cf3109450f6bb81f0204a30ba602717e7d399d89ac9c715de7de6f9e","target":"graph","created_at":"2026-05-18T02:27:41Z","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":"Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have high running times and are unsuitable for large-scale problems. Recent work have used convex optimization techniques to obtain very practical algorithms for minimizing functions that are sums of ``simple\" functions. In this paper, we use random coordinate descent methods to obtain algorithms with faster linear convergence rates and cheaper iteration costs. C","authors_text":"Alina Ene, Huy L. Nguyen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:31:18Z","title":"Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02643","kind":"arxiv","version":1},"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:0d9412ab995ffc3184b36ca13e407b0a89d101e934a662e432b279b4f2c2f126","target":"record","created_at":"2026-05-18T02:27:41Z","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":"83cdf52aeb7c8e3e8e6627d5bbb540e55f20d866cbd624c0a71a6bb75e51e8ab","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:31:18Z","title_canon_sha256":"25623174143f8f7aba362048d8e8d686ca65806aae835e5d575f82294285476e"},"schema_version":"1.0","source":{"id":"1502.02643","kind":"arxiv","version":1}},"canonical_sha256":"48354b3bb0ab53e408b1b35a3aa38c91117def5902b8898082f3371753de9ba8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48354b3bb0ab53e408b1b35a3aa38c91117def5902b8898082f3371753de9ba8","first_computed_at":"2026-05-18T02:27:41.571553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:41.571553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/BvnrTXEgQd6pdOAM3HDpTLzR+pUq9+D+YdawOljyS/mPgZyutoII+9216dDxVy0sW1gzJTC4moQLOzxCXnGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:41.572509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d9412ab995ffc3184b36ca13e407b0a89d101e934a662e432b279b4f2c2f126","sha256:d3826f50cf3109450f6bb81f0204a30ba602717e7d399d89ac9c715de7de6f9e"],"state_sha256":"fc42ac61211fb3ccb7a63933c436d333ccae467c0905fda3c80515af95f60571"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/VQhO5jBkZv5PqWz7TKvUB1rq+N1xuEqP/v2noytZrgq+Cw/voWAtTnWe7KKKD/OrjMS+X4R51HoFMUYJN5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:21:48.732063Z","bundle_sha256":"77232d38ccd648bf06c9ebfa2f683ceb617d26b57d1ac45adce7bd70f0f27c35"}}