{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4SWZMR3AQLPTGRSSNZ3KENZNHP","short_pith_number":"pith:4SWZMR3A","schema_version":"1.0","canonical_sha256":"e4ad96476082df3346526e76a2372d3bf76b92213a4104121819c1c5759d69b6","source":{"kind":"arxiv","id":"1506.06294","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Influence Maximization in Dynamic Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ding-Zhu Du, Guangmo Tong, Shaojie Tang, Weili Wu","submitted_at":"2015-06-20T21:01:37Z","abstract_excerpt":"For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization problem. Despite a large number of works have studied this problem, the existing seeding strategies are limited to the static social networks. In fact, due to the high speed data transmission and the large population of participants, the diffusion processes in real-world social networks have many aspects of uncertainness. Unfortunately, as shown in the experiments"},"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":"1506.06294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-20T21:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"246d576aad7048014761bcbcbd125cbf3e5b8365987c4014594c37b4978cd5c8","abstract_canon_sha256":"2c6a9b167bb0fb08e376fd119ea4d476317c9401b102b7b0a905edbdaf8ede4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.463271Z","signature_b64":"HAPep8un2bYKMJ5zFkac+ukGihJKotWrq/IPtcrKM7Ffy8VvinzfzTMGXjXVq4zRXO2SkGoxA+AEQ0AWOzW9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ad96476082df3346526e76a2372d3bf76b92213a4104121819c1c5759d69b6","last_reissued_at":"2026-05-18T01:11:37.462917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.462917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Influence Maximization in Dynamic Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ding-Zhu Du, Guangmo Tong, Shaojie Tang, Weili Wu","submitted_at":"2015-06-20T21:01:37Z","abstract_excerpt":"For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization problem. Despite a large number of works have studied this problem, the existing seeding strategies are limited to the static social networks. In fact, due to the high speed data transmission and the large population of participants, the diffusion processes in real-world social networks have many aspects of uncertainness. Unfortunately, as shown in the experiments"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06294","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":"1506.06294","created_at":"2026-05-18T01:11:37.462979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06294v1","created_at":"2026-05-18T01:11:37.462979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06294","created_at":"2026-05-18T01:11:37.462979+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SWZMR3AQLPT","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SWZMR3AQLPTGRSS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SWZMR3A","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07625","citing_title":"Influence Maximization Considering Influence, Cost and Time","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP","json":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP.json","graph_json":"https://pith.science/api/pith-number/4SWZMR3AQLPTGRSSNZ3KENZNHP/graph.json","events_json":"https://pith.science/api/pith-number/4SWZMR3AQLPTGRSSNZ3KENZNHP/events.json","paper":"https://pith.science/paper/4SWZMR3A"},"agent_actions":{"view_html":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP","download_json":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP.json","view_paper":"https://pith.science/paper/4SWZMR3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06294&json=true","fetch_graph":"https://pith.science/api/pith-number/4SWZMR3AQLPTGRSSNZ3KENZNHP/graph.json","fetch_events":"https://pith.science/api/pith-number/4SWZMR3AQLPTGRSSNZ3KENZNHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP/action/storage_attestation","attest_author":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP/action/author_attestation","sign_citation":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP/action/citation_signature","submit_replication":"https://pith.science/pith/4SWZMR3AQLPTGRSSNZ3KENZNHP/action/replication_record"}},"created_at":"2026-05-18T01:11:37.462979+00:00","updated_at":"2026-05-18T01:11:37.462979+00:00"}