{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZL2MOL5MSQE3EYK5LOWPFOKIQY","short_pith_number":"pith:ZL2MOL5M","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"},"canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","source":{"kind":"arxiv","id":"1906.07378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07378","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07378v1","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07378","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZL2MOL5MSQE3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZL2MOL5MSQE3EYK5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZL2MOL5M","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZL2MOL5MSQE3EYK5LOWPFOKIQY","target":"record","payload":{"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"},"canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","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"},"source_kind":"arxiv","source_id":"1906.07378","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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZilBUPbDe1afkmOXW/HRQ2PuMB4pyuaJySpdme/pH4nk3EQTRVsudc8CdvDI2AASzGwFKuScDcIkQPEG74ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:33:49.954387Z"},"content_sha256":"4c9ee3f36eb85aa9eb870a4e469c7b06abe55b2754ee1a6673ea36e7143c15cf","schema_version":"1.0","event_id":"sha256:4c9ee3f36eb85aa9eb870a4e469c7b06abe55b2754ee1a6673ea36e7143c15cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZL2MOL5MSQE3EYK5LOWPFOKIQY","target":"graph","payload":{"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"},"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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00t+iP/AgKwxas5bDk/GmzHHl4+MYldsTL/PX7Cs/ivGpKhytvR5J4s9avCqJ9VqB5RExxI5xcqjUDOrVj16Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:33:49.954733Z"},"content_sha256":"fcbe13a55b9006214cfad0c5f39e2e969a8854474eb15ed0fc1e50dce8ec9e09","schema_version":"1.0","event_id":"sha256:fcbe13a55b9006214cfad0c5f39e2e969a8854474eb15ed0fc1e50dce8ec9e09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/bundle.json","state_url":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/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-06-27T05:33:49Z","links":{"resolver":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY","bundle":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/bundle.json","state":"https://pith.science/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZL2MOL5MSQE3EYK5LOWPFOKIQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZL2MOL5MSQE3EYK5LOWPFOKIQY","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":"8a255217ad48a56c3bd882090f4efb83e7ae67b63663274df9a999a54c4b93df","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-06-18T04:54:26Z","title_canon_sha256":"4aed89ed95e81396a6b8cce0b09528b7b0769711852104e6171316cabb1d7587"},"schema_version":"1.0","source":{"id":"1906.07378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07378","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07378v1","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07378","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZL2MOL5MSQE3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZL2MOL5MSQE3EYK5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZL2MOL5M","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fcbe13a55b9006214cfad0c5f39e2e969a8854474eb15ed0fc1e50dce8ec9e09","target":"graph","created_at":"2026-05-17T23:43:08Z","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":"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","authors_text":"Changsheng Sun, Hui Li, Jiangtao Cui, Mengting Xu, Sourav S Bhowmick, Zhongyuan Jiang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-06-18T04:54:26Z","title":"DISCO: Influence Maximization Meets Network Embedding and Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07378","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:4c9ee3f36eb85aa9eb870a4e469c7b06abe55b2754ee1a6673ea36e7143c15cf","target":"record","created_at":"2026-05-17T23:43:08Z","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":"8a255217ad48a56c3bd882090f4efb83e7ae67b63663274df9a999a54c4b93df","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-06-18T04:54:26Z","title_canon_sha256":"4aed89ed95e81396a6b8cce0b09528b7b0769711852104e6171316cabb1d7587"},"schema_version":"1.0","source":{"id":"1906.07378","kind":"arxiv","version":1}},"canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caf4c72fac9409b2615d5bacf2b9488636ae1b4ef5ea78fb6cb467591c7dba5f","first_computed_at":"2026-05-17T23:43:08.036390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.036390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gSlkuWiIhE/vyCXMHq+NoJJGwMh4FmlArYjnLkPAaph3fLm4c52KrKGFdg/GcEXD7x0qOGhKXd6PYeQOZhvDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.037032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c9ee3f36eb85aa9eb870a4e469c7b06abe55b2754ee1a6673ea36e7143c15cf","sha256:fcbe13a55b9006214cfad0c5f39e2e969a8854474eb15ed0fc1e50dce8ec9e09"],"state_sha256":"9ca08cc3bdd35804f612005a2171174f350b874d83a8afd7ce1b13ac858a2e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpOE3F61c+CW9P89bYAbBEU4K0eJIfK5M/yKgPTyIaxsSGvaBxrwPFWrqPkm3mcxeLO9yfrk5xosfjVIyrofAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:33:49.956601Z","bundle_sha256":"3c6577c73ab07671b5f68c229f8933d273b3acc730dc28c9714a0c7d31bfb0d6"}}