{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3MHS4GDWJ6AUGXE7FY6WIZEPQA","short_pith_number":"pith:3MHS4GDW","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"},"canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","source":{"kind":"arxiv","id":"1907.04279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04279","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04279v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04279","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"3MHS4GDWJ6AU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3MHS4GDWJ6AUGXE7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3MHS4GDW","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3MHS4GDWJ6AUGXE7FY6WIZEPQA","target":"record","payload":{"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"},"canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","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"},"source_kind":"arxiv","source_id":"1907.04279","source_version":1,"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-17T23:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96PTofCTaDOkse9bCgG/EjfqnNKCe1Wf8Sd536BZ2X41i6Mti1+5UynFBZnS/50epcZL4qrPl1HH5StimE7cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:29:56.451298Z"},"content_sha256":"fdb66a9482f9889b60c1bd30ba34ef5e35f6c243347771e9d33bcf3cc223c653","schema_version":"1.0","event_id":"sha256:fdb66a9482f9889b60c1bd30ba34ef5e35f6c243347771e9d33bcf3cc223c653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3MHS4GDWJ6AUGXE7FY6WIZEPQA","target":"graph","payload":{"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"},"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-17T23:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdbFbrLCgCrolL15lkuQxZfveO3KFrGff+jX3blcU7CAk83+918R0B9XBOFXvszrClNQtanm0p6R7I//mZccCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:29:56.451911Z"},"content_sha256":"483453b2aaca83f59b37bff0c88cb3e994aa9d0ca501849b4fb7aeb91de2cb6b","schema_version":"1.0","event_id":"sha256:483453b2aaca83f59b37bff0c88cb3e994aa9d0ca501849b4fb7aeb91de2cb6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/bundle.json","state_url":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/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-28T05:29:56Z","links":{"resolver":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA","bundle":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/bundle.json","state":"https://pith.science/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MHS4GDWJ6AUGXE7FY6WIZEPQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3MHS4GDWJ6AUGXE7FY6WIZEPQA","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":"2282a9054faed4b4a193fb05c7d69eaae870a002e725e0c5da57b3fcc0b315e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T16:28:43Z","title_canon_sha256":"f69122ff8bf175d7b0697c4246aeedf0abb4db1d47b0d282a4f328461cb51cef"},"schema_version":"1.0","source":{"id":"1907.04279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04279","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04279v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04279","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"3MHS4GDWJ6AU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3MHS4GDWJ6AUGXE7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3MHS4GDW","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:483453b2aaca83f59b37bff0c88cb3e994aa9d0ca501849b4fb7aeb91de2cb6b","target":"graph","created_at":"2026-05-17T23:41:02Z","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 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","authors_text":"So Nakashima, Takanori Maehara, Yutaro Yamaguchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T16:28:43Z","title":"Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04279","kind":"arxiv","version":1},"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:fdb66a9482f9889b60c1bd30ba34ef5e35f6c243347771e9d33bcf3cc223c653","target":"record","created_at":"2026-05-17T23:41:02Z","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":"2282a9054faed4b4a193fb05c7d69eaae870a002e725e0c5da57b3fcc0b315e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T16:28:43Z","title_canon_sha256":"f69122ff8bf175d7b0697c4246aeedf0abb4db1d47b0d282a4f328461cb51cef"},"schema_version":"1.0","source":{"id":"1907.04279","kind":"arxiv","version":1}},"canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db0f2e18764f81435c9f2e3d64648f802232a81f23f37d3e80f145d6e6ea10ee","first_computed_at":"2026-05-17T23:41:02.800307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:02.800307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8MrJCdjFIeTPqMgSPhMVk0CVn1idOlaFB10YRwK0D2gaUuVJPTQsQKjL9wdQ/YH4YBFdt9Q+JMgeXZkZTdcDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:02.801014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdb66a9482f9889b60c1bd30ba34ef5e35f6c243347771e9d33bcf3cc223c653","sha256:483453b2aaca83f59b37bff0c88cb3e994aa9d0ca501849b4fb7aeb91de2cb6b"],"state_sha256":"00f34b1e80061c6565a165db02c4eda0960a1786202e0a785c52603057f143b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0K1M68E9QADWLcL/MUcjYAj0Dj6cXxSaD6jqhoFPopAr54GPzCkwd0YNXiKy4xirG+1ywBY5uhR7x07pPiMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:29:56.454804Z","bundle_sha256":"cfd0f5ebe48e54ad4b4353a7b080277b34aa592b3df81b5aa4b811f1ffeb6899"}}