{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7BRDXHWLZEG5PFVII64QSPW2N5","short_pith_number":"pith:7BRDXHWL","canonical_record":{"source":{"id":"1309.6850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:59Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"7e50b7dc08fe0514645fdd3e431f2686830e2ad6d9b015200933eb2dd1cb99d3","abstract_canon_sha256":"0aff6c644937b46767b1670e0fabbaae8cf36fc32806c33a4d3107a86f3258c4"},"schema_version":"1.0"},"canonical_sha256":"f8623b9ecbc90dd796a847b9093eda6f5e16185803fb5c8c97eea43c5056c308","source":{"kind":"arxiv","id":"1309.6850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6850","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6850v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6850","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"7BRDXHWLZEG5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BRDXHWLZEG5PFVI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BRDXHWL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7BRDXHWLZEG5PFVII64QSPW2N5","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:59Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"7e50b7dc08fe0514645fdd3e431f2686830e2ad6d9b015200933eb2dd1cb99d3","abstract_canon_sha256":"0aff6c644937b46767b1670e0fabbaae8cf36fc32806c33a4d3107a86f3258c4"},"schema_version":"1.0"},"canonical_sha256":"f8623b9ecbc90dd796a847b9093eda6f5e16185803fb5c8c97eea43c5056c308","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.084079Z","signature_b64":"8OrCh3aRFXou9NP+1eaJi4P8xPtJX2OanMol+Y6qM1pH34/UdmS+Pca6L7RIaa/6nzYQAy7CmrbeW13Jl1NTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8623b9ecbc90dd796a847b9093eda6f5e16185803fb5c8c97eea43c5056c308","last_reissued_at":"2026-05-18T03:12:10.083473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.083473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6850","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEYQ3vTA/Uy+tGK4u7Epq8w3BA8DpNO1+wxxpHMmy3DATkwIt9m0RRPT9s/76VzwKjyxYcGBsGBZ6QcNroUtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:41:09.082648Z"},"content_sha256":"99e819b8f38008ba711756eac6b1391d272add21aa6f135d2cb4715d5122178d","schema_version":"1.0","event_id":"sha256:99e819b8f38008ba711756eac6b1391d272add21aa6f135d2cb4715d5122178d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7BRDXHWLZEG5PFVII64QSPW2N5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Convex Optimization under Submodular Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kiyohito Nagano, Yoshinobu Kawahara","submitted_at":"2013-09-26T12:45:59Z","abstract_excerpt":"A number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and we show that a wide range of convex optimization problems under submodular constraints can be solved much more efficiently than general submodular optimization methods by a reduction to a maximum flow problem. Furthermore, we give some applications, including sparse optimization methods, in which the proposed methods are effective. Additionally, we evaluate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6850","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySOpg/RULvEgL7myWkwU5J27uuYeS+y32Hbhg0WS3JTBhcQcttAOevbIxyjxRrBZ6Mi5SiZIAqbJDntl77mtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:41:09.082987Z"},"content_sha256":"eef13fd2fcbe7725097559affdb98159b4cd14ff7c8f4f1aa99c7b77ea2a3493","schema_version":"1.0","event_id":"sha256:eef13fd2fcbe7725097559affdb98159b4cd14ff7c8f4f1aa99c7b77ea2a3493"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BRDXHWLZEG5PFVII64QSPW2N5/bundle.json","state_url":"https://pith.science/pith/7BRDXHWLZEG5PFVII64QSPW2N5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BRDXHWLZEG5PFVII64QSPW2N5/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-08T22:41:09Z","links":{"resolver":"https://pith.science/pith/7BRDXHWLZEG5PFVII64QSPW2N5","bundle":"https://pith.science/pith/7BRDXHWLZEG5PFVII64QSPW2N5/bundle.json","state":"https://pith.science/pith/7BRDXHWLZEG5PFVII64QSPW2N5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BRDXHWLZEG5PFVII64QSPW2N5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7BRDXHWLZEG5PFVII64QSPW2N5","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":"0aff6c644937b46767b1670e0fabbaae8cf36fc32806c33a4d3107a86f3258c4","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:59Z","title_canon_sha256":"7e50b7dc08fe0514645fdd3e431f2686830e2ad6d9b015200933eb2dd1cb99d3"},"schema_version":"1.0","source":{"id":"1309.6850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6850","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6850v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6850","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"7BRDXHWLZEG5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BRDXHWLZEG5PFVI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BRDXHWL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:eef13fd2fcbe7725097559affdb98159b4cd14ff7c8f4f1aa99c7b77ea2a3493","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"A number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and we show that a wide range of convex optimization problems under submodular constraints can be solved much more efficiently than general submodular optimization methods by a reduction to a maximum flow problem. Furthermore, we give some applications, including sparse optimization methods, in which the proposed methods are effective. Additionally, we evaluate t","authors_text":"Kiyohito Nagano, Yoshinobu Kawahara","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:59Z","title":"Structured Convex Optimization under Submodular Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6850","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:99e819b8f38008ba711756eac6b1391d272add21aa6f135d2cb4715d5122178d","target":"record","created_at":"2026-05-18T03:12:10Z","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":"0aff6c644937b46767b1670e0fabbaae8cf36fc32806c33a4d3107a86f3258c4","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:59Z","title_canon_sha256":"7e50b7dc08fe0514645fdd3e431f2686830e2ad6d9b015200933eb2dd1cb99d3"},"schema_version":"1.0","source":{"id":"1309.6850","kind":"arxiv","version":1}},"canonical_sha256":"f8623b9ecbc90dd796a847b9093eda6f5e16185803fb5c8c97eea43c5056c308","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8623b9ecbc90dd796a847b9093eda6f5e16185803fb5c8c97eea43c5056c308","first_computed_at":"2026-05-18T03:12:10.083473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.083473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8OrCh3aRFXou9NP+1eaJi4P8xPtJX2OanMol+Y6qM1pH34/UdmS+Pca6L7RIaa/6nzYQAy7CmrbeW13Jl1NTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.084079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99e819b8f38008ba711756eac6b1391d272add21aa6f135d2cb4715d5122178d","sha256:eef13fd2fcbe7725097559affdb98159b4cd14ff7c8f4f1aa99c7b77ea2a3493"],"state_sha256":"5e22495725eba651a9bfb1a09a9728aa2d4ebf6cd92de7071a252668018c977b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuPa2rMf/VRJmFgCrB7phw4uCFLz/f1nr0Ym65hGc3FD6/5jesmHWrfeDdMUh3RnbIMzKhbTG7OhNlWD6jqyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:41:09.084915Z","bundle_sha256":"82a6aa1d2ad32a46271b654a569b8412066cec2b623207157c62e1d403d8a085"}}