{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WWHAFG2FX2ZUFBDZY74SC2UZH4","short_pith_number":"pith:WWHAFG2F","canonical_record":{"source":{"id":"1101.2940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0638ebf427acf7612c522f6c0c0938a2596320706d647de0d7a0e512acf47bc2","abstract_canon_sha256":"38cb4d2eadb1736f8471437864084d48ed048e855b365bfa865243a0d29a2ba3"},"schema_version":"1.0"},"canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","source":{"kind":"arxiv","id":"1101.2940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2940","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2940v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2940","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"WWHAFG2FX2ZU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WWHAFG2FX2ZUFBDZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WWHAFG2F","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WWHAFG2FX2ZUFBDZY74SC2UZH4","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0638ebf427acf7612c522f6c0c0938a2596320706d647de0d7a0e512acf47bc2","abstract_canon_sha256":"38cb4d2eadb1736f8471437864084d48ed048e855b365bfa865243a0d29a2ba3"},"schema_version":"1.0"},"canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:30.706610Z","signature_b64":"64ip39jrZA1UOLVl67QX9NGzfzFbRnJdhtVm6XL9GXzD8klreiwZHq9BYi3IPfammfiZX342O/AkyZyVCvKZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","last_reissued_at":"2026-05-18T04:31:30.706245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:30.706245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2940","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-18T04:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Resv+iv2vUMAEmdtVAbOjx20nCpJWdaDvkrTa96tzqKygfEKTsw9YJdqfIgDbJymKn81Tw+qrGijUm4YvGcdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:43:07.391747Z"},"content_sha256":"a778a05ad78ae37025a7214c66037477531cb1c6740a9a45226a7e18d93451db","schema_version":"1.0","event_id":"sha256:a778a05ad78ae37025a7214c66037477531cb1c6740a9a45226a7e18d93451db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WWHAFG2FX2ZUFBDZY74SC2UZH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Hadas Shachnai, Tami Tamir","submitted_at":"2011-01-15T04:21:35Z","abstract_excerpt":"Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks.\n  In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2940","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-18T04:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGjO/+aGOQNOuk9mYUKA3MgyUMUPqXzJqBDd4lysDVhvCmEbmdqpJ3btuBAjwtdo27UoO3pYKW3o7ei0k415Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:43:07.392092Z"},"content_sha256":"88ecc59dd2d6a42855fbbcdee1f220c848c1cfabb3e0d6e3176c86f80b206e76","schema_version":"1.0","event_id":"sha256:88ecc59dd2d6a42855fbbcdee1f220c848c1cfabb3e0d6e3176c86f80b206e76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/bundle.json","state_url":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/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-03T10:43:07Z","links":{"resolver":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4","bundle":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/bundle.json","state":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WWHAFG2FX2ZUFBDZY74SC2UZH4","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":"38cb4d2eadb1736f8471437864084d48ed048e855b365bfa865243a0d29a2ba3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","title_canon_sha256":"0638ebf427acf7612c522f6c0c0938a2596320706d647de0d7a0e512acf47bc2"},"schema_version":"1.0","source":{"id":"1101.2940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2940","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2940v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2940","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"WWHAFG2FX2ZU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WWHAFG2FX2ZUFBDZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WWHAFG2F","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:88ecc59dd2d6a42855fbbcdee1f220c848c1cfabb3e0d6e3176c86f80b206e76","target":"graph","created_at":"2026-05-18T04:31:30Z","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 maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks.\n  In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $","authors_text":"Ariel Kulik, Hadas Shachnai, Tami Tamir","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","title":"Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2940","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:a778a05ad78ae37025a7214c66037477531cb1c6740a9a45226a7e18d93451db","target":"record","created_at":"2026-05-18T04:31:30Z","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":"38cb4d2eadb1736f8471437864084d48ed048e855b365bfa865243a0d29a2ba3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","title_canon_sha256":"0638ebf427acf7612c522f6c0c0938a2596320706d647de0d7a0e512acf47bc2"},"schema_version":"1.0","source":{"id":"1101.2940","kind":"arxiv","version":1}},"canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","first_computed_at":"2026-05-18T04:31:30.706245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:30.706245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"64ip39jrZA1UOLVl67QX9NGzfzFbRnJdhtVm6XL9GXzD8klreiwZHq9BYi3IPfammfiZX342O/AkyZyVCvKZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:30.706610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a778a05ad78ae37025a7214c66037477531cb1c6740a9a45226a7e18d93451db","sha256:88ecc59dd2d6a42855fbbcdee1f220c848c1cfabb3e0d6e3176c86f80b206e76"],"state_sha256":"4786ef49847e2daa7c8ca4d28aa132b4c96837f2dd964b83619c1a2ed365d067"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LS0DcZOJ9TvGbCRiObWZ/EH7SvQvdY7zYjth4ZUDxrNciFYIJ1WgbsP5DUK6bY289Qikvq79ZAkP7egj8BqqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:43:07.394513Z","bundle_sha256":"26b0925ceb36822431fade3edd42923dc429d1f93cfb07280169500b336c8562"}}