{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BM3K4UXFAUZTZOLNQSK22H7EMM","short_pith_number":"pith:BM3K4UXF","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"},"canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","source":{"kind":"arxiv","id":"1308.3541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3541","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3541v2","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3541","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"BM3K4UXFAUZT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BM3K4UXFAUZTZOLN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BM3K4UXF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BM3K4UXFAUZTZOLNQSK22H7EMM","target":"record","payload":{"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"},"canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","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"},"source_kind":"arxiv","source_id":"1308.3541","source_version":2,"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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNaRVLh2hrYBt/sS7v0+WtYkakPlq30sj9g/z2THBA4q2hwfC/6ELvBm7u0n8DSw95rEWxU5deCxqbW/f3sJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:35:34.362616Z"},"content_sha256":"448024e1c9bc288e54fc4b48fe8a354d6b500fc14715849bb6554b0b13fd7276","schema_version":"1.0","event_id":"sha256:448024e1c9bc288e54fc4b48fe8a354d6b500fc14715849bb6554b0b13fd7276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BM3K4UXFAUZTZOLNQSK22H7EMM","target":"graph","payload":{"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"},"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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NbrrzrsipvCDbijeSVS/JOunhUTDGbnaBrxPnwYPOfuX1XMtVcgtpXZohMEOif48WmlifqbFZymvr4thElRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:35:34.363287Z"},"content_sha256":"cdf9fe49905c597c51c332e9394dffb8bc2302deb82889a0b5bb2318d339fdad","schema_version":"1.0","event_id":"sha256:cdf9fe49905c597c51c332e9394dffb8bc2302deb82889a0b5bb2318d339fdad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/bundle.json","state_url":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/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-05-22T08:35:34Z","links":{"resolver":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM","bundle":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/bundle.json","state":"https://pith.science/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BM3K4UXFAUZTZOLNQSK22H7EMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BM3K4UXFAUZTZOLNQSK22H7EMM","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":"5a666a082921508c0668b70b918995e6348d6a2db6ecb5aa740fdfe85a2575dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2013-08-16T03:46:25Z","title_canon_sha256":"2e749d5ca0af8431f8a2189345c5bbf0ea8511c7195543c0bc24973e43748fd2"},"schema_version":"1.0","source":{"id":"1308.3541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3541","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3541v2","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3541","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"BM3K4UXFAUZT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BM3K4UXFAUZTZOLN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BM3K4UXF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:cdf9fe49905c597c51c332e9394dffb8bc2302deb82889a0b5bb2318d339fdad","target":"graph","created_at":"2026-05-18T02:56:19Z","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 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.","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Jiaji Zhou, Stephane Ross, Yisong Yue","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2013-08-16T03:46:25Z","title":"Knapsack Constrained Contextual Submodular List Prediction with Application to Multi-document Summarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3541","kind":"arxiv","version":2},"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:448024e1c9bc288e54fc4b48fe8a354d6b500fc14715849bb6554b0b13fd7276","target":"record","created_at":"2026-05-18T02:56:19Z","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":"5a666a082921508c0668b70b918995e6348d6a2db6ecb5aa740fdfe85a2575dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2013-08-16T03:46:25Z","title_canon_sha256":"2e749d5ca0af8431f8a2189345c5bbf0ea8511c7195543c0bc24973e43748fd2"},"schema_version":"1.0","source":{"id":"1308.3541","kind":"arxiv","version":2}},"canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b36ae52e505333cb96d8495ad1fe4632eefd6ff94342f6d3fbdd93421fbf531","first_computed_at":"2026-05-18T02:56:19.100574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:19.100574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"87oo99wl3lxbTVdx1NinPhDxp0fTRog9D/pqsxqOYn6T4/jlNC2RNOLXWFE0pvf0w45bBxZAA4N1sBPFZFZ/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:19.101025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448024e1c9bc288e54fc4b48fe8a354d6b500fc14715849bb6554b0b13fd7276","sha256:cdf9fe49905c597c51c332e9394dffb8bc2302deb82889a0b5bb2318d339fdad"],"state_sha256":"b8425d73c3a0ce0b62d626165a930f3cd97a6956a7a3384cf1a373f1f5fffca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HSIL5OtTvabZp7xixU1eKlTa3bIWMVLWxlKmj8WFhdusq2/8WIO/cG3etTJ7XDt9AXCl3tQjgcIHx5u2zDHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:35:34.370808Z","bundle_sha256":"759a96bab371d72c6522a699e7121c6d9522aeebde9afc0fb70707e1b40d4c1f"}}