{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZL2MOL5MSQE3EYK5LOWPFOKIQY","short_pith_number":"pith:ZL2MOL5M","schema_version":"1.0","canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","source":{"kind":"arxiv","id":"1906.07378","version":1},"attestation_state":"computed","paper":{"title":"DISCO: Influence Maximization Meets Network Embedding and Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Changsheng Sun, Hui Li, Jiangtao Cui, Mengting Xu, Sourav S Bhowmick, Zhongyuan Jiang","submitted_at":"2019-06-18T04:54:26Z","abstract_excerpt":"Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM is to select a set of k users who can influence the most individuals in the social network. The problem is proven to be NP-hard. A large number of approximate algorithms have been proposed to address this problem. The state-of-the-art algorithms estimate the expected influence of nodes based on sampled diffusion paths. As the number of required samples have been recently proven to be lower bounded by a particular threshold that presets tradeoff betwe"},"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":"1906.07378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-06-18T04:54:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4aed89ed95e81396a6b8cce0b09528b7b0769711852104e6171316cabb1d7587","abstract_canon_sha256":"8a255217ad48a56c3bd882090f4efb83e7ae67b63663274df9a999a54c4b93df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.037032Z","signature_b64":"6gSlkuWiIhE/vyCXMHq+NoJJGwMh4FmlArYjnLkPAaph3fLm4c52KrKGFdg/GcEXD7x0qOGhKXd6PYeQOZhvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","last_reissued_at":"2026-05-17T23:43:08.036390Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.036390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DISCO: Influence Maximization Meets Network Embedding and Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Changsheng Sun, Hui Li, Jiangtao Cui, Mengting Xu, Sourav S Bhowmick, Zhongyuan Jiang","submitted_at":"2019-06-18T04:54:26Z","abstract_excerpt":"Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM is to select a set of k users who can influence the most individuals in the social network. The problem is proven to be NP-hard. A large number of approximate algorithms have been proposed to address this problem. The state-of-the-art algorithms estimate the expected influence of nodes based on sampled diffusion paths. As the number of required samples have been recently proven to be lower bounded by a particular threshold that presets tradeoff betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07378","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":"1906.07378","created_at":"2026-05-17T23:43:08.036498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07378v1","created_at":"2026-05-17T23:43:08.036498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07378","created_at":"2026-05-17T23:43:08.036498+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZL2MOL5MSQE3","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZL2MOL5MSQE3EYK5","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZL2MOL5M","created_at":"2026-05-18T12:33:33.725879+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/ZL2MOL5MSQE3EYK5LOWPFOKIQY","json":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY.json","graph_json":"https://pith.science/api/pith-number/ZL2MOL5MSQE3EYK5LOWPFOKIQY/graph.json","events_json":"https://pith.science/api/pith-number/ZL2MOL5MSQE3EYK5LOWPFOKIQY/events.json","paper":"https://pith.science/paper/ZL2MOL5M"},"agent_actions":{"view_html":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY","download_json":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY.json","view_paper":"https://pith.science/paper/ZL2MOL5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07378&json=true","fetch_graph":"https://pith.science/api/pith-number/ZL2MOL5MSQE3EYK5LOWPFOKIQY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZL2MOL5MSQE3EYK5LOWPFOKIQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/action/storage_attestation","attest_author":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/action/author_attestation","sign_citation":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/action/citation_signature","submit_replication":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/action/replication_record"}},"created_at":"2026-05-17T23:43:08.036498+00:00","updated_at":"2026-05-17T23:43:08.036498+00:00"}