{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VMX2CIP6YOAVBLRROJTAUJ6FQD","short_pith_number":"pith:VMX2CIP6","canonical_record":{"source":{"id":"2401.08330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-16T12:49:10Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"be03b51612454f36c3a883d069189badfbf818f54e590cf6f1d69ec778b8e201","abstract_canon_sha256":"7fb2fa37551a2f543ae8a159dc0947348c1a0c326ae102df7ba18e6cc8cb8768"},"schema_version":"1.0"},"canonical_sha256":"ab2fa121fec38150ae3172660a27c580d2f873b8294c4b8800dd851374e9f766","source":{"kind":"arxiv","id":"2401.08330","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.08330","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2401.08330v2","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08330","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"VMX2CIP6YOAV","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"VMX2CIP6YOAVBLRR","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"VMX2CIP6","created_at":"2026-07-05T08:47:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VMX2CIP6YOAVBLRROJTAUJ6FQD","target":"record","payload":{"canonical_record":{"source":{"id":"2401.08330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-16T12:49:10Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"be03b51612454f36c3a883d069189badfbf818f54e590cf6f1d69ec778b8e201","abstract_canon_sha256":"7fb2fa37551a2f543ae8a159dc0947348c1a0c326ae102df7ba18e6cc8cb8768"},"schema_version":"1.0"},"canonical_sha256":"ab2fa121fec38150ae3172660a27c580d2f873b8294c4b8800dd851374e9f766","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:49.316494Z","signature_b64":"Qzt8uP7vcggg5EVQ9fFoyKSnCOawIC/+P/8jaelqJfu2llJwlSJxsLRWJhClOat8jSfCuSkJGN2TlRvnQDgLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2fa121fec38150ae3172660a27c580d2f873b8294c4b8800dd851374e9f766","last_reissued_at":"2026-07-05T08:47:49.316047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:49.316047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.08330","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-07-05T08:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toH9B/fETuJASUF08MVWJIWJiDKU6rT3qB454pIyJkMlsXws1to+Wl0DcF6ogGgTtNPK6BcXvmfnTEPTyGxXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:01:48.141245Z"},"content_sha256":"d9e0535e6f3c3a4ae9375cc9412ee01cac13b301b76ac5076a6db40aefad62e0","schema_version":"1.0","event_id":"sha256:d9e0535e6f3c3a4ae9375cc9412ee01cac13b301b76ac5076a6db40aefad62e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VMX2CIP6YOAVBLRROJTAUJ6FQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Jialin Zhang, Qixin Zhang, Xiaoming Sun, Yu Yang, Zaiyi Chen, Zengde Deng, Zongqi Wan","submitted_at":"2024-01-16T12:49:10Z","abstract_excerpt":"Projected Gradient Ascent (PGA) is the most commonly used optimization scheme in machine learning and operations research areas. Nevertheless, numerous studies and examples have shown that the PGA methods may fail to achieve the tight approximation ratio for continuous DR-submodular maximization problems. To address this challenge, we present a boosting technique in this paper, which can efficiently improve the approximation guarantee of the standard PGA to \\emph{optimal} with only small modifications on the objective function. The fundamental idea of our boosting technique is to exploit non-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08330","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.08330/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vcNZf6c+fAZwY20oznWbe9tc8d52XUYfOqwzB1RU2eMFQ34LpJW13fak1aqKHNhWCOkydAgrIVZeOQwoQa4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:01:48.141774Z"},"content_sha256":"a6a2e8745d3d91b6ffc40c4924f4396fdf7838c1212300818f1713737b932334","schema_version":"1.0","event_id":"sha256:a6a2e8745d3d91b6ffc40c4924f4396fdf7838c1212300818f1713737b932334"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/bundle.json","state_url":"https://pith.science/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/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-08-10T19:01:48Z","links":{"resolver":"https://pith.science/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD","bundle":"https://pith.science/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/bundle.json","state":"https://pith.science/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMX2CIP6YOAVBLRROJTAUJ6FQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VMX2CIP6YOAVBLRROJTAUJ6FQD","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":"7fb2fa37551a2f543ae8a159dc0947348c1a0c326ae102df7ba18e6cc8cb8768","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-16T12:49:10Z","title_canon_sha256":"be03b51612454f36c3a883d069189badfbf818f54e590cf6f1d69ec778b8e201"},"schema_version":"1.0","source":{"id":"2401.08330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.08330","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2401.08330v2","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08330","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"VMX2CIP6YOAV","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"VMX2CIP6YOAVBLRR","created_at":"2026-07-05T08:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"VMX2CIP6","created_at":"2026-07-05T08:47:49Z"}],"graph_snapshots":[{"event_id":"sha256:a6a2e8745d3d91b6ffc40c4924f4396fdf7838c1212300818f1713737b932334","target":"graph","created_at":"2026-07-05T08:47:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.08330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Projected Gradient Ascent (PGA) is the most commonly used optimization scheme in machine learning and operations research areas. Nevertheless, numerous studies and examples have shown that the PGA methods may fail to achieve the tight approximation ratio for continuous DR-submodular maximization problems. To address this challenge, we present a boosting technique in this paper, which can efficiently improve the approximation guarantee of the standard PGA to \\emph{optimal} with only small modifications on the objective function. The fundamental idea of our boosting technique is to exploit non-o","authors_text":"Jialin Zhang, Qixin Zhang, Xiaoming Sun, Yu Yang, Zaiyi Chen, Zengde Deng, Zongqi Wan","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08330","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:d9e0535e6f3c3a4ae9375cc9412ee01cac13b301b76ac5076a6db40aefad62e0","target":"record","created_at":"2026-07-05T08:47:49Z","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":"7fb2fa37551a2f543ae8a159dc0947348c1a0c326ae102df7ba18e6cc8cb8768","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-16T12:49:10Z","title_canon_sha256":"be03b51612454f36c3a883d069189badfbf818f54e590cf6f1d69ec778b8e201"},"schema_version":"1.0","source":{"id":"2401.08330","kind":"arxiv","version":2}},"canonical_sha256":"ab2fa121fec38150ae3172660a27c580d2f873b8294c4b8800dd851374e9f766","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab2fa121fec38150ae3172660a27c580d2f873b8294c4b8800dd851374e9f766","first_computed_at":"2026-07-05T08:47:49.316047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:47:49.316047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qzt8uP7vcggg5EVQ9fFoyKSnCOawIC/+P/8jaelqJfu2llJwlSJxsLRWJhClOat8jSfCuSkJGN2TlRvnQDgLAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:47:49.316494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.08330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9e0535e6f3c3a4ae9375cc9412ee01cac13b301b76ac5076a6db40aefad62e0","sha256:a6a2e8745d3d91b6ffc40c4924f4396fdf7838c1212300818f1713737b932334"],"state_sha256":"5212db32f988f55f0b431884e9e5cb1bc2df63f2fde7dcc1a9d27d6acf3fc303"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqoCRaeWUCYo0evlR3JfsGDz3FCCpKTmQYc1mjsXyfSTBcy7ciauD82TcdDiTdELkd9AYfULiKLcfY5327cADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:01:48.149698Z","bundle_sha256":"c0f162fa53f406b16dbe0a6b596043e1b8bdecb5393ff1220341f4eeb48c1a99"}}