{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M6V27VDBWXWE37C2NKMRSWMF3X","short_pith_number":"pith:M6V27VDB","canonical_record":{"source":{"id":"1801.05413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-16T18:50:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e89cb551c12f3f717b262c0970b3b320c04b6b3dc49695abdb71da68f3408598","abstract_canon_sha256":"b8bcd834eb01cb71c2867423b10adeca0d43ef1e107ba812c809922218c985ad"},"schema_version":"1.0"},"canonical_sha256":"67abafd461b5ec4dfc5a6a99195985ddd57b16e2b559faea1dbf7446fcbf24c9","source":{"kind":"arxiv","id":"1801.05413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05413","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05413v2","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05413","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"M6V27VDBWXWE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M6V27VDBWXWE37C2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M6V27VDB","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M6V27VDBWXWE37C2NKMRSWMF3X","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-16T18:50:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e89cb551c12f3f717b262c0970b3b320c04b6b3dc49695abdb71da68f3408598","abstract_canon_sha256":"b8bcd834eb01cb71c2867423b10adeca0d43ef1e107ba812c809922218c985ad"},"schema_version":"1.0"},"canonical_sha256":"67abafd461b5ec4dfc5a6a99195985ddd57b16e2b559faea1dbf7446fcbf24c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:50.707243Z","signature_b64":"X1EhxtobgbKkX8VPz9eMa+tWnEd+CODzBAdlY+qY3JKgz8EVEDXoBa/6cTUudOF4zkoYPk+yh6gnk7saP+IsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67abafd461b5ec4dfc5a6a99195985ddd57b16e2b559faea1dbf7446fcbf24c9","last_reissued_at":"2026-05-18T00:22:50.706868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:50.706868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05413","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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzvxxH2zgc9rm1wy9IgC+b/mkn2+hLptuf7YJj2hlWHVhzGdKiHjFeTJkw+sMRoqAC9Exy8cwK5Ls/9CHCadBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:28:50.299441Z"},"content_sha256":"4efb454815d6216f04af291d7887944f561649a14ee76f4a5bfdbac2208f13e6","schema_version":"1.0","event_id":"sha256:4efb454815d6216f04af291d7887944f561649a14ee76f4a5bfdbac2208f13e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M6V27VDBWXWE37C2NKMRSWMF3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Preconditioners for Proximal Algorithms on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel Cremers, Tao Wu, Thomas M\\\"ollenhoff, Zhenzhang Ye","submitted_at":"2018-01-16T18:50:13Z","abstract_excerpt":"We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct effective preconditioners. Such combinatorial preconditioners arise from partitioning the graph into forests. We prove that certain decompositions lead to a theoretically optimal condition number. We also show how ideal decompositions can be realized using matroid partitioning and propose efficient greedy variants thereof for large-scale problems. Coupled with specialized solvers for the resulting scaled proximal subproblems, the preconditioned algorithm achieves competit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05413","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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxWE+41g9GvvB2InY8dMR/PooXL5t+NwLQYjuBll0GgzwLVjXVXVtBjAaZjW7m98f7Kpiwfnja/skdTJNFzfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:28:50.299795Z"},"content_sha256":"330e067f55f06bae3677c19e723165d988e19bdd2813a084eea1618777957632","schema_version":"1.0","event_id":"sha256:330e067f55f06bae3677c19e723165d988e19bdd2813a084eea1618777957632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6V27VDBWXWE37C2NKMRSWMF3X/bundle.json","state_url":"https://pith.science/pith/M6V27VDBWXWE37C2NKMRSWMF3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6V27VDBWXWE37C2NKMRSWMF3X/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-04T18:28:50Z","links":{"resolver":"https://pith.science/pith/M6V27VDBWXWE37C2NKMRSWMF3X","bundle":"https://pith.science/pith/M6V27VDBWXWE37C2NKMRSWMF3X/bundle.json","state":"https://pith.science/pith/M6V27VDBWXWE37C2NKMRSWMF3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6V27VDBWXWE37C2NKMRSWMF3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M6V27VDBWXWE37C2NKMRSWMF3X","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":"b8bcd834eb01cb71c2867423b10adeca0d43ef1e107ba812c809922218c985ad","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-16T18:50:13Z","title_canon_sha256":"e89cb551c12f3f717b262c0970b3b320c04b6b3dc49695abdb71da68f3408598"},"schema_version":"1.0","source":{"id":"1801.05413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05413","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05413v2","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05413","created_at":"2026-05-18T00:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"M6V27VDBWXWE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M6V27VDBWXWE37C2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M6V27VDB","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:330e067f55f06bae3677c19e723165d988e19bdd2813a084eea1618777957632","target":"graph","created_at":"2026-05-18T00:22:50Z","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":"We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct effective preconditioners. Such combinatorial preconditioners arise from partitioning the graph into forests. We prove that certain decompositions lead to a theoretically optimal condition number. We also show how ideal decompositions can be realized using matroid partitioning and propose efficient greedy variants thereof for large-scale problems. Coupled with specialized solvers for the resulting scaled proximal subproblems, the preconditioned algorithm achieves competit","authors_text":"Daniel Cremers, Tao Wu, Thomas M\\\"ollenhoff, Zhenzhang Ye","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-16T18:50:13Z","title":"Combinatorial Preconditioners for Proximal Algorithms on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05413","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:4efb454815d6216f04af291d7887944f561649a14ee76f4a5bfdbac2208f13e6","target":"record","created_at":"2026-05-18T00:22:50Z","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":"b8bcd834eb01cb71c2867423b10adeca0d43ef1e107ba812c809922218c985ad","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-16T18:50:13Z","title_canon_sha256":"e89cb551c12f3f717b262c0970b3b320c04b6b3dc49695abdb71da68f3408598"},"schema_version":"1.0","source":{"id":"1801.05413","kind":"arxiv","version":2}},"canonical_sha256":"67abafd461b5ec4dfc5a6a99195985ddd57b16e2b559faea1dbf7446fcbf24c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67abafd461b5ec4dfc5a6a99195985ddd57b16e2b559faea1dbf7446fcbf24c9","first_computed_at":"2026-05-18T00:22:50.706868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:50.706868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X1EhxtobgbKkX8VPz9eMa+tWnEd+CODzBAdlY+qY3JKgz8EVEDXoBa/6cTUudOF4zkoYPk+yh6gnk7saP+IsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:50.707243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4efb454815d6216f04af291d7887944f561649a14ee76f4a5bfdbac2208f13e6","sha256:330e067f55f06bae3677c19e723165d988e19bdd2813a084eea1618777957632"],"state_sha256":"bd9591dcf15ddef9ff91044cae38c9ef08cfb94a5b5f750a72ae41793943956f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xR7fH0QTS7a+ZJ/pMhjZvbCE4aHhVeSP7r7lWVrMqnxZ23xfk/PCXz0ADX4+FLj8GqC+J5f6Kx52gkJsl6mCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:28:50.301842Z","bundle_sha256":"9f21bb72ac9ea72407bba22c0f8ce11bb9218bdaeef8038a3c4f74c7dad85f24"}}