{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DQ3J52ECEJO7MVB56K4TCSMFP7","short_pith_number":"pith:DQ3J52EC","schema_version":"1.0","canonical_sha256":"1c369ee882225df6543df2b93149857fdd1f8e9d752f0b33c703dcc1bd50b99c","source":{"kind":"arxiv","id":"1007.3604","version":2},"attestation_state":"computed","paper":{"title":"Efficient Submodular Function Maximization under Linear Packing Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Iftah Gamzu, Yossi Azar","submitted_at":"2010-07-21T10:23:47Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \\in [0,1]^{m \\times n}$, a vector $b \\in [1,\\infty)^m$, and a monotone submodular set function $f: 2^{[n]} \\rightarrow \\bbR_+$. The objective is to find a set $S$ that maximizes $f(S)$ subject to $A x_{S} \\leq b$, where $x_S$ stands for the characteristic vector of the set $S$. A well-studied special case of this problem is when $f$ is linear. This special case captures the class of packing integer programs.\n  Our main contribution is "},"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":"1007.3604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-21T10:23:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ed452fb0eca5205237cacddecf5ec6f0cf69f43540e33d5e6a48d70183b684a9","abstract_canon_sha256":"6d74805e064301fa0d0b5ccd571abb6b4f4f838d75122cf95a3c34cf9cdfbb4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:45.268195Z","signature_b64":"CIgHDgIvXYJh0Vp2qLZ7H1LlAyo7y+I5muB1lb91hP2G18miKfSK6GvFR35OGh6onj7dmGz6L5QjZgVTzgl2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c369ee882225df6543df2b93149857fdd1f8e9d752f0b33c703dcc1bd50b99c","last_reissued_at":"2026-05-18T03:56:45.267555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:45.267555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Submodular Function Maximization under Linear Packing Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Iftah Gamzu, Yossi Azar","submitted_at":"2010-07-21T10:23:47Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \\in [0,1]^{m \\times n}$, a vector $b \\in [1,\\infty)^m$, and a monotone submodular set function $f: 2^{[n]} \\rightarrow \\bbR_+$. The objective is to find a set $S$ that maximizes $f(S)$ subject to $A x_{S} \\leq b$, where $x_S$ stands for the characteristic vector of the set $S$. A well-studied special case of this problem is when $f$ is linear. This special case captures the class of packing integer programs.\n  Our main contribution is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3604","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":"1007.3604","created_at":"2026-05-18T03:56:45.267648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3604v2","created_at":"2026-05-18T03:56:45.267648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3604","created_at":"2026-05-18T03:56:45.267648+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ3J52ECEJO7","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ3J52ECEJO7MVB5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ3J52EC","created_at":"2026-05-18T12:26:06.534383+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/DQ3J52ECEJO7MVB56K4TCSMFP7","json":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7.json","graph_json":"https://pith.science/api/pith-number/DQ3J52ECEJO7MVB56K4TCSMFP7/graph.json","events_json":"https://pith.science/api/pith-number/DQ3J52ECEJO7MVB56K4TCSMFP7/events.json","paper":"https://pith.science/paper/DQ3J52EC"},"agent_actions":{"view_html":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7","download_json":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7.json","view_paper":"https://pith.science/paper/DQ3J52EC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3604&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ3J52ECEJO7MVB56K4TCSMFP7/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ3J52ECEJO7MVB56K4TCSMFP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7/action/storage_attestation","attest_author":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7/action/author_attestation","sign_citation":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7/action/citation_signature","submit_replication":"https://pith.science/pith/DQ3J52ECEJO7MVB56K4TCSMFP7/action/replication_record"}},"created_at":"2026-05-18T03:56:45.267648+00:00","updated_at":"2026-05-18T03:56:45.267648+00:00"}