{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FB4ILVT2MCZ6CAPRV33P4PH3VM","short_pith_number":"pith:FB4ILVT2","canonical_record":{"source":{"id":"1706.06466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T08:13:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c62debbc849145a4e0cce5e73e41e6b2dcc18d22161feb31c601e130ff603f79","abstract_canon_sha256":"164e2b139b43ed07f8905c84bc348394e58429d9c6053f95879bdf5d5282925d"},"schema_version":"1.0"},"canonical_sha256":"287885d67a60b3e101f1aef6fe3cfbab0ef575048ff76104b8cba60538b95e25","source":{"kind":"arxiv","id":"1706.06466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06466","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06466v1","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06466","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"FB4ILVT2MCZ6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FB4ILVT2MCZ6CAPR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FB4ILVT2","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FB4ILVT2MCZ6CAPRV33P4PH3VM","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T08:13:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c62debbc849145a4e0cce5e73e41e6b2dcc18d22161feb31c601e130ff603f79","abstract_canon_sha256":"164e2b139b43ed07f8905c84bc348394e58429d9c6053f95879bdf5d5282925d"},"schema_version":"1.0"},"canonical_sha256":"287885d67a60b3e101f1aef6fe3cfbab0ef575048ff76104b8cba60538b95e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:03.194292Z","signature_b64":"wlZ5gJKlKelbGiUdg62dMo1FKheqmQPRQ2BLa1tlW47bTLGkExsfFzwbV1sctHU3Gi8ev9PdVkaFrERJBfsCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"287885d67a60b3e101f1aef6fe3cfbab0ef575048ff76104b8cba60538b95e25","last_reissued_at":"2026-05-18T00:42:03.193751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:03.193751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06466","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xUc4w7mG/Rv2dYWGMMQUIgTsxg3wpELfgej8kf+WTkD4112KQbjzn6E/00WCH1CmaycLAAF8p5pzefKISg8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:21:31.829907Z"},"content_sha256":"d3fa53433338703e88aee44c24aa3ab617fe58ee7ae26df333330bac60dbed4a","schema_version":"1.0","event_id":"sha256:d3fa53433338703e88aee44c24aa3ab617fe58ee7ae26df333330bac60dbed4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FB4ILVT2MCZ6CAPRV33P4PH3VM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting nodes and buying links to maximize the information diffusion in a network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj","submitted_at":"2017-06-19T08:13:28Z","abstract_excerpt":"The Independent Cascade Model (ICM) is a widely studied model that aims to capture the dynamics of the information diffusion in social networks and in general complex networks. In this model, we can distinguish between active nodes which spread the information and inactive ones. The process starts from a set of initially active nodes called seeds. Recursively, currently active nodes can activate their neighbours according to a probability distribution on the set of edges. After a certain number of these recursive cycles, a large number of nodes might become active. The process terminates when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06466","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADOGm+7uye4lljhhjbmDct7HtnbPHnkmjejhlgMoad3KLtQICz7NuaZSZyf/a01RHqXlmOI98BtJboJTupZiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:21:31.830246Z"},"content_sha256":"af5bf3abb01f4e74ca8b240a0ba339de8f7e4c9ae5f02a57bbf46f6982f7ee40","schema_version":"1.0","event_id":"sha256:af5bf3abb01f4e74ca8b240a0ba339de8f7e4c9ae5f02a57bbf46f6982f7ee40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/bundle.json","state_url":"https://pith.science/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/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-06-21T14:21:31Z","links":{"resolver":"https://pith.science/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM","bundle":"https://pith.science/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/bundle.json","state":"https://pith.science/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FB4ILVT2MCZ6CAPRV33P4PH3VM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FB4ILVT2MCZ6CAPRV33P4PH3VM","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":"164e2b139b43ed07f8905c84bc348394e58429d9c6053f95879bdf5d5282925d","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T08:13:28Z","title_canon_sha256":"c62debbc849145a4e0cce5e73e41e6b2dcc18d22161feb31c601e130ff603f79"},"schema_version":"1.0","source":{"id":"1706.06466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06466","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06466v1","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06466","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"FB4ILVT2MCZ6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FB4ILVT2MCZ6CAPR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FB4ILVT2","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:af5bf3abb01f4e74ca8b240a0ba339de8f7e4c9ae5f02a57bbf46f6982f7ee40","target":"graph","created_at":"2026-05-18T00:42:03Z","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":"The Independent Cascade Model (ICM) is a widely studied model that aims to capture the dynamics of the information diffusion in social networks and in general complex networks. In this model, we can distinguish between active nodes which spread the information and inactive ones. The process starts from a set of initially active nodes called seeds. Recursively, currently active nodes can activate their neighbours according to a probability distribution on the set of edges. After a certain number of these recursive cycles, a large number of nodes might become active. The process terminates when ","authors_text":"Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T08:13:28Z","title":"Selecting nodes and buying links to maximize the information diffusion in a network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06466","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:d3fa53433338703e88aee44c24aa3ab617fe58ee7ae26df333330bac60dbed4a","target":"record","created_at":"2026-05-18T00:42:03Z","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":"164e2b139b43ed07f8905c84bc348394e58429d9c6053f95879bdf5d5282925d","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T08:13:28Z","title_canon_sha256":"c62debbc849145a4e0cce5e73e41e6b2dcc18d22161feb31c601e130ff603f79"},"schema_version":"1.0","source":{"id":"1706.06466","kind":"arxiv","version":1}},"canonical_sha256":"287885d67a60b3e101f1aef6fe3cfbab0ef575048ff76104b8cba60538b95e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"287885d67a60b3e101f1aef6fe3cfbab0ef575048ff76104b8cba60538b95e25","first_computed_at":"2026-05-18T00:42:03.193751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:03.193751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wlZ5gJKlKelbGiUdg62dMo1FKheqmQPRQ2BLa1tlW47bTLGkExsfFzwbV1sctHU3Gi8ev9PdVkaFrERJBfsCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:03.194292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3fa53433338703e88aee44c24aa3ab617fe58ee7ae26df333330bac60dbed4a","sha256:af5bf3abb01f4e74ca8b240a0ba339de8f7e4c9ae5f02a57bbf46f6982f7ee40"],"state_sha256":"5c19d13da50bca2ee94e1010381c880c3b09efea9bfdc24e006bd64c3f053ffc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjfieLyeImHOIVc0DdvP9ALWiwvx3Y8v1y8hGrjfylUJPdYnDVV/7Q8NXs3yHeqQOMGvpFY3WAWjVebqk3eHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:21:31.832095Z","bundle_sha256":"4246f3f04ec74c6ec287040e49a7141eab797ebc17d24c05e61353f6af0f13c3"}}