{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BM3K4UXFAUZTZOLNQSK22H7EMM","short_pith_number":"pith:BM3K4UXF","schema_version":"1.0","canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","source":{"kind":"arxiv","id":"1308.3541","version":2},"attestation_state":"computed","paper":{"title":"Knapsack Constrained Contextual Submodular List Prediction with Application to Multi-document Summarization","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Jiaji Zhou, Stephane Ross, Yisong Yue","submitted_at":"2013-08-16T03:46:25Z","abstract_excerpt":"We study the problem of predicting a set or list of options under knapsack constraint. The quality of such lists are evaluated by a submodular reward function that measures both quality and diversity. Similar to DAgger (Ross et al., 2010), by a reduction to online learning, we show how to adapt two sequence prediction models to imitate greedy maximization under knapsack constraint problems: CONSEQOPT (Dey et al., 2012) and SCP (Ross et al., 2013). Experiments on extractive multi-document summarization show that our approach outperforms existing state-of-the-art methods."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.3541","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2013-08-16T03:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"2e749d5ca0af8431f8a2189345c5bbf0ea8511c7195543c0bc24973e43748fd2","abstract_canon_sha256":"5a666a082921508c0668b70b918995e6348d6a2db6ecb5aa740fdfe85a2575dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:19.101025Z","signature_b64":"87oo99wl3lxbTVdx1NinPhDxp0fTRog9D/pqsxqOYn6T4/jlNC2RNOLXWFE0pvf0w45bBxZAA4N1sBPFZFZ/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","last_reissued_at":"2026-05-18T02:56:19.100574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:19.100574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knapsack Constrained Contextual Submodular List Prediction with Application to Multi-document Summarization","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Jiaji Zhou, Stephane Ross, Yisong Yue","submitted_at":"2013-08-16T03:46:25Z","abstract_excerpt":"We study the problem of predicting a set or list of options under knapsack constraint. The quality of such lists are evaluated by a submodular reward function that measures both quality and diversity. Similar to DAgger (Ross et al., 2010), by a reduction to online learning, we show how to adapt two sequence prediction models to imitate greedy maximization under knapsack constraint problems: CONSEQOPT (Dey et al., 2012) and SCP (Ross et al., 2013). Experiments on extractive multi-document summarization show that our approach outperforms existing state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3541","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3541","created_at":"2026-05-18T02:56:19.100647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3541v2","created_at":"2026-05-18T02:56:19.100647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3541","created_at":"2026-05-18T02:56:19.100647+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM3K4UXFAUZT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM3K4UXFAUZTZOLN","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM3K4UXF","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM","json":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM.json","graph_json":"https://pith.science/api/pith-number/BM3K4UXFAUZTZOLNQSK22H7EMM/graph.json","events_json":"https://pith.science/api/pith-number/BM3K4UXFAUZTZOLNQSK22H7EMM/events.json","paper":"https://pith.science/paper/BM3K4UXF"},"agent_actions":{"view_html":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM","download_json":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM.json","view_paper":"https://pith.science/paper/BM3K4UXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3541&json=true","fetch_graph":"https://pith.science/api/pith-number/BM3K4UXFAUZTZOLNQSK22H7EMM/graph.json","fetch_events":"https://pith.science/api/pith-number/BM3K4UXFAUZTZOLNQSK22H7EMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/action/storage_attestation","attest_author":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/action/author_attestation","sign_citation":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/action/citation_signature","submit_replication":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/action/replication_record"}},"created_at":"2026-05-18T02:56:19.100647+00:00","updated_at":"2026-05-18T02:56:19.100647+00:00"}