{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YNCHTLZTV52VRM5VZDJVVRHUSI","short_pith_number":"pith:YNCHTLZT","schema_version":"1.0","canonical_sha256":"c34479af33af7558b3b5c8d35ac4f492328606d4eef07ea9a34b62a35500bb44","source":{"kind":"arxiv","id":"2605.29205","version":1},"attestation_state":"computed","paper":{"title":"Epidemic spreading on multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.soc-ph","authors_text":"Francisco A. Rodrigues, Paulo H. Lorenzoni, Silvio C. Ferreira, Wesley Cota","submitted_at":"2026-05-28T00:35:46Z","abstract_excerpt":"Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served as a benchmark for validating theoretical approaches to dynamical processes on networks. However, generating large scale-free networks with degree exponent $\\gamma<3$ introduces uncontrolled disassortative correlations and severe computational limitations due to the prohibition of reconnecting hubs. These constraints do not exist in multigraphs. We investiga"},"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":"2605.29205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2026-05-28T00:35:46Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"595091a18de90145ef4aa6aed86e41b77ec184f29b65a9f450fc6c95bf2d8a54","abstract_canon_sha256":"35f0b3ece83a52d02ee5d984fc7a123c9178470e297b2882aba00d329f495051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:24.200469Z","signature_b64":"zd8l+znab0PA8KonTHEVPf9MUcqNprAZdhvdVdySXz1qD8ttoQtviejc694X9/dx/9QLfoB9S8a7G85nuNyGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34479af33af7558b3b5c8d35ac4f492328606d4eef07ea9a34b62a35500bb44","last_reissued_at":"2026-05-29T01:05:24.199782Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:24.199782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Epidemic spreading on multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.soc-ph","authors_text":"Francisco A. Rodrigues, Paulo H. Lorenzoni, Silvio C. Ferreira, Wesley Cota","submitted_at":"2026-05-28T00:35:46Z","abstract_excerpt":"Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served as a benchmark for validating theoretical approaches to dynamical processes on networks. However, generating large scale-free networks with degree exponent $\\gamma<3$ introduces uncontrolled disassortative correlations and severe computational limitations due to the prohibition of reconnecting hubs. These constraints do not exist in multigraphs. We investiga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.29205","created_at":"2026-05-29T01:05:24.199884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29205v1","created_at":"2026-05-29T01:05:24.199884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29205","created_at":"2026-05-29T01:05:24.199884+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNCHTLZTV52V","created_at":"2026-05-29T01:05:24.199884+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNCHTLZTV52VRM5V","created_at":"2026-05-29T01:05:24.199884+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNCHTLZT","created_at":"2026-05-29T01:05:24.199884+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/YNCHTLZTV52VRM5VZDJVVRHUSI","json":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI.json","graph_json":"https://pith.science/api/pith-number/YNCHTLZTV52VRM5VZDJVVRHUSI/graph.json","events_json":"https://pith.science/api/pith-number/YNCHTLZTV52VRM5VZDJVVRHUSI/events.json","paper":"https://pith.science/paper/YNCHTLZT"},"agent_actions":{"view_html":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI","download_json":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI.json","view_paper":"https://pith.science/paper/YNCHTLZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29205&json=true","fetch_graph":"https://pith.science/api/pith-number/YNCHTLZTV52VRM5VZDJVVRHUSI/graph.json","fetch_events":"https://pith.science/api/pith-number/YNCHTLZTV52VRM5VZDJVVRHUSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI/action/storage_attestation","attest_author":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI/action/author_attestation","sign_citation":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI/action/citation_signature","submit_replication":"https://pith.science/pith/YNCHTLZTV52VRM5VZDJVVRHUSI/action/replication_record"}},"created_at":"2026-05-29T01:05:24.199884+00:00","updated_at":"2026-05-29T01:05:24.199884+00:00"}