{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ","short_pith_number":"pith:VUHBH2VM","canonical_record":{"source":{"id":"1709.09767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76","abstract_canon_sha256":"978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec"},"schema_version":"1.0"},"canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","source":{"kind":"arxiv","id":"1709.09767","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09767","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09767v3","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09767","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"VUHBH2VM2IPM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VUHBH2VM2IPMM6FI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VUHBH2VM","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76","abstract_canon_sha256":"978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec"},"schema_version":"1.0"},"canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.935772Z","signature_b64":"0CPfKN+422BgDWYB+ewhRSWsm4+uBhUJuWKlIVlC5J1EWghtnT4E5U7QkLH0DUQ44EzedYgy4v647QlSHlZsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","last_reissued_at":"2026-05-18T00:00:30.935226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.935226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09767","source_version":3,"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-18T00:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnU5gqfZYzu/lBN/TIlq0r9Ns7z98MdjCtugnS/06grLJXUIAHvtj8d+wnOey6ESgd8WF84Chm8nR5PrUro/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:07.826849Z"},"content_sha256":"776f35bb5d687cc7e29d18ee8e225929c142e9c52006474f4c278202464c4c01","schema_version":"1.0","event_id":"sha256:776f35bb5d687cc7e29d18ee8e225929c142e9c52006474f4c278202464c4c01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2017-09-28T00:26:16Z","abstract_excerpt":"We consider the problem of maximizing a monotone submodular function subject to a knapsack constraint. Our main contribution is an algorithm that achieves a nearly-optimal, $1 - 1/e - \\epsilon$ approximation, using $(1/\\epsilon)^{O(1/\\epsilon^4)} n \\log^2{n}$ function evaluations and arithmetic operations. Our algorithm is impractical but theoretically interesting, since it overcomes a fundamental running time bottleneck of the multilinear extension relaxation framework. This is the main approach for obtaining nearly-optimal approximation guarantees for important classes of constraints but it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09767","kind":"arxiv","version":3},"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-18T00:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTCh1vxlH6KbDZWeWZITkxBxABCDbl0gtk//ftlz8naXt7crZB6WezdeflIJEAtAmrJiTKNlKMR24SKw0pm3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:07.827272Z"},"content_sha256":"63bc55e2fa5b3ef783ba2a3fa07e7bedc0cb198377109ce460bbe107d2dc1df7","schema_version":"1.0","event_id":"sha256:63bc55e2fa5b3ef783ba2a3fa07e7bedc0cb198377109ce460bbe107d2dc1df7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/bundle.json","state_url":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/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-12T09:31:07Z","links":{"resolver":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ","bundle":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/bundle.json","state":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ","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":"978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","title_canon_sha256":"fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76"},"schema_version":"1.0","source":{"id":"1709.09767","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09767","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09767v3","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09767","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"VUHBH2VM2IPM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VUHBH2VM2IPMM6FI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VUHBH2VM","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:63bc55e2fa5b3ef783ba2a3fa07e7bedc0cb198377109ce460bbe107d2dc1df7","target":"graph","created_at":"2026-05-18T00:00: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":"We consider the problem of maximizing a monotone submodular function subject to a knapsack constraint. Our main contribution is an algorithm that achieves a nearly-optimal, $1 - 1/e - \\epsilon$ approximation, using $(1/\\epsilon)^{O(1/\\epsilon^4)} n \\log^2{n}$ function evaluations and arithmetic operations. Our algorithm is impractical but theoretically interesting, since it overcomes a fundamental running time bottleneck of the multilinear extension relaxation framework. This is the main approach for obtaining nearly-optimal approximation guarantees for important classes of constraints but it ","authors_text":"Alina Ene, Huy L. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","title":"A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09767","kind":"arxiv","version":3},"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:776f35bb5d687cc7e29d18ee8e225929c142e9c52006474f4c278202464c4c01","target":"record","created_at":"2026-05-18T00:00: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":"978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","title_canon_sha256":"fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76"},"schema_version":"1.0","source":{"id":"1709.09767","kind":"arxiv","version":3}},"canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","first_computed_at":"2026-05-18T00:00:30.935226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:30.935226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0CPfKN+422BgDWYB+ewhRSWsm4+uBhUJuWKlIVlC5J1EWghtnT4E5U7QkLH0DUQ44EzedYgy4v647QlSHlZsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:30.935772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09767","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:776f35bb5d687cc7e29d18ee8e225929c142e9c52006474f4c278202464c4c01","sha256:63bc55e2fa5b3ef783ba2a3fa07e7bedc0cb198377109ce460bbe107d2dc1df7"],"state_sha256":"da10387f584dc0b3cc28fde51cab54271e8cff460d9687262a3ee9abdb0e527b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gb5KvhbYBJv3YEKkr1dUMaXz1LVebmtMstfP2J6D/UnRbnyPsKvpLGbfzn4KO6ZBbrgFES7FZA5gipuT3sqCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:31:07.829653Z","bundle_sha256":"f343f09ab53d08d512db7e3582a71aed13fe8c0758b2552992e1b918b4dbb559"}}