{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WJFGA7GFM5TDPM2OQNSSPXLMJD","short_pith_number":"pith:WJFGA7GF","canonical_record":{"source":{"id":"2401.12478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-23T04:16:58Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"d1d8034198bbe69e6cbfec53bc2013876e3a9abee07847d477848c62e1277716","abstract_canon_sha256":"bf5d9289fe71204f0875a2fa0e87de3123394cbfa58d93c532623bf1d9c5a45e"},"schema_version":"1.0"},"canonical_sha256":"b24a607cc5676637b34e836527dd6c48d8f143e6ddaa4e1a6777420e231ba108","source":{"kind":"arxiv","id":"2401.12478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.12478","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2401.12478v2","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12478","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"WJFGA7GFM5TD","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"WJFGA7GFM5TDPM2O","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"WJFGA7GF","created_at":"2026-07-05T09:14:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WJFGA7GFM5TDPM2OQNSSPXLMJD","target":"record","payload":{"canonical_record":{"source":{"id":"2401.12478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-23T04:16:58Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"d1d8034198bbe69e6cbfec53bc2013876e3a9abee07847d477848c62e1277716","abstract_canon_sha256":"bf5d9289fe71204f0875a2fa0e87de3123394cbfa58d93c532623bf1d9c5a45e"},"schema_version":"1.0"},"canonical_sha256":"b24a607cc5676637b34e836527dd6c48d8f143e6ddaa4e1a6777420e231ba108","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:29.781782Z","signature_b64":"80MTv0oriE451LLy9orGsi9PvVke/Wrd5I3ft4J8D0bKXM98pxZBI1gZasXr4KGVZfzQVCxWPIWPgUHZeP/QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b24a607cc5676637b34e836527dd6c48d8f143e6ddaa4e1a6777420e231ba108","last_reissued_at":"2026-07-05T09:14:29.781350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:29.781350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.12478","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-05T09:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK3bTrBaD7YG9ceIKKEKa0CgpJbEesbLi/pMpMDyvhe89tpy+J3EW5TrCkFJAVK98hdMtUEe7nuNxAgdMvUaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T13:43:36.852047Z"},"content_sha256":"0285a78968028cc9a3fd7d28e8477244151144741806ffbb800ac1ca5ec8658b","schema_version":"1.0","event_id":"sha256:0285a78968028cc9a3fd7d28e8477244151144741806ffbb800ac1ca5ec8658b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WJFGA7GFM5TDPM2OQNSSPXLMJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mini-batch Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Gregory Schwartzman","submitted_at":"2024-01-23T04:16:58Z","abstract_excerpt":"We present the first mini-batch algorithm for maximizing a non-negative monotone decomposable submodular function, $F=\\sum_{i=1}^N f^i$, under a set of constraints. We consider two sampling approaches: uniform and weighted. We first show that mini-batch with weighted sampling improves over the state of the art sparsifier based approach both in theory and in practice.\n  Surprisingly, our experimental results show that uniform sampling is superior to weighted sampling. However, it is impossible to explain this using worst-case analysis. Our main contribution is using smoothed analysis to provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12478","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.12478/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-05T09:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORc0xl2dTW+FMnOEjJ+pupTJfye1kCNWjfYLTHTc1AUYmVNgAi+8Zu6/OCJm2U8TNeixOJ1Oia5xBe0drwILAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T13:43:36.852416Z"},"content_sha256":"4855f84c9db9df53060f6ba4cc5ef587fa3f0ced5541d99777d4dbb20beb830a","schema_version":"1.0","event_id":"sha256:4855f84c9db9df53060f6ba4cc5ef587fa3f0ced5541d99777d4dbb20beb830a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/bundle.json","state_url":"https://pith.science/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/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-07-17T13:43:36Z","links":{"resolver":"https://pith.science/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD","bundle":"https://pith.science/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/bundle.json","state":"https://pith.science/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJFGA7GFM5TDPM2OQNSSPXLMJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WJFGA7GFM5TDPM2OQNSSPXLMJD","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":"bf5d9289fe71204f0875a2fa0e87de3123394cbfa58d93c532623bf1d9c5a45e","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-23T04:16:58Z","title_canon_sha256":"d1d8034198bbe69e6cbfec53bc2013876e3a9abee07847d477848c62e1277716"},"schema_version":"1.0","source":{"id":"2401.12478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.12478","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2401.12478v2","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12478","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"WJFGA7GFM5TD","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"WJFGA7GFM5TDPM2O","created_at":"2026-07-05T09:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"WJFGA7GF","created_at":"2026-07-05T09:14:29Z"}],"graph_snapshots":[{"event_id":"sha256:4855f84c9db9df53060f6ba4cc5ef587fa3f0ced5541d99777d4dbb20beb830a","target":"graph","created_at":"2026-07-05T09:14:29Z","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.12478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the first mini-batch algorithm for maximizing a non-negative monotone decomposable submodular function, $F=\\sum_{i=1}^N f^i$, under a set of constraints. We consider two sampling approaches: uniform and weighted. We first show that mini-batch with weighted sampling improves over the state of the art sparsifier based approach both in theory and in practice.\n  Surprisingly, our experimental results show that uniform sampling is superior to weighted sampling. However, it is impossible to explain this using worst-case analysis. Our main contribution is using smoothed analysis to provide","authors_text":"Gregory Schwartzman","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-23T04:16:58Z","title":"Mini-batch Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12478","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:0285a78968028cc9a3fd7d28e8477244151144741806ffbb800ac1ca5ec8658b","target":"record","created_at":"2026-07-05T09:14:29Z","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":"bf5d9289fe71204f0875a2fa0e87de3123394cbfa58d93c532623bf1d9c5a45e","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-23T04:16:58Z","title_canon_sha256":"d1d8034198bbe69e6cbfec53bc2013876e3a9abee07847d477848c62e1277716"},"schema_version":"1.0","source":{"id":"2401.12478","kind":"arxiv","version":2}},"canonical_sha256":"b24a607cc5676637b34e836527dd6c48d8f143e6ddaa4e1a6777420e231ba108","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b24a607cc5676637b34e836527dd6c48d8f143e6ddaa4e1a6777420e231ba108","first_computed_at":"2026-07-05T09:14:29.781350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:14:29.781350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"80MTv0oriE451LLy9orGsi9PvVke/Wrd5I3ft4J8D0bKXM98pxZBI1gZasXr4KGVZfzQVCxWPIWPgUHZeP/QDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:14:29.781782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.12478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0285a78968028cc9a3fd7d28e8477244151144741806ffbb800ac1ca5ec8658b","sha256:4855f84c9db9df53060f6ba4cc5ef587fa3f0ced5541d99777d4dbb20beb830a"],"state_sha256":"666ec32766ff64b7b5d247de51055bff4c9d554830606fe16d64e54d17d67067"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJByF8FhCf+2VKjVeNmiJC1k6jIW2wBTRz/g6cFgW4GZZnvcDWtyzKQKlaOPbhcHWz4wtPet+YVdj0ATP/BqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T13:43:36.854831Z","bundle_sha256":"d4a9fdb4df65e568e911cfe6cca66e0e989aab9dc73410baff3af6538cc8488d"}}