{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FH4OTOLDLYTCPOIOPKGRFJ2TAT","short_pith_number":"pith:FH4OTOLD","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"},"canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","source":{"kind":"arxiv","id":"1805.06990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06990","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06990v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06990","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"FH4OTOLDLYTC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FH4OTOLDLYTCPOIO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FH4OTOLD","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FH4OTOLDLYTCPOIOPKGRFJ2TAT","target":"record","payload":{"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"},"canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","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"},"source_kind":"arxiv","source_id":"1805.06990","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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Razn83THdiYkZgMTr4rvte56J3B7lgdI2mUOThoqNi01/OsSoXe3tbePoCF68V/BwCjZjsB3wubWbYIwl1XAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:35:04.166814Z"},"content_sha256":"8a24f8d37cff6f1fa58b3c43a1bce03c2e598fc2a9c23736d3da713d3e38ee74","schema_version":"1.0","event_id":"sha256:8a24f8d37cff6f1fa58b3c43a1bce03c2e598fc2a9c23736d3da713d3e38ee74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FH4OTOLDLYTCPOIOPKGRFJ2TAT","target":"graph","payload":{"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"},"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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0tMhM+jc+hB1FgDLUfXkQrBS7ohuKRJF43/9V2ZtB8YosqN7DbeVpE3DF0ZO80JZgcs8D79fLAP78dRrS2sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:35:04.167157Z"},"content_sha256":"0353ee66d3a467fcaa8b569473ba610099d5b7955a7ce6b6d0271f5b2380a6e6","schema_version":"1.0","event_id":"sha256:0353ee66d3a467fcaa8b569473ba610099d5b7955a7ce6b6d0271f5b2380a6e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/bundle.json","state_url":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/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-29T20:35:04Z","links":{"resolver":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT","bundle":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/bundle.json","state":"https://pith.science/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FH4OTOLDLYTCPOIOPKGRFJ2TAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FH4OTOLDLYTCPOIOPKGRFJ2TAT","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":"9b5a75be1a5633d2b8289c74b64bd6a4b2cddd435af4ddb4794eb33ead2c3d8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T23:19:29Z","title_canon_sha256":"9e0811c4ec00cd78892965ddb7ff9b1b505fbf6f1e7d25ed5bc94d281f008aea"},"schema_version":"1.0","source":{"id":"1805.06990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06990","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06990v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06990","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"FH4OTOLDLYTC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FH4OTOLDLYTCPOIO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FH4OTOLD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0353ee66d3a467fcaa8b569473ba610099d5b7955a7ce6b6d0271f5b2380a6e6","target":"graph","created_at":"2026-05-18T00:15:41Z","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":"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.","authors_text":"Alan Kuhnle, J. David Smith, My T. Thai, Victoria G. Crawford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T23:19:29Z","title":"Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06990","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:8a24f8d37cff6f1fa58b3c43a1bce03c2e598fc2a9c23736d3da713d3e38ee74","target":"record","created_at":"2026-05-18T00:15:41Z","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":"9b5a75be1a5633d2b8289c74b64bd6a4b2cddd435af4ddb4794eb33ead2c3d8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T23:19:29Z","title_canon_sha256":"9e0811c4ec00cd78892965ddb7ff9b1b505fbf6f1e7d25ed5bc94d281f008aea"},"schema_version":"1.0","source":{"id":"1805.06990","kind":"arxiv","version":1}},"canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29f8e9b9635e2627b90e7a8d12a75304c087a8556246cf8acfcd4f69fb3a9dc0","first_computed_at":"2026-05-18T00:15:41.431288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.431288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qhgby0OVZCrOwPXnh8AsFA/zc9PSDva06TqRwHiJ+JJkP7qkokiYSX3lEKXJrc0CSonGk/+z2ktzd6bWrn9vDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.432017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a24f8d37cff6f1fa58b3c43a1bce03c2e598fc2a9c23736d3da713d3e38ee74","sha256:0353ee66d3a467fcaa8b569473ba610099d5b7955a7ce6b6d0271f5b2380a6e6"],"state_sha256":"976ba96bedae226fa5680b68c1d5039a0a6f4fc6e6e6360b2d9c7996de64925c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QmMUQo3L4q6aljRiw8mVpfOFSiAEWvr9XbJ9+Y/eW/uBCs2u7YRau2CYtk9EHKXYDYCZxoBTnD9ri8hvdBJ5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:35:04.169182Z","bundle_sha256":"5a29eabce6024c18dfb844ab5ec761f7abf23b6740266f151d777273e6a49324"}}