{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VP7NJKBWFJUTNVFZ5BZOPCJZTE","short_pith_number":"pith:VP7NJKBW","schema_version":"1.0","canonical_sha256":"abfed4a8362a6936d4b9e872e7893999367f331cf798698afe8d626180c72256","source":{"kind":"arxiv","id":"1504.03306","version":1},"attestation_state":"computed","paper":{"title":"Virus Propagation in Multiple Profile Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Angeliki Rapti, Giannis Tzimas, Kostas Tsichlas, Spiros Sioutas","submitted_at":"2015-04-13T19:29:03Z","abstract_excerpt":"Suppose we have a virus or one competing idea/product that propagates over a multiple profile (e.g., social) network. Can we predict what proportion of the network will actually get \"infected\" (e.g., spread the idea or buy the competing product), when the nodes of the network appear to have different sensitivity based on their profile? For example, if there are two profiles $\\mathcal{A}$ and $\\mathcal{B}$ in a network and the nodes of profile $\\mathcal{A}$ and profile $\\mathcal{B}$ are susceptible to a highly spreading virus with probabilities $\\beta_{\\mathcal{A}}$ and $\\beta_{\\mathcal{B}}$ re"},"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":"1504.03306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-13T19:29:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"dc1c49cdebae240c6a2a594340177b059c98bfba7084ff2edf29f6ff77947445","abstract_canon_sha256":"13f09972e29f743d237011f6bd08107ccc2524df686e2824f6b1daf2ed68c1d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:58.629422Z","signature_b64":"h62U2nVfaiqQKIQ3S0FDaXsF6Px2ytdgaDNVOQKcH4dKd3GXV97G4SFy9pmXPO6BKMjFYivzHF8Xa2a5D4fcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abfed4a8362a6936d4b9e872e7893999367f331cf798698afe8d626180c72256","last_reissued_at":"2026-05-18T02:18:58.628709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:58.628709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Virus Propagation in Multiple Profile Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Angeliki Rapti, Giannis Tzimas, Kostas Tsichlas, Spiros Sioutas","submitted_at":"2015-04-13T19:29:03Z","abstract_excerpt":"Suppose we have a virus or one competing idea/product that propagates over a multiple profile (e.g., social) network. Can we predict what proportion of the network will actually get \"infected\" (e.g., spread the idea or buy the competing product), when the nodes of the network appear to have different sensitivity based on their profile? For example, if there are two profiles $\\mathcal{A}$ and $\\mathcal{B}$ in a network and the nodes of profile $\\mathcal{A}$ and profile $\\mathcal{B}$ are susceptible to a highly spreading virus with probabilities $\\beta_{\\mathcal{A}}$ and $\\beta_{\\mathcal{B}}$ re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03306","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":"1504.03306","created_at":"2026-05-18T02:18:58.628843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03306v1","created_at":"2026-05-18T02:18:58.628843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03306","created_at":"2026-05-18T02:18:58.628843+00:00"},{"alias_kind":"pith_short_12","alias_value":"VP7NJKBWFJUT","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VP7NJKBWFJUTNVFZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VP7NJKBW","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE","json":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE.json","graph_json":"https://pith.science/api/pith-number/VP7NJKBWFJUTNVFZ5BZOPCJZTE/graph.json","events_json":"https://pith.science/api/pith-number/VP7NJKBWFJUTNVFZ5BZOPCJZTE/events.json","paper":"https://pith.science/paper/VP7NJKBW"},"agent_actions":{"view_html":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE","download_json":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE.json","view_paper":"https://pith.science/paper/VP7NJKBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03306&json=true","fetch_graph":"https://pith.science/api/pith-number/VP7NJKBWFJUTNVFZ5BZOPCJZTE/graph.json","fetch_events":"https://pith.science/api/pith-number/VP7NJKBWFJUTNVFZ5BZOPCJZTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE/action/storage_attestation","attest_author":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE/action/author_attestation","sign_citation":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE/action/citation_signature","submit_replication":"https://pith.science/pith/VP7NJKBWFJUTNVFZ5BZOPCJZTE/action/replication_record"}},"created_at":"2026-05-18T02:18:58.628843+00:00","updated_at":"2026-05-18T02:18:58.628843+00:00"}