{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4H2BIIQPM5YA2VTXH4NEFW6DRH","short_pith_number":"pith:4H2BIIQP","canonical_record":{"source":{"id":"1603.05614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:01:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab9e689c5de219c8eefe70c49ac2dbaecc91033709242119ba7fc3c94efd5fc2","abstract_canon_sha256":"634f70ec5dff4202a20496902c97761b7a7646de2870a147b285386957b794ab"},"schema_version":"1.0"},"canonical_sha256":"e1f414220f67700d56773f1a42dbc389edf1f5ba214fe99c98e4d8973fae54f7","source":{"kind":"arxiv","id":"1603.05614","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05614","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05614v3","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05614","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"4H2BIIQPM5YA","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4H2BIIQPM5YA2VTX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4H2BIIQP","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4H2BIIQPM5YA2VTXH4NEFW6DRH","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:01:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab9e689c5de219c8eefe70c49ac2dbaecc91033709242119ba7fc3c94efd5fc2","abstract_canon_sha256":"634f70ec5dff4202a20496902c97761b7a7646de2870a147b285386957b794ab"},"schema_version":"1.0"},"canonical_sha256":"e1f414220f67700d56773f1a42dbc389edf1f5ba214fe99c98e4d8973fae54f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:31.351034Z","signature_b64":"2HNVPA2a400GlDOEVPvCXnHJRPsdKnyJTB3TDjKFkStmyMqDxa2pbWeHmpNelEk3fbr7uMQnkjVCz2177APlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f414220f67700d56773f1a42dbc389edf1f5ba214fe99c98e4d8973fae54f7","last_reissued_at":"2026-05-18T01:11:31.350579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:31.350579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05614","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-18T01:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ0qlaKieSFOwLOhEkzr6Z/eyZpteFSymbZJ+wZHXWBdJVdsRpteucZhxO3StztKSs+RWkcIgBMJsIy9+Or+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:23:08.480699Z"},"content_sha256":"5851cb65dacfdc8c3703dd903590f81788d5f7becd5259980e5a7d2b32ee39ad","schema_version":"1.0","event_id":"sha256:5851cb65dacfdc8c3703dd903590f81788d5f7becd5259980e5a7d2b32ee39ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4H2BIIQPM5YA2VTXH4NEFW6DRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Easton Li Xu, Qilian Yu, Shuguang Cui","submitted_at":"2016-03-17T19:01:12Z","abstract_excerpt":"Submodular maximization problems belong to the family of combinatorial optimization problems and enjoy wide applications. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a $d$-knapsack constraint, for which we propose a streaming algorithm that achieves a $\\left(\\frac{1}{1+2d}-\\epsilon\\right)$-approximation of the optimal value, while it only needs one single pass through the dataset without storing all the data in the memory. In our experiments, we extensively evaluate the effectiveness of our proposed algorithm via two applications: news recomme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05614","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-18T01:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTLNa4ylTwewY6PoWHLcJCpK+wN6s0Uoj6xVG/M4S86lB2k4LV4xlnobQBXpofI338C3+7BTvCKaxQH7gRlPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:23:08.481037Z"},"content_sha256":"8b6131911ec22ec9698c05ed4df6899d5a93441dfb475847dd5fd2a8904df560","schema_version":"1.0","event_id":"sha256:8b6131911ec22ec9698c05ed4df6899d5a93441dfb475847dd5fd2a8904df560"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/bundle.json","state_url":"https://pith.science/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/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-23T20:23:08Z","links":{"resolver":"https://pith.science/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH","bundle":"https://pith.science/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/bundle.json","state":"https://pith.science/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H2BIIQPM5YA2VTXH4NEFW6DRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4H2BIIQPM5YA2VTXH4NEFW6DRH","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":"634f70ec5dff4202a20496902c97761b7a7646de2870a147b285386957b794ab","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:01:12Z","title_canon_sha256":"ab9e689c5de219c8eefe70c49ac2dbaecc91033709242119ba7fc3c94efd5fc2"},"schema_version":"1.0","source":{"id":"1603.05614","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05614","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05614v3","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05614","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"4H2BIIQPM5YA","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4H2BIIQPM5YA2VTX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4H2BIIQP","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:8b6131911ec22ec9698c05ed4df6899d5a93441dfb475847dd5fd2a8904df560","target":"graph","created_at":"2026-05-18T01:11:31Z","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 problems belong to the family of combinatorial optimization problems and enjoy wide applications. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a $d$-knapsack constraint, for which we propose a streaming algorithm that achieves a $\\left(\\frac{1}{1+2d}-\\epsilon\\right)$-approximation of the optimal value, while it only needs one single pass through the dataset without storing all the data in the memory. In our experiments, we extensively evaluate the effectiveness of our proposed algorithm via two applications: news recomme","authors_text":"Easton Li Xu, Qilian Yu, Shuguang Cui","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:01:12Z","title":"Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05614","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:5851cb65dacfdc8c3703dd903590f81788d5f7becd5259980e5a7d2b32ee39ad","target":"record","created_at":"2026-05-18T01:11:31Z","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":"634f70ec5dff4202a20496902c97761b7a7646de2870a147b285386957b794ab","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:01:12Z","title_canon_sha256":"ab9e689c5de219c8eefe70c49ac2dbaecc91033709242119ba7fc3c94efd5fc2"},"schema_version":"1.0","source":{"id":"1603.05614","kind":"arxiv","version":3}},"canonical_sha256":"e1f414220f67700d56773f1a42dbc389edf1f5ba214fe99c98e4d8973fae54f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f414220f67700d56773f1a42dbc389edf1f5ba214fe99c98e4d8973fae54f7","first_computed_at":"2026-05-18T01:11:31.350579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:31.350579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2HNVPA2a400GlDOEVPvCXnHJRPsdKnyJTB3TDjKFkStmyMqDxa2pbWeHmpNelEk3fbr7uMQnkjVCz2177APlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:31.351034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05614","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5851cb65dacfdc8c3703dd903590f81788d5f7becd5259980e5a7d2b32ee39ad","sha256:8b6131911ec22ec9698c05ed4df6899d5a93441dfb475847dd5fd2a8904df560"],"state_sha256":"6272ee8532fdcb6c41d2fbe2f004c104dc3cb93f8ec07e9bc951029893307e6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2WzsZ4YkugG+vy9cXFl0GtxdyDAs4EN8ZgZFMny4JacfLp/MXshBC9KLSNZ7pG6Rok81wQwkvJFVPqcklHPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:23:08.482887Z","bundle_sha256":"e85136da3c928ab422ca5eab2c966919c456b5cfaee800b68b7af4b008016c3a"}}