{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:W4Z2GZNUWCMENDRAZIOQOERWXS","short_pith_number":"pith:W4Z2GZNU","schema_version":"1.0","canonical_sha256":"b733a365b4b098468e20ca1d071236bc8cd9a4c1f46e2d665b164341e5e48e3a","source":{"kind":"arxiv","id":"2007.09065","version":2},"attestation_state":"computed","paper":{"title":"Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Cosimo Vinci, Debashmita Poddar, Gianlorenzo D'Angelo","submitted_at":"2020-07-16T11:46:15Z","abstract_excerpt":"In the adaptive influence maximization problem, we are given a social network and a budget $k$, and we iteratively select $k$ nodes, called seeds, in order to maximize the expected number of nodes that are reached by an influence cascade that they generate according to a stochastic model for influence diffusion. Differently from the non-adaptive influence maximization problem, where all the seeds must be selected beforehand, here nodes are selected sequentially one by one, and the decision on the $i$th seed is based on the observed cascade produced by the first $i-1$ seeds. We focus on the myo"},"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":"2007.09065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-07-16T11:46:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fbd4f5d6686d832a1c8209b0aefb745dc9259f1d9a85732f3ed32ae608da351e","abstract_canon_sha256":"daae12fbb939a49db59c70be35a52b6454b0bbbb4fda33917a3bbaaf5009428e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:41.497672Z","signature_b64":"2XJV4IUOYSVQ5jLXirr3IiFAhewCxNgiUyWnkxUicq9ZYk48dJK2t2rstoXCEix0TERrpa9Ju+KcbDJ3+X3gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b733a365b4b098468e20ca1d071236bc8cd9a4c1f46e2d665b164341e5e48e3a","last_reissued_at":"2026-07-05T02:37:41.497164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:41.497164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Cosimo Vinci, Debashmita Poddar, Gianlorenzo D'Angelo","submitted_at":"2020-07-16T11:46:15Z","abstract_excerpt":"In the adaptive influence maximization problem, we are given a social network and a budget $k$, and we iteratively select $k$ nodes, called seeds, in order to maximize the expected number of nodes that are reached by an influence cascade that they generate according to a stochastic model for influence diffusion. Differently from the non-adaptive influence maximization problem, where all the seeds must be selected beforehand, here nodes are selected sequentially one by one, and the decision on the $i$th seed is based on the observed cascade produced by the first $i-1$ seeds. We focus on the myo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09065","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.09065/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.09065","created_at":"2026-07-05T02:37:41.497220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.09065v2","created_at":"2026-07-05T02:37:41.497220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09065","created_at":"2026-07-05T02:37:41.497220+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4Z2GZNUWCME","created_at":"2026-07-05T02:37:41.497220+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4Z2GZNUWCMENDRA","created_at":"2026-07-05T02:37:41.497220+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4Z2GZNU","created_at":"2026-07-05T02:37:41.497220+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/W4Z2GZNUWCMENDRAZIOQOERWXS","json":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS.json","graph_json":"https://pith.science/api/pith-number/W4Z2GZNUWCMENDRAZIOQOERWXS/graph.json","events_json":"https://pith.science/api/pith-number/W4Z2GZNUWCMENDRAZIOQOERWXS/events.json","paper":"https://pith.science/paper/W4Z2GZNU"},"agent_actions":{"view_html":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS","download_json":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS.json","view_paper":"https://pith.science/paper/W4Z2GZNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.09065&json=true","fetch_graph":"https://pith.science/api/pith-number/W4Z2GZNUWCMENDRAZIOQOERWXS/graph.json","fetch_events":"https://pith.science/api/pith-number/W4Z2GZNUWCMENDRAZIOQOERWXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS/action/storage_attestation","attest_author":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS/action/author_attestation","sign_citation":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS/action/citation_signature","submit_replication":"https://pith.science/pith/W4Z2GZNUWCMENDRAZIOQOERWXS/action/replication_record"}},"created_at":"2026-07-05T02:37:41.497220+00:00","updated_at":"2026-07-05T02:37:41.497220+00:00"}