{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3VAGZARTZEBIAEEJO7AFTZIUMD","short_pith_number":"pith:3VAGZART","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"},"canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","source":{"kind":"arxiv","id":"1807.06921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06921","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06921v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06921","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"3VAGZARTZEBI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3VAGZARTZEBIAEEJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3VAGZART","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3VAGZARTZEBIAEEJO7AFTZIUMD","target":"record","payload":{"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"},"canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","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"},"source_kind":"arxiv","source_id":"1807.06921","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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPoyzEY29aVEwfY+k5GVoiTWwutaT0bLJGM+nYXiBj6cskH/Ld0yqQr/2zDfIURZxWVjyifFnaHVVG2gCleEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:39.235830Z"},"content_sha256":"43510284fdf813dd19b47daaa308eb45ecd2230fb750327471de6a010993489d","schema_version":"1.0","event_id":"sha256:43510284fdf813dd19b47daaa308eb45ecd2230fb750327471de6a010993489d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3VAGZARTZEBIAEEJO7AFTZIUMD","target":"graph","payload":{"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"},"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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bobt8dVS3dnLniYR0+x5zw51TJpYWCEkQqBgYIKFtnkqUfUpQTp+JdJm8gbZZm7z7nuRj0AqfcidXnh6k4bZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:39.236178Z"},"content_sha256":"6456fc959836c82e9acc760610a20176220f16c59fc3bab6ceccca0512bd9846","schema_version":"1.0","event_id":"sha256:6456fc959836c82e9acc760610a20176220f16c59fc3bab6ceccca0512bd9846"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/bundle.json","state_url":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/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-05-27T11:51:39Z","links":{"resolver":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD","bundle":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/bundle.json","state":"https://pith.science/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VAGZARTZEBIAEEJO7AFTZIUMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3VAGZARTZEBIAEEJO7AFTZIUMD","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":"1a2efd34f7333a629bfa0a54ebabca9b8425d11b6828bed5dabba9f02d7b15e0","cross_cats_sorted":["cs.SI","math.CO","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T13:36:56Z","title_canon_sha256":"6a3682637f63728dc9fafaf72b285f549493e085a279ead0f553ebe5293798f5"},"schema_version":"1.0","source":{"id":"1807.06921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06921","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06921v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06921","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"3VAGZARTZEBI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3VAGZARTZEBIAEEJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3VAGZART","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6456fc959836c82e9acc760610a20176220f16c59fc3bab6ceccca0512bd9846","target":"graph","created_at":"2026-05-18T00:10:25Z","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":"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 ","authors_text":"Adele Anna Rescigno, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Ugo Vaccaro","cross_cats":["cs.SI","math.CO","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T13:36:56Z","title":"Time-Bounded Influence Diffusion with Incentives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06921","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:43510284fdf813dd19b47daaa308eb45ecd2230fb750327471de6a010993489d","target":"record","created_at":"2026-05-18T00:10:25Z","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":"1a2efd34f7333a629bfa0a54ebabca9b8425d11b6828bed5dabba9f02d7b15e0","cross_cats_sorted":["cs.SI","math.CO","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T13:36:56Z","title_canon_sha256":"6a3682637f63728dc9fafaf72b285f549493e085a279ead0f553ebe5293798f5"},"schema_version":"1.0","source":{"id":"1807.06921","kind":"arxiv","version":1}},"canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd406c8233c90280108977c059e51460c731d12727d4acb073fb485cea8961c7","first_computed_at":"2026-05-18T00:10:25.346631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:25.346631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FUdWFTl3Qio6jDPVjGX1UpgkM1tut61/83xioKOr+pte7cHZVgfR5mZGui7hKVBNRBGGhXjae9C2idwwwO7sAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:25.347418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43510284fdf813dd19b47daaa308eb45ecd2230fb750327471de6a010993489d","sha256:6456fc959836c82e9acc760610a20176220f16c59fc3bab6ceccca0512bd9846"],"state_sha256":"4fc8f1cc71b462a3789ff3051a60670a869376ead56ad2f28a8cdd9d246d4385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgmN2u2xjI6e18Vsr4v4DnFDIBHg9XAL60M2fqBPLlaZPIXYL5Unzog/IlvJp8+uuR0CptoouxK+CRN5olDAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:39.238347Z","bundle_sha256":"a4e52547d736e10029b4820b832544b86d6c8fb4b1892fe86ecd1b8e0afec055"}}