{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IW7KKDHTAKMVZ2B3B7IGSNIJLX","short_pith_number":"pith:IW7KKDHT","schema_version":"1.0","canonical_sha256":"45bea50cf302995ce83b0fd06935095dc0e62842900ee11e730d80e559cf344b","source":{"kind":"arxiv","id":"1702.07662","version":2},"attestation_state":"computed","paper":{"title":"A Network Epidemic Model for Online Community Commissioning Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ME"],"primary_cat":"stat.CO","authors_text":"Andrew Garbett, Clement Lee, Darren J. Wilkinson","submitted_at":"2017-02-24T17:01:59Z","abstract_excerpt":"A statistical model assuming a preferential attachment network, which is generated by adding nodes sequentially according to a few simple rules, usually describes real-life networks better than a model assuming, for example, a Bernoulli random graph, in which any two nodes have the same probability of being connected, does. Therefore, to study the propogation of \"infection\" across a social network, we propose a network epidemic model by combining a stochastic epidemic model and a preferential attachment model. A simulation study based on the subsequent Markov Chain Monte Carlo algorithm reveal"},"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":"1702.07662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-02-24T17:01:59Z","cross_cats_sorted":["cs.SI","stat.ME"],"title_canon_sha256":"ba97616905db642f4a12dcd9773c405d52b2d83e71dddd7011faebbe3a6a7d9b","abstract_canon_sha256":"61f954bed117206aad3c3c37a0f80708168ff7c55fd084b04cebf5345adf0f1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:37.666784Z","signature_b64":"UCF/ccnpRChOSA81q8CpQrBN5nDFgQSGeEolfBuLMdLQvp1ywAGi5t16BcAjQIg3pSv8benZHVB3/QM9ykNuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45bea50cf302995ce83b0fd06935095dc0e62842900ee11e730d80e559cf344b","last_reissued_at":"2026-05-18T00:04:37.666321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:37.666321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Network Epidemic Model for Online Community Commissioning Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ME"],"primary_cat":"stat.CO","authors_text":"Andrew Garbett, Clement Lee, Darren J. Wilkinson","submitted_at":"2017-02-24T17:01:59Z","abstract_excerpt":"A statistical model assuming a preferential attachment network, which is generated by adding nodes sequentially according to a few simple rules, usually describes real-life networks better than a model assuming, for example, a Bernoulli random graph, in which any two nodes have the same probability of being connected, does. Therefore, to study the propogation of \"infection\" across a social network, we propose a network epidemic model by combining a stochastic epidemic model and a preferential attachment model. A simulation study based on the subsequent Markov Chain Monte Carlo algorithm reveal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07662","kind":"arxiv","version":2},"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":"1702.07662","created_at":"2026-05-18T00:04:37.666404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07662v2","created_at":"2026-05-18T00:04:37.666404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07662","created_at":"2026-05-18T00:04:37.666404+00:00"},{"alias_kind":"pith_short_12","alias_value":"IW7KKDHTAKMV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IW7KKDHTAKMVZ2B3","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IW7KKDHT","created_at":"2026-05-18T12:31:21.493067+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/IW7KKDHTAKMVZ2B3B7IGSNIJLX","json":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX.json","graph_json":"https://pith.science/api/pith-number/IW7KKDHTAKMVZ2B3B7IGSNIJLX/graph.json","events_json":"https://pith.science/api/pith-number/IW7KKDHTAKMVZ2B3B7IGSNIJLX/events.json","paper":"https://pith.science/paper/IW7KKDHT"},"agent_actions":{"view_html":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX","download_json":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX.json","view_paper":"https://pith.science/paper/IW7KKDHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07662&json=true","fetch_graph":"https://pith.science/api/pith-number/IW7KKDHTAKMVZ2B3B7IGSNIJLX/graph.json","fetch_events":"https://pith.science/api/pith-number/IW7KKDHTAKMVZ2B3B7IGSNIJLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX/action/storage_attestation","attest_author":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX/action/author_attestation","sign_citation":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX/action/citation_signature","submit_replication":"https://pith.science/pith/IW7KKDHTAKMVZ2B3B7IGSNIJLX/action/replication_record"}},"created_at":"2026-05-18T00:04:37.666404+00:00","updated_at":"2026-05-18T00:04:37.666404+00:00"}