{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IJ6E74A5AZINAIIKGUI3OQECAH","short_pith_number":"pith:IJ6E74A5","schema_version":"1.0","canonical_sha256":"427c4ff01d0650d0210a3511b7408201e9103ce23d6989c03e40704cba89a194","source":{"kind":"arxiv","id":"1110.3723","version":1},"attestation_state":"computed","paper":{"title":"Exact and approximate epidemic models on networks: a new, improved closure relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"math.DS","authors_text":"Istvan Z. Kiss, P\\'eter L. Simon","submitted_at":"2011-10-17T16:31:23Z","abstract_excerpt":"Recently, research that focuses on the rigorous understanding of the relation between simulation and/or exact models on graphs and approximate counterparts has gained lots of momentum. This includes revisiting the performance of classic pairwise models with closures at the level of pairs and/or triples as well as effective-degree-type models and those based on the probability generating function formalism. In this paper, for a fully connected graph and the simple $SIS$ (susceptible-infected-susceptible) epidemic model, a novel closure is introduced. This is done via using the equations for the"},"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":"1110.3723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-10-17T16:31:23Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"c591c4d80cb99ea05719430976dd4a3c42a926d99334fc331909dcc7e96d7acb","abstract_canon_sha256":"88e064adb65380805b085926881a2b0cd347720c81fa5cfc4f1f6fa51c4a9009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:48.628281Z","signature_b64":"XU34O5T231ysgfBkzG+MmCczmE7XWkHjwKTP5r1lujTE5UGUFAhLU4MX8FYe+xYqDURtpMA+LlUyOZZcC0uqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427c4ff01d0650d0210a3511b7408201e9103ce23d6989c03e40704cba89a194","last_reissued_at":"2026-05-18T04:10:48.627900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:48.627900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and approximate epidemic models on networks: a new, improved closure relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"math.DS","authors_text":"Istvan Z. Kiss, P\\'eter L. Simon","submitted_at":"2011-10-17T16:31:23Z","abstract_excerpt":"Recently, research that focuses on the rigorous understanding of the relation between simulation and/or exact models on graphs and approximate counterparts has gained lots of momentum. This includes revisiting the performance of classic pairwise models with closures at the level of pairs and/or triples as well as effective-degree-type models and those based on the probability generating function formalism. In this paper, for a fully connected graph and the simple $SIS$ (susceptible-infected-susceptible) epidemic model, a novel closure is introduced. This is done via using the equations for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3723","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":"1110.3723","created_at":"2026-05-18T04:10:48.627956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3723v1","created_at":"2026-05-18T04:10:48.627956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3723","created_at":"2026-05-18T04:10:48.627956+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJ6E74A5AZIN","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJ6E74A5AZINAIIK","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJ6E74A5","created_at":"2026-05-18T12:26:30.835961+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/IJ6E74A5AZINAIIKGUI3OQECAH","json":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH.json","graph_json":"https://pith.science/api/pith-number/IJ6E74A5AZINAIIKGUI3OQECAH/graph.json","events_json":"https://pith.science/api/pith-number/IJ6E74A5AZINAIIKGUI3OQECAH/events.json","paper":"https://pith.science/paper/IJ6E74A5"},"agent_actions":{"view_html":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH","download_json":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH.json","view_paper":"https://pith.science/paper/IJ6E74A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3723&json=true","fetch_graph":"https://pith.science/api/pith-number/IJ6E74A5AZINAIIKGUI3OQECAH/graph.json","fetch_events":"https://pith.science/api/pith-number/IJ6E74A5AZINAIIKGUI3OQECAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH/action/storage_attestation","attest_author":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH/action/author_attestation","sign_citation":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH/action/citation_signature","submit_replication":"https://pith.science/pith/IJ6E74A5AZINAIIKGUI3OQECAH/action/replication_record"}},"created_at":"2026-05-18T04:10:48.627956+00:00","updated_at":"2026-05-18T04:10:48.627956+00:00"}