{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4J6GNOSHCIF3N2D5MXWZGBTLIF","short_pith_number":"pith:4J6GNOSH","canonical_record":{"source":{"id":"1610.03721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-12T14:18:04Z","cross_cats_sorted":["cs.SI","math.CO","physics.soc-ph"],"title_canon_sha256":"f68f38c9082b1dc19d1be69498c0c307999f3f445ee7ecccf70ff869518888c6","abstract_canon_sha256":"80f8c610661a086fa7ef6d010c4923afb6b23e654081bc76b83fd83ddcc7d40b"},"schema_version":"1.0"},"canonical_sha256":"e27c66ba47120bb6e87d65ed93066b417c0cf0d460e29fb5beb6fcc5e110a881","source":{"kind":"arxiv","id":"1610.03721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03721","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03721v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03721","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"4J6GNOSHCIF3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4J6GNOSHCIF3N2D5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4J6GNOSH","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4J6GNOSHCIF3N2D5MXWZGBTLIF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-12T14:18:04Z","cross_cats_sorted":["cs.SI","math.CO","physics.soc-ph"],"title_canon_sha256":"f68f38c9082b1dc19d1be69498c0c307999f3f445ee7ecccf70ff869518888c6","abstract_canon_sha256":"80f8c610661a086fa7ef6d010c4923afb6b23e654081bc76b83fd83ddcc7d40b"},"schema_version":"1.0"},"canonical_sha256":"e27c66ba47120bb6e87d65ed93066b417c0cf0d460e29fb5beb6fcc5e110a881","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:29.438529Z","signature_b64":"GZvgxZugxiqxl2ryTyumntoetlPcgsW9ZBn3HMwG4WOKbzWSQNniy8/pciQleoJRV7EzG1UteMai4QyeobHjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27c66ba47120bb6e87d65ed93066b417c0cf0d460e29fb5beb6fcc5e110a881","last_reissued_at":"2026-05-18T01:02:29.438034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:29.438034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03721","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-18T01:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIa1PS1JI2FzySgqFDkPvp5hIq8ahONdfYuRwvqlhojf+bfF5cgkUHRN+kHbRVNQul+pwkMYp74KArggq7PoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:54.402851Z"},"content_sha256":"0a68a3bc8c53b9f5b13dcd991413bcc49ef856e237840cb3a4acc62446b24c52","schema_version":"1.0","event_id":"sha256:0a68a3bc8c53b9f5b13dcd991413bcc49ef856e237840cb3a4acc62446b24c52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4J6GNOSHCIF3N2D5MXWZGBTLIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm","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 A. Rescigno, Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Ugo Vaccaro","submitted_at":"2016-10-12T14:18:04Z","abstract_excerpt":"Given a network represented by a graph $G=(V,E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\\subseteq V$ are influenced; subsequently, at each round, the set of influenced nodes is augmented by all the nodes in the network that have a sufficiently large number of already influenced neighbors. The question is to determine a small subset of nodes $S$ (\\emph{a target set}) that can influence the whole network. This is a widely studied problem that abstracts many phenomena in the social, economic, biological, and ph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03721","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-18T01:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZXrCf1fxB30DOMIgLcimhUReiuNq482Bb8lCMb661CmNEA9suZ/C99y6otdnPuCuO2mnOu0J288TlVJAnr2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:54.403498Z"},"content_sha256":"9ba8bcb6f13eb5644f36011fce9c1dbfe9d6928e0360a4e6256456bb93d0a055","schema_version":"1.0","event_id":"sha256:9ba8bcb6f13eb5644f36011fce9c1dbfe9d6928e0360a4e6256456bb93d0a055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/bundle.json","state_url":"https://pith.science/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/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-27T22:15:54Z","links":{"resolver":"https://pith.science/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF","bundle":"https://pith.science/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/bundle.json","state":"https://pith.science/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4J6GNOSHCIF3N2D5MXWZGBTLIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4J6GNOSHCIF3N2D5MXWZGBTLIF","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":"80f8c610661a086fa7ef6d010c4923afb6b23e654081bc76b83fd83ddcc7d40b","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":"2016-10-12T14:18:04Z","title_canon_sha256":"f68f38c9082b1dc19d1be69498c0c307999f3f445ee7ecccf70ff869518888c6"},"schema_version":"1.0","source":{"id":"1610.03721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03721","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03721v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03721","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"4J6GNOSHCIF3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4J6GNOSHCIF3N2D5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4J6GNOSH","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:9ba8bcb6f13eb5644f36011fce9c1dbfe9d6928e0360a4e6256456bb93d0a055","target":"graph","created_at":"2026-05-18T01:02:29Z","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":"Given a network represented by a graph $G=(V,E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\\subseteq V$ are influenced; subsequently, at each round, the set of influenced nodes is augmented by all the nodes in the network that have a sufficiently large number of already influenced neighbors. The question is to determine a small subset of nodes $S$ (\\emph{a target set}) that can influence the whole network. This is a widely studied problem that abstracts many phenomena in the social, economic, biological, and ph","authors_text":"Adele A. Rescigno, Gennaro Cordasco, Luisa Gargano, Marco Mecchia, 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":"2016-10-12T14:18:04Z","title":"Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03721","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:0a68a3bc8c53b9f5b13dcd991413bcc49ef856e237840cb3a4acc62446b24c52","target":"record","created_at":"2026-05-18T01:02:29Z","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":"80f8c610661a086fa7ef6d010c4923afb6b23e654081bc76b83fd83ddcc7d40b","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":"2016-10-12T14:18:04Z","title_canon_sha256":"f68f38c9082b1dc19d1be69498c0c307999f3f445ee7ecccf70ff869518888c6"},"schema_version":"1.0","source":{"id":"1610.03721","kind":"arxiv","version":1}},"canonical_sha256":"e27c66ba47120bb6e87d65ed93066b417c0cf0d460e29fb5beb6fcc5e110a881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e27c66ba47120bb6e87d65ed93066b417c0cf0d460e29fb5beb6fcc5e110a881","first_computed_at":"2026-05-18T01:02:29.438034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.438034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GZvgxZugxiqxl2ryTyumntoetlPcgsW9ZBn3HMwG4WOKbzWSQNniy8/pciQleoJRV7EzG1UteMai4QyeobHjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.438529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a68a3bc8c53b9f5b13dcd991413bcc49ef856e237840cb3a4acc62446b24c52","sha256:9ba8bcb6f13eb5644f36011fce9c1dbfe9d6928e0360a4e6256456bb93d0a055"],"state_sha256":"8eeeb3941a2635aed239a68c588e8de2834706db85584c189cdbf038d9441eeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkaUUncxrKxku4ikM+wTu0FVz2O0HMzMV2OdLgaLqpwSalmJSIaVSKEl++aLo7PBsIrxSFcYHVy6h8xZcFvkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:15:54.406438Z","bundle_sha256":"bb3cd852d732034a8555f2be266a904be89bf29038018f03f08b8f880a67dc97"}}