{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JECIZJMXTPWP77UULZLTFBZDPJ","short_pith_number":"pith:JECIZJMX","canonical_record":{"source":{"id":"1111.6453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-28T14:45:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e64fdf6a69abf41d39e67450dcc875b80ca255f959a554d247654b5fee512ee4","abstract_canon_sha256":"ae4107e9429c8ff05a2079e03c6c7bc802d0704b350e1b783749207913ca48ec"},"schema_version":"1.0"},"canonical_sha256":"49048ca5979becfffe945e573287237a63d7104597a3aca274257bf9cc6477cc","source":{"kind":"arxiv","id":"1111.6453","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6453","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6453v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6453","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"JECIZJMXTPWP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JECIZJMXTPWP77UU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JECIZJMX","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JECIZJMXTPWP77UULZLTFBZDPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-28T14:45:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e64fdf6a69abf41d39e67450dcc875b80ca255f959a554d247654b5fee512ee4","abstract_canon_sha256":"ae4107e9429c8ff05a2079e03c6c7bc802d0704b350e1b783749207913ca48ec"},"schema_version":"1.0"},"canonical_sha256":"49048ca5979becfffe945e573287237a63d7104597a3aca274257bf9cc6477cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:09.775355Z","signature_b64":"5vv0CIfCLLJEGOxc9cSMbP942P+HcumVKf1Ex+Uk7A/XnLCkd3PjY364ugQ+krJED3hGrMZmxehhLBqQJXouAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49048ca5979becfffe945e573287237a63d7104597a3aca274257bf9cc6477cc","last_reissued_at":"2026-05-18T03:11:09.774536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:09.774536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6453","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Vo3Cytm+LiP8lwtT4fmd7cORW0USbis8RyLqOTUYI1Tn0QWl2w46np79b0QY/Nio01ghAgfKLZJmJ/OFVDcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:40.939814Z"},"content_sha256":"3e3f52e8d63326023fb6066142176641f124619568bac21f88623614f080e1c7","schema_version":"1.0","event_id":"sha256:3e3f52e8d63326023fb6066142176641f124619568bac21f88623614f080e1c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JECIZJMXTPWP77UULZLTFBZDPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning with Submodular Functions: A Convex Optimization Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS, INRIA Paris - Rocquencourt)","submitted_at":"2011-11-28T14:45:01Z","abstract_excerpt":"Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful set of regularization functions for supervised and unsupervised learning. In this monograph, we present the theory of submodular functions from a convex analysis perspective, presenting tight links between certain polyhedra, combinatorial optimization and convex optimization problems. In particular, we show how submodular function minimization is equivalent t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6453","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CA18xz7LveoKFSmM/aGVU2OldwcxGl2lQjQzKhSpOPQ94dv/Yw4cg9T5QnpI96XXaEPj6kHb7w/f04+5xfKICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:40.940436Z"},"content_sha256":"81b8fcec9c68a687a777a66bf70138437eaf8474633b95639036c5a02683343f","schema_version":"1.0","event_id":"sha256:81b8fcec9c68a687a777a66bf70138437eaf8474633b95639036c5a02683343f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JECIZJMXTPWP77UULZLTFBZDPJ/bundle.json","state_url":"https://pith.science/pith/JECIZJMXTPWP77UULZLTFBZDPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JECIZJMXTPWP77UULZLTFBZDPJ/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-25T16:58:40Z","links":{"resolver":"https://pith.science/pith/JECIZJMXTPWP77UULZLTFBZDPJ","bundle":"https://pith.science/pith/JECIZJMXTPWP77UULZLTFBZDPJ/bundle.json","state":"https://pith.science/pith/JECIZJMXTPWP77UULZLTFBZDPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JECIZJMXTPWP77UULZLTFBZDPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JECIZJMXTPWP77UULZLTFBZDPJ","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":"ae4107e9429c8ff05a2079e03c6c7bc802d0704b350e1b783749207913ca48ec","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-28T14:45:01Z","title_canon_sha256":"e64fdf6a69abf41d39e67450dcc875b80ca255f959a554d247654b5fee512ee4"},"schema_version":"1.0","source":{"id":"1111.6453","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6453","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6453v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6453","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"JECIZJMXTPWP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JECIZJMXTPWP77UU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JECIZJMX","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:81b8fcec9c68a687a777a66bf70138437eaf8474633b95639036c5a02683343f","target":"graph","created_at":"2026-05-18T03:11:09Z","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 functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful set of regularization functions for supervised and unsupervised learning. In this monograph, we present the theory of submodular functions from a convex analysis perspective, presenting tight links between certain polyhedra, combinatorial optimization and convex optimization problems. In particular, we show how submodular function minimization is equivalent t","authors_text":"Francis Bach (LIENS, INRIA Paris - Rocquencourt)","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-28T14:45:01Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6453","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:3e3f52e8d63326023fb6066142176641f124619568bac21f88623614f080e1c7","target":"record","created_at":"2026-05-18T03:11:09Z","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":"ae4107e9429c8ff05a2079e03c6c7bc802d0704b350e1b783749207913ca48ec","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-28T14:45:01Z","title_canon_sha256":"e64fdf6a69abf41d39e67450dcc875b80ca255f959a554d247654b5fee512ee4"},"schema_version":"1.0","source":{"id":"1111.6453","kind":"arxiv","version":2}},"canonical_sha256":"49048ca5979becfffe945e573287237a63d7104597a3aca274257bf9cc6477cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49048ca5979becfffe945e573287237a63d7104597a3aca274257bf9cc6477cc","first_computed_at":"2026-05-18T03:11:09.774536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:09.774536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vv0CIfCLLJEGOxc9cSMbP942P+HcumVKf1Ex+Uk7A/XnLCkd3PjY364ugQ+krJED3hGrMZmxehhLBqQJXouAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:09.775355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6453","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e3f52e8d63326023fb6066142176641f124619568bac21f88623614f080e1c7","sha256:81b8fcec9c68a687a777a66bf70138437eaf8474633b95639036c5a02683343f"],"state_sha256":"9ce19a73e3463207e515df2683518ad36f50064e21c6009591f7dae349789e15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i11poi4QKEYpQJa2QPDeuOZzFOoq3Tb3Tfn5APEk9hc/eZnKNiDaRTMqB5Ogdcra9fYjjrHZeb0o/aIbAFaVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:58:40.943965Z","bundle_sha256":"7285a6400f9188d3abf8fc592a8a3a2d1d9661e7cc4cfd0312d8a961ffe6e50a"}}