{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3VAGZARTZEBIAEEJO7AFTZIUMD","short_pith_number":"pith:3VAGZART","schema_version":"1.0","canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","source":{"kind":"arxiv","id":"1807.06921","version":1},"attestation_state":"computed","paper":{"title":"Time-Bounded Influence Diffusion with Incentives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Adele Anna Rescigno, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Ugo Vaccaro","submitted_at":"2018-07-18T13:36:56Z","abstract_excerpt":"A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\\subseteq V$ are influenced. During each subsequent round, the set of influenced nodes is augmented by including every node $v$ that has at least $t(v)$ previously influenced neighbours. The general problem is to find a small initial set that influences the whole network. In this paper we extend this model by using \\emph{incentives} to reduce the thresholds of some nodes. The goal is to minimize "},"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":"1807.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T13:36:56Z","cross_cats_sorted":["cs.SI","math.CO","physics.soc-ph"],"title_canon_sha256":"6a3682637f63728dc9fafaf72b285f549493e085a279ead0f553ebe5293798f5","abstract_canon_sha256":"1a2efd34f7333a629bfa0a54ebabca9b8425d11b6828bed5dabba9f02d7b15e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.347418Z","signature_b64":"FUdWFTl3Qio6jDPVjGX1UpgkM1tut61/83xioKOr+pte7cHZVgfR5mZGui7hKVBNRBGGhXjae9C2idwwwO7sAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","last_reissued_at":"2026-05-18T00:10:25.346631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.346631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Bounded Influence Diffusion with Incentives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Adele Anna Rescigno, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Ugo Vaccaro","submitted_at":"2018-07-18T13:36:56Z","abstract_excerpt":"A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\\subseteq V$ are influenced. During each subsequent round, the set of influenced nodes is augmented by including every node $v$ that has at least $t(v)$ previously influenced neighbours. The general problem is to find a small initial set that influences the whole network. In this paper we extend this model by using \\emph{incentives} to reduce the thresholds of some nodes. The goal is to minimize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06921","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":"1807.06921","created_at":"2026-05-18T00:10:25.346756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06921v1","created_at":"2026-05-18T00:10:25.346756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06921","created_at":"2026-05-18T00:10:25.346756+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VAGZARTZEBI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VAGZARTZEBIAEEJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VAGZART","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":230,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD","json":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD.json","graph_json":"https://pith.science/api/pith-number/3VAGZARTZEBIAEEJO7AFTZIUMD/graph.json","events_json":"https://pith.science/api/pith-number/3VAGZARTZEBIAEEJO7AFTZIUMD/events.json","paper":"https://pith.science/paper/3VAGZART"},"agent_actions":{"view_html":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD","download_json":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD.json","view_paper":"https://pith.science/paper/3VAGZART","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06921&json=true","fetch_graph":"https://pith.science/api/pith-number/3VAGZARTZEBIAEEJO7AFTZIUMD/graph.json","fetch_events":"https://pith.science/api/pith-number/3VAGZARTZEBIAEEJO7AFTZIUMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/action/storage_attestation","attest_author":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/action/author_attestation","sign_citation":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/action/citation_signature","submit_replication":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/action/replication_record"}},"created_at":"2026-05-18T00:10:25.346756+00:00","updated_at":"2026-05-18T00:10:25.346756+00:00"}