{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O6EQYOADJ7377TZNQ77BHB6ZPK","short_pith_number":"pith:O6EQYOAD","canonical_record":{"source":{"id":"1806.09842","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-26T08:47:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"671bb9ac518377a744393cb8a731dbf8ffbf084e0b55b30e4c9edcde41949c41","abstract_canon_sha256":"b48d68772da5212a4267b192d8b4267b38194ef22b7e825ef192dca793858130"},"schema_version":"1.0"},"canonical_sha256":"77890c38034ff7ffcf2d87fe1387d97a9a3470c5150f4cbfcabf8b23415891d0","source":{"kind":"arxiv","id":"1806.09842","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09842","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09842v3","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09842","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"O6EQYOADJ737","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6EQYOADJ7377TZN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6EQYOAD","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O6EQYOADJ7377TZNQ77BHB6ZPK","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09842","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-26T08:47:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"671bb9ac518377a744393cb8a731dbf8ffbf084e0b55b30e4c9edcde41949c41","abstract_canon_sha256":"b48d68772da5212a4267b192d8b4267b38194ef22b7e825ef192dca793858130"},"schema_version":"1.0"},"canonical_sha256":"77890c38034ff7ffcf2d87fe1387d97a9a3470c5150f4cbfcabf8b23415891d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.763642Z","signature_b64":"qEh+rOmwT6hJqZpro0JUeE+vroCBFVs3PByacS/bqhYGXJ8usL0hRQTJcNhMMj2fBYYV7UzUF0XHNo7nkA/vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77890c38034ff7ffcf2d87fe1387d97a9a3470c5150f4cbfcabf8b23415891d0","last_reissued_at":"2026-05-18T00:03:36.763017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.763017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09842","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-05-18T00:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suKYT+5DX3XOEKTVyU6rPFYgHLwc2D3djJr4K3u5kjuu89lyAo0R3gsz8bK4/yRQVum7qpwgPrTl+cNsTd1rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:33.971228Z"},"content_sha256":"3b44c7d0c457042ea15e4bcfc37f6f214f3969537a3bf20eb0dbc41e1765dc13","schema_version":"1.0","event_id":"sha256:3b44c7d0c457042ea15e4bcfc37f6f214f3969537a3bf20eb0dbc41e1765dc13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O6EQYOADJ7377TZNQ77BHB6ZPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic Decomposable Submodular Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Niao He, Olgica Milenkovic, Pan Li","submitted_at":"2018-06-26T08:47:05Z","abstract_excerpt":"We introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization. The problem is closely related to decomposable submodular function minimization and arises in many learning on graphs and hypergraphs settings, such as graph-based semi-supervised learning and PageRank. We approach the problem via a new dual strategy and describe an objective that may be optimized via random coordinate descent (RCD) methods and projections onto cones. We also establish the linear convergence rate of the RCD algorithm and develop efficient projection algorithms with p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09842","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":""},"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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+r8DG2fVXYJQQIjWemkap8a6HbqO+UY4YYlvJkbQytCWsa5vbK5K9muLCE1YZyLGPrK7ElhBo35qb/igCUiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:33.971983Z"},"content_sha256":"45bcbaaf6e7962bd0b19deaf2b5590afdf8ef39fb0c8b1edb877eedb5b654838","schema_version":"1.0","event_id":"sha256:45bcbaaf6e7962bd0b19deaf2b5590afdf8ef39fb0c8b1edb877eedb5b654838"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/bundle.json","state_url":"https://pith.science/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/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-05T23:05:33Z","links":{"resolver":"https://pith.science/pith/O6EQYOADJ7377TZNQ77BHB6ZPK","bundle":"https://pith.science/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/bundle.json","state":"https://pith.science/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6EQYOADJ7377TZNQ77BHB6ZPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O6EQYOADJ7377TZNQ77BHB6ZPK","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":"b48d68772da5212a4267b192d8b4267b38194ef22b7e825ef192dca793858130","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-26T08:47:05Z","title_canon_sha256":"671bb9ac518377a744393cb8a731dbf8ffbf084e0b55b30e4c9edcde41949c41"},"schema_version":"1.0","source":{"id":"1806.09842","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09842","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09842v3","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09842","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"O6EQYOADJ737","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6EQYOADJ7377TZN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6EQYOAD","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:45bcbaaf6e7962bd0b19deaf2b5590afdf8ef39fb0c8b1edb877eedb5b654838","target":"graph","created_at":"2026-05-18T00:03:36Z","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 introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization. The problem is closely related to decomposable submodular function minimization and arises in many learning on graphs and hypergraphs settings, such as graph-based semi-supervised learning and PageRank. We approach the problem via a new dual strategy and describe an objective that may be optimized via random coordinate descent (RCD) methods and projections onto cones. We also establish the linear convergence rate of the RCD algorithm and develop efficient projection algorithms with p","authors_text":"Niao He, Olgica Milenkovic, Pan Li","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-26T08:47:05Z","title":"Quadratic Decomposable Submodular Function Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09842","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:3b44c7d0c457042ea15e4bcfc37f6f214f3969537a3bf20eb0dbc41e1765dc13","target":"record","created_at":"2026-05-18T00:03:36Z","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":"b48d68772da5212a4267b192d8b4267b38194ef22b7e825ef192dca793858130","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-26T08:47:05Z","title_canon_sha256":"671bb9ac518377a744393cb8a731dbf8ffbf084e0b55b30e4c9edcde41949c41"},"schema_version":"1.0","source":{"id":"1806.09842","kind":"arxiv","version":3}},"canonical_sha256":"77890c38034ff7ffcf2d87fe1387d97a9a3470c5150f4cbfcabf8b23415891d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77890c38034ff7ffcf2d87fe1387d97a9a3470c5150f4cbfcabf8b23415891d0","first_computed_at":"2026-05-18T00:03:36.763017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.763017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEh+rOmwT6hJqZpro0JUeE+vroCBFVs3PByacS/bqhYGXJ8usL0hRQTJcNhMMj2fBYYV7UzUF0XHNo7nkA/vCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.763642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09842","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b44c7d0c457042ea15e4bcfc37f6f214f3969537a3bf20eb0dbc41e1765dc13","sha256:45bcbaaf6e7962bd0b19deaf2b5590afdf8ef39fb0c8b1edb877eedb5b654838"],"state_sha256":"84c3864919ce482e9485bdc0d72d7aeb143ce02e6de90bb9ac5bc06ae717b06d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jsBYnLGdQYHR7HX9XuTajuoAXcEYB4Nc0XuzIjFt4IEXWecAeRnf/c4SqEmPBZSTLv31XDY930JEVJXqywhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:05:33.976712Z","bundle_sha256":"002ec145ec3b87dc8c7dd0309a4034586fbd82c000f2f8228f8538f5077b9234"}}