{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RVKSPQO47H4LZHNORFKJTY4PXY","short_pith_number":"pith:RVKSPQO4","schema_version":"1.0","canonical_sha256":"8d5527c1dcf9f8bc9dae895499e38fbe1b85081ffc538315e91e896b4210d317","source":{"kind":"arxiv","id":"1801.07355","version":1},"attestation_state":"computed","paper":{"title":"The Importance of Communities for Learning to Influence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Eric Balkanski, Nicole Immorlica, Yaron Singer","submitted_at":"2018-01-23T00:14:09Z","abstract_excerpt":"We consider the canonical problem of influence maximization in social networks. Since the seminal work of Kempe, Kleinberg, and Tardos, there have been two largely disjoint efforts on this problem. The first studies the problem associated with learning the parameters of the generative influence model. The second focuses on the algorithmic challenge of identifying a set of influencers, assuming the parameters of the generative model are known. Recent results on learning and optimization imply that in general, if the generative model is not known but rather learned from training data, no algorit"},"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":"1801.07355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-23T00:14:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3407dfd3dd76045680a3664c70260b3b640801816ebc3c5fbf6d907fc2442661","abstract_canon_sha256":"df1a83bdb5b33f4f60da8d17a2984df58bafe0bd62543804a50d492a9442ddf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:13.044588Z","signature_b64":"qmwwdwcaGHf+O9MCMbZWBc5GilC9aBxdwZg3icztnotnE/fs0nujt75W+EazCu9ClMqosgPzZ/HhrGazMUcACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5527c1dcf9f8bc9dae895499e38fbe1b85081ffc538315e91e896b4210d317","last_reissued_at":"2026-05-18T00:25:13.044110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:13.044110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Importance of Communities for Learning to Influence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Eric Balkanski, Nicole Immorlica, Yaron Singer","submitted_at":"2018-01-23T00:14:09Z","abstract_excerpt":"We consider the canonical problem of influence maximization in social networks. Since the seminal work of Kempe, Kleinberg, and Tardos, there have been two largely disjoint efforts on this problem. The first studies the problem associated with learning the parameters of the generative influence model. The second focuses on the algorithmic challenge of identifying a set of influencers, assuming the parameters of the generative model are known. Recent results on learning and optimization imply that in general, if the generative model is not known but rather learned from training data, no algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07355","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":"1801.07355","created_at":"2026-05-18T00:25:13.044184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07355v1","created_at":"2026-05-18T00:25:13.044184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07355","created_at":"2026-05-18T00:25:13.044184+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVKSPQO47H4L","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVKSPQO47H4LZHNO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVKSPQO4","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09471","citing_title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","ref_index":278,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY","json":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY.json","graph_json":"https://pith.science/api/pith-number/RVKSPQO47H4LZHNORFKJTY4PXY/graph.json","events_json":"https://pith.science/api/pith-number/RVKSPQO47H4LZHNORFKJTY4PXY/events.json","paper":"https://pith.science/paper/RVKSPQO4"},"agent_actions":{"view_html":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY","download_json":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY.json","view_paper":"https://pith.science/paper/RVKSPQO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07355&json=true","fetch_graph":"https://pith.science/api/pith-number/RVKSPQO47H4LZHNORFKJTY4PXY/graph.json","fetch_events":"https://pith.science/api/pith-number/RVKSPQO47H4LZHNORFKJTY4PXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY/action/storage_attestation","attest_author":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY/action/author_attestation","sign_citation":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY/action/citation_signature","submit_replication":"https://pith.science/pith/RVKSPQO47H4LZHNORFKJTY4PXY/action/replication_record"}},"created_at":"2026-05-18T00:25:13.044184+00:00","updated_at":"2026-05-18T00:25:13.044184+00:00"}