{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E3KEC3GO5PEXMOXBA6CWASMXUU","short_pith_number":"pith:E3KEC3GO","canonical_record":{"source":{"id":"1404.3033","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"f2ad1d592a9666d4a0822d16d4137108b304b169cda68a37bea7d8df6e9830fe","abstract_canon_sha256":"5fc84e4da773c946e16c22f8dfecff56d9aca1bf7d07cbdeab25e6d5476a4304"},"schema_version":"1.0"},"canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","source":{"kind":"arxiv","id":"1404.3033","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3033","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3033v5","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3033","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"E3KEC3GO5PEX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E3KEC3GO5PEXMOXB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E3KEC3GO","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E3KEC3GO5PEXMOXBA6CWASMXUU","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3033","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"f2ad1d592a9666d4a0822d16d4137108b304b169cda68a37bea7d8df6e9830fe","abstract_canon_sha256":"5fc84e4da773c946e16c22f8dfecff56d9aca1bf7d07cbdeab25e6d5476a4304"},"schema_version":"1.0"},"canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.535358Z","signature_b64":"xkUNwiJUHLlo/m3xDtgK2s3HHGiDVO+d2n6/WOC7Bro57KRI0d8Pek+AGo2gPX3M87efNRUzZDbsWBf4dQUUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","last_reissued_at":"2026-05-18T02:27:05.534939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.534939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3033","source_version":5,"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LG18Nj3OAZs1emhFtg+ja5WCADqsx/rtIPWPX1/jHfD3M0qbi8GKYycnv5uP139VulkNayzYtj9/M9kPZMy7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:36.379355Z"},"content_sha256":"74bbf9ab3db968e881146d687f2ec33dc583f9dbb073c02be749a358978d5d88","schema_version":"1.0","event_id":"sha256:74bbf9ab3db968e881146d687f2ec33dc583f9dbb073c02be749a358978d5d88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E3KEC3GO5PEXMOXBA6CWASMXUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to go Viral: Cheaply and Quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.SI","authors_text":"Ferdinando Cicalese, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Martin Milanic, Ugo Vaccaro","submitted_at":"2014-04-11T08:43:46Z","abstract_excerpt":"Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in $S$ are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve --- even in the approximate sense --- we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3033","kind":"arxiv","version":5},"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/2fydbtJeHReIq0xRkR8jJg4wLPskgsOVgcXNyQwyp0TMaq89Dbh4Hzukv+12Uj37t6oca9NCPlDgtTHeGODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:36.380049Z"},"content_sha256":"fd2afb33f2b080aa088e21dc8023753db2c948cf48dcb4262a33305afe1ab214","schema_version":"1.0","event_id":"sha256:fd2afb33f2b080aa088e21dc8023753db2c948cf48dcb4262a33305afe1ab214"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/bundle.json","state_url":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/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-27T09:23:36Z","links":{"resolver":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU","bundle":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/bundle.json","state":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E3KEC3GO5PEXMOXBA6CWASMXUU","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":"5fc84e4da773c946e16c22f8dfecff56d9aca1bf7d07cbdeab25e6d5476a4304","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","title_canon_sha256":"f2ad1d592a9666d4a0822d16d4137108b304b169cda68a37bea7d8df6e9830fe"},"schema_version":"1.0","source":{"id":"1404.3033","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3033","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3033v5","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3033","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"E3KEC3GO5PEX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E3KEC3GO5PEXMOXB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E3KEC3GO","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:fd2afb33f2b080aa088e21dc8023753db2c948cf48dcb4262a33305afe1ab214","target":"graph","created_at":"2026-05-18T02:27:05Z","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 social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in $S$ are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve --- even in the approximate sense --- we p","authors_text":"Ferdinando Cicalese, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Martin Milanic, Ugo Vaccaro","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","title":"How to go Viral: Cheaply and Quickly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3033","kind":"arxiv","version":5},"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:74bbf9ab3db968e881146d687f2ec33dc583f9dbb073c02be749a358978d5d88","target":"record","created_at":"2026-05-18T02:27:05Z","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":"5fc84e4da773c946e16c22f8dfecff56d9aca1bf7d07cbdeab25e6d5476a4304","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","title_canon_sha256":"f2ad1d592a9666d4a0822d16d4137108b304b169cda68a37bea7d8df6e9830fe"},"schema_version":"1.0","source":{"id":"1404.3033","kind":"arxiv","version":5}},"canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","first_computed_at":"2026-05-18T02:27:05.534939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.534939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xkUNwiJUHLlo/m3xDtgK2s3HHGiDVO+d2n6/WOC7Bro57KRI0d8Pek+AGo2gPX3M87efNRUzZDbsWBf4dQUUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.535358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3033","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74bbf9ab3db968e881146d687f2ec33dc583f9dbb073c02be749a358978d5d88","sha256:fd2afb33f2b080aa088e21dc8023753db2c948cf48dcb4262a33305afe1ab214"],"state_sha256":"860d2ba5e7d7232328ca9c9f25d0553110f5bd29496dab2cadb46749e4050e96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHFTwqxoiRd7uawbgI4K+84kQkx3YSm8k8S4Pik/Z9V76+dbERDIC1Z1vx/YokxnVF8wwmYXhS9wsU30/qYaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:23:36.383539Z","bundle_sha256":"c54ca2818b6bca5911ca78c872c08b7005722f5670dbc1c1e729b5b2260a4b18"}}