{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DMJEE26P4COIW6MLMFODUDIEPU","short_pith_number":"pith:DMJEE26P","canonical_record":{"source":{"id":"1908.06242","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T04:50:57Z","cross_cats_sorted":[],"title_canon_sha256":"b76ab931ba3d5753a86bed3d78375ba03edb5ff77b88171f91a8e3a188d4147b","abstract_canon_sha256":"dfe3a63b022fab5762e2193b3f668b1b0645f476120494fa819da28f8857d73b"},"schema_version":"1.0"},"canonical_sha256":"1b12426bcfe09c8b798b615c3a0d047d33f8395a8febf1409ba8e77ab95f4d7f","source":{"kind":"arxiv","id":"1908.06242","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06242","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06242v6","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06242","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"DMJEE26P4COI","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"DMJEE26P4COIW6ML","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"DMJEE26P","created_at":"2026-07-05T00:32:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DMJEE26P4COIW6MLMFODUDIEPU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06242","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T04:50:57Z","cross_cats_sorted":[],"title_canon_sha256":"b76ab931ba3d5753a86bed3d78375ba03edb5ff77b88171f91a8e3a188d4147b","abstract_canon_sha256":"dfe3a63b022fab5762e2193b3f668b1b0645f476120494fa819da28f8857d73b"},"schema_version":"1.0"},"canonical_sha256":"1b12426bcfe09c8b798b615c3a0d047d33f8395a8febf1409ba8e77ab95f4d7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:39.014656Z","signature_b64":"66NEmjlGtjrrqbl3euJO7ce4OG+QrAeVq+gi8jF0ta0tjUwX0/VaVB13iEiuBDiHanf6C7OFS5AqLgJFOs+rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b12426bcfe09c8b798b615c3a0d047d33f8395a8febf1409ba8e77ab95f4d7f","last_reissued_at":"2026-07-05T00:32:39.014185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:39.014185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06242","source_version":6,"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-05T00:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3Xdei8VuD7eKCZy7lS/oglP88sRLHY1l6EGo6Dc6KvQgKEmRO8zNisHAMyefaOou7HAAfrcE+uLuLQ86DJtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:26:46.349650Z"},"content_sha256":"9017bfa01038e6e6d1e12276fdbe925e6b6e50ef2efd20c8ad7f338865b5ac87","schema_version":"1.0","event_id":"sha256:9017bfa01038e6e6d1e12276fdbe925e6b6e50ef2efd20c8ad7f338865b5ac87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DMJEE26P4COIW6MLMFODUDIEPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shinsaku Sakaue","submitted_at":"2019-08-17T04:50:57Z","abstract_excerpt":"Submodular maximization with a cardinality constraint can model various problems, and those problems are often very large in practice. For the case where objective functions are monotone, many fast approximation algorithms have been developed. The stochastic greedy algorithm (SG) is one such algorithm, which is widely used thanks to its simplicity, efficiency, and high empirical performance. However, its approximation guarantee has been proved only for monotone objective functions. When it comes to non-monotone objective functions, existing approximation algorithms are inefficient relative to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06242","kind":"arxiv","version":6},"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/1908.06242/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-05T00:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yfhj94fPjM/MqmlyoW20k5gf7vr02JlXUlhCD3CrbAyJuXpMktkfeQNZvoOKydi4PHVK6fB5C5dPg0rfTyoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:26:46.350140Z"},"content_sha256":"8dfe28f3e1f588cb0c5fc05b29774edd35b34989cde7a4fea7db7cd09e00c30e","schema_version":"1.0","event_id":"sha256:8dfe28f3e1f588cb0c5fc05b29774edd35b34989cde7a4fea7db7cd09e00c30e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMJEE26P4COIW6MLMFODUDIEPU/bundle.json","state_url":"https://pith.science/pith/DMJEE26P4COIW6MLMFODUDIEPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMJEE26P4COIW6MLMFODUDIEPU/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-16T05:26:46Z","links":{"resolver":"https://pith.science/pith/DMJEE26P4COIW6MLMFODUDIEPU","bundle":"https://pith.science/pith/DMJEE26P4COIW6MLMFODUDIEPU/bundle.json","state":"https://pith.science/pith/DMJEE26P4COIW6MLMFODUDIEPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMJEE26P4COIW6MLMFODUDIEPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DMJEE26P4COIW6MLMFODUDIEPU","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":"dfe3a63b022fab5762e2193b3f668b1b0645f476120494fa819da28f8857d73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T04:50:57Z","title_canon_sha256":"b76ab931ba3d5753a86bed3d78375ba03edb5ff77b88171f91a8e3a188d4147b"},"schema_version":"1.0","source":{"id":"1908.06242","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06242","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06242v6","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06242","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"DMJEE26P4COI","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"DMJEE26P4COIW6ML","created_at":"2026-07-05T00:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"DMJEE26P","created_at":"2026-07-05T00:32:39Z"}],"graph_snapshots":[{"event_id":"sha256:8dfe28f3e1f588cb0c5fc05b29774edd35b34989cde7a4fea7db7cd09e00c30e","target":"graph","created_at":"2026-07-05T00:32:39Z","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/1908.06242/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular maximization with a cardinality constraint can model various problems, and those problems are often very large in practice. For the case where objective functions are monotone, many fast approximation algorithms have been developed. The stochastic greedy algorithm (SG) is one such algorithm, which is widely used thanks to its simplicity, efficiency, and high empirical performance. However, its approximation guarantee has been proved only for monotone objective functions. When it comes to non-monotone objective functions, existing approximation algorithms are inefficient relative to ","authors_text":"Shinsaku Sakaue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06242","kind":"arxiv","version":6},"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:9017bfa01038e6e6d1e12276fdbe925e6b6e50ef2efd20c8ad7f338865b5ac87","target":"record","created_at":"2026-07-05T00:32:39Z","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":"dfe3a63b022fab5762e2193b3f668b1b0645f476120494fa819da28f8857d73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T04:50:57Z","title_canon_sha256":"b76ab931ba3d5753a86bed3d78375ba03edb5ff77b88171f91a8e3a188d4147b"},"schema_version":"1.0","source":{"id":"1908.06242","kind":"arxiv","version":6}},"canonical_sha256":"1b12426bcfe09c8b798b615c3a0d047d33f8395a8febf1409ba8e77ab95f4d7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b12426bcfe09c8b798b615c3a0d047d33f8395a8febf1409ba8e77ab95f4d7f","first_computed_at":"2026-07-05T00:32:39.014185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:39.014185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"66NEmjlGtjrrqbl3euJO7ce4OG+QrAeVq+gi8jF0ta0tjUwX0/VaVB13iEiuBDiHanf6C7OFS5AqLgJFOs+rBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:39.014656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06242","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9017bfa01038e6e6d1e12276fdbe925e6b6e50ef2efd20c8ad7f338865b5ac87","sha256:8dfe28f3e1f588cb0c5fc05b29774edd35b34989cde7a4fea7db7cd09e00c30e"],"state_sha256":"d0f636b9c5c737651ca3fb7f03ad95b79bef8915403bc21e0f0eb02e0665a69e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qykhKHzJR1B6L6E60letMQl3ntRamCyHjEtnWO4UxAow88BAF/9A4w12pf1buGiyt8azqegy5Jy/KDqoDesSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:26:46.354382Z","bundle_sha256":"9a7a33d38b3c073f00890a7af8f03ab5373415e87b634605d33c9b68e894be32"}}