{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2ENNL5NENZWLUC7DQMZSIDRZPW","short_pith_number":"pith:2ENNL5NE","schema_version":"1.0","canonical_sha256":"d11ad5f5a46e6cba0be38333240e397da94cdaf05c64d339b1087aeeee6315be","source":{"kind":"arxiv","id":"1702.08791","version":2},"attestation_state":"computed","paper":{"title":"Robust Budget Allocation via Continuous Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.SI","math.OC"],"primary_cat":"cs.LG","authors_text":"Matthew Staib, Stefanie Jegelka","submitted_at":"2017-02-28T14:07:42Z","abstract_excerpt":"The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem are rarely known exactly, and using wrong parameters can lead to undesirable outcomes. We hence revisit a continuous version of the Budget Allocation or Bipartite Influence Maximization problem introduced by Alon et al. (2012) from a robust optimization perspective, where an adversary may choose the least favorable parameters within a confidence set. The resu"},"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":"1702.08791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T14:07:42Z","cross_cats_sorted":["cs.AI","cs.DS","cs.SI","math.OC"],"title_canon_sha256":"e0d0048ace5214a87097af99edd0acc4550a30f2c1df86c183366c02d997b5d1","abstract_canon_sha256":"a7b679d4995fb5e56b28a312410181fed1d9750fa41a86e1c9d54d4a41f3a741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:29.572748Z","signature_b64":"viPBfY3b5i5KWmMPgpKfbnc+NZNG9zeMVJVGN5bJ6bcX2PTcRa83ELamieUJ1mCedYC6XKYqADFCuT9NDbeGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11ad5f5a46e6cba0be38333240e397da94cdaf05c64d339b1087aeeee6315be","last_reissued_at":"2026-05-18T00:42:29.572291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:29.572291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Budget Allocation via Continuous Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.SI","math.OC"],"primary_cat":"cs.LG","authors_text":"Matthew Staib, Stefanie Jegelka","submitted_at":"2017-02-28T14:07:42Z","abstract_excerpt":"The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem are rarely known exactly, and using wrong parameters can lead to undesirable outcomes. We hence revisit a continuous version of the Budget Allocation or Bipartite Influence Maximization problem introduced by Alon et al. (2012) from a robust optimization perspective, where an adversary may choose the least favorable parameters within a confidence set. The resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08791","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":"1702.08791","created_at":"2026-05-18T00:42:29.572369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08791v2","created_at":"2026-05-18T00:42:29.572369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08791","created_at":"2026-05-18T00:42:29.572369+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ENNL5NENZWL","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ENNL5NENZWLUC7D","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ENNL5NE","created_at":"2026-05-18T12:30:55.937587+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/2ENNL5NENZWLUC7DQMZSIDRZPW","json":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW.json","graph_json":"https://pith.science/api/pith-number/2ENNL5NENZWLUC7DQMZSIDRZPW/graph.json","events_json":"https://pith.science/api/pith-number/2ENNL5NENZWLUC7DQMZSIDRZPW/events.json","paper":"https://pith.science/paper/2ENNL5NE"},"agent_actions":{"view_html":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW","download_json":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW.json","view_paper":"https://pith.science/paper/2ENNL5NE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08791&json=true","fetch_graph":"https://pith.science/api/pith-number/2ENNL5NENZWLUC7DQMZSIDRZPW/graph.json","fetch_events":"https://pith.science/api/pith-number/2ENNL5NENZWLUC7DQMZSIDRZPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW/action/storage_attestation","attest_author":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW/action/author_attestation","sign_citation":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW/action/citation_signature","submit_replication":"https://pith.science/pith/2ENNL5NENZWLUC7DQMZSIDRZPW/action/replication_record"}},"created_at":"2026-05-18T00:42:29.572369+00:00","updated_at":"2026-05-18T00:42:29.572369+00:00"}