{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3MHS4GDWJ6AUGXE7FY6WIZEPQA","short_pith_number":"pith:3MHS4GDW","schema_version":"1.0","canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","source":{"kind":"arxiv","id":"1907.04279","version":1},"attestation_state":"computed","paper":{"title":"Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"So Nakashima, Takanori Maehara, Yutaro Yamaguchi","submitted_at":"2019-07-09T16:28:43Z","abstract_excerpt":"We consider a problem of maximizing a monotone DR-submodular function under multiple order-consistent knapsack constraints on a distributive lattice. Since a distributive lattice is used to represent a dependency constraint, the problem can represent a dependency constrained version of a submodular maximization problem on a set. We propose a $1 - 1/e$ approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices: We choose a median complex as a continuous relaxation of a distributive lattice and define the multilinear e"},"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":"1907.04279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T16:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"f69122ff8bf175d7b0697c4246aeedf0abb4db1d47b0d282a4f328461cb51cef","abstract_canon_sha256":"2282a9054faed4b4a193fb05c7d69eaae870a002e725e0c5da57b3fcc0b315e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:02.801014Z","signature_b64":"V8MrJCdjFIeTPqMgSPhMVk0CVn1idOlaFB10YRwK0D2gaUuVJPTQsQKjL9wdQ/YH4YBFdt9Q+JMgeXZkZTdcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","last_reissued_at":"2026-05-17T23:41:02.800307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:02.800307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"So Nakashima, Takanori Maehara, Yutaro Yamaguchi","submitted_at":"2019-07-09T16:28:43Z","abstract_excerpt":"We consider a problem of maximizing a monotone DR-submodular function under multiple order-consistent knapsack constraints on a distributive lattice. Since a distributive lattice is used to represent a dependency constraint, the problem can represent a dependency constrained version of a submodular maximization problem on a set. We propose a $1 - 1/e$ approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices: We choose a median complex as a continuous relaxation of a distributive lattice and define the multilinear e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04279","kind":"arxiv","version":1},"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":"1907.04279","created_at":"2026-05-17T23:41:02.800421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04279v1","created_at":"2026-05-17T23:41:02.800421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04279","created_at":"2026-05-17T23:41:02.800421+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MHS4GDWJ6AU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MHS4GDWJ6AUGXE7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MHS4GDW","created_at":"2026-05-18T12:33:07.085635+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/3MHS4GDWJ6AUGXE7FY6WIZEPQA","json":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA.json","graph_json":"https://pith.science/api/pith-number/3MHS4GDWJ6AUGXE7FY6WIZEPQA/graph.json","events_json":"https://pith.science/api/pith-number/3MHS4GDWJ6AUGXE7FY6WIZEPQA/events.json","paper":"https://pith.science/paper/3MHS4GDW"},"agent_actions":{"view_html":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA","download_json":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA.json","view_paper":"https://pith.science/paper/3MHS4GDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04279&json=true","fetch_graph":"https://pith.science/api/pith-number/3MHS4GDWJ6AUGXE7FY6WIZEPQA/graph.json","fetch_events":"https://pith.science/api/pith-number/3MHS4GDWJ6AUGXE7FY6WIZEPQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/action/storage_attestation","attest_author":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/action/author_attestation","sign_citation":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/action/citation_signature","submit_replication":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/action/replication_record"}},"created_at":"2026-05-17T23:41:02.800421+00:00","updated_at":"2026-05-17T23:41:02.800421+00:00"}