{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FH4OTOLDLYTCPOIOPKGRFJ2TAT","short_pith_number":"pith:FH4OTOLD","schema_version":"1.0","canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","source":{"kind":"arxiv","id":"1805.06990","version":1},"attestation_state":"computed","paper":{"title":"Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Kuhnle, J. David Smith, My T. Thai, Victoria G. Crawford","submitted_at":"2018-05-17T23:19:29Z","abstract_excerpt":"The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context."},"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":"1805.06990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T23:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"9e0811c4ec00cd78892965ddb7ff9b1b505fbf6f1e7d25ed5bc94d281f008aea","abstract_canon_sha256":"9b5a75be1a5633d2b8289c74b64bd6a4b2cddd435af4ddb4794eb33ead2c3d8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.432017Z","signature_b64":"Qhgby0OVZCrOwPXnh8AsFA/zc9PSDva06TqRwHiJ+JJkP7qkokiYSX3lEKXJrc0CSonGk/+z2ktzd6bWrn9vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","last_reissued_at":"2026-05-18T00:15:41.431288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.431288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Kuhnle, J. David Smith, My T. Thai, Victoria G. Crawford","submitted_at":"2018-05-17T23:19:29Z","abstract_excerpt":"The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06990","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":"1805.06990","created_at":"2026-05-18T00:15:41.431422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06990v1","created_at":"2026-05-18T00:15:41.431422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06990","created_at":"2026-05-18T00:15:41.431422+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH4OTOLDLYTC","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH4OTOLDLYTCPOIO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH4OTOLD","created_at":"2026-05-18T12:32:22.470017+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/FH4OTOLDLYTCPOIOPKGRFJ2TAT","json":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT.json","graph_json":"https://pith.science/api/pith-number/FH4OTOLDLYTCPOIOPKGRFJ2TAT/graph.json","events_json":"https://pith.science/api/pith-number/FH4OTOLDLYTCPOIOPKGRFJ2TAT/events.json","paper":"https://pith.science/paper/FH4OTOLD"},"agent_actions":{"view_html":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT","download_json":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT.json","view_paper":"https://pith.science/paper/FH4OTOLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06990&json=true","fetch_graph":"https://pith.science/api/pith-number/FH4OTOLDLYTCPOIOPKGRFJ2TAT/graph.json","fetch_events":"https://pith.science/api/pith-number/FH4OTOLDLYTCPOIOPKGRFJ2TAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/action/storage_attestation","attest_author":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/action/author_attestation","sign_citation":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/action/citation_signature","submit_replication":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/action/replication_record"}},"created_at":"2026-05-18T00:15:41.431422+00:00","updated_at":"2026-05-18T00:15:41.431422+00:00"}