{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TCO43AROAXWPWH3OM4POOIPTQE","short_pith_number":"pith:TCO43ARO","schema_version":"1.0","canonical_sha256":"989dcd822e05ecfb1f6e671ee721f38113041b410c9992993e9ce35bdcd54797","source":{"kind":"arxiv","id":"2408.01268","version":3},"attestation_state":"computed","paper":{"title":"Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"math.PR","authors_text":"Johannes Lengler, Konstantin Sturm, Kostas Lakis, Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller","submitted_at":"2024-08-02T13:45:13Z","abstract_excerpt":"We study push-pull rumour spreading in ultra-small-world models for social networks where the degrees follow a power-law distribution. In a non-geometric setting, Fountoulakis, Panagiotou and Sauerwald have shown that rumours always spread ultra-fast (SODA 2012), i.e. in doubly logarithmic time. On the other hand, Janssen and Mehrabian have found that rumours spread slowly (polynomial time) in a spatial preferential attachment model (SIDMA 2017). We study the question systematically for the model of Geometric Inhomogeneous Random Graphs (GIRGs). Our results are two-fold: first, with Euclidean "},"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":"2408.01268","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-08-02T13:45:13Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"91dd5361b4d1119c92f11d5b6a16597b8e8a10a55a545ef3aff18c8234a226de","abstract_canon_sha256":"4168a9626d3ceee0f57a51ac10b878ab75f2489c8ea18a9fa6ccf8ac84d24b3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:03.864418Z","signature_b64":"UOsENSc7+ps15hpKehEX9fDNeFUDjdRFMMDsizPrkblyoIWv5hSs0dPjIgZMh9Z0UbQHLO2ChsVHQ2dsNV5/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989dcd822e05ecfb1f6e671ee721f38113041b410c9992993e9ce35bdcd54797","last_reissued_at":"2026-07-05T11:39:03.863948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:03.863948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"math.PR","authors_text":"Johannes Lengler, Konstantin Sturm, Kostas Lakis, Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller","submitted_at":"2024-08-02T13:45:13Z","abstract_excerpt":"We study push-pull rumour spreading in ultra-small-world models for social networks where the degrees follow a power-law distribution. In a non-geometric setting, Fountoulakis, Panagiotou and Sauerwald have shown that rumours always spread ultra-fast (SODA 2012), i.e. in doubly logarithmic time. On the other hand, Janssen and Mehrabian have found that rumours spread slowly (polynomial time) in a spatial preferential attachment model (SIDMA 2017). We study the question systematically for the model of Geometric Inhomogeneous Random Graphs (GIRGs). Our results are two-fold: first, with Euclidean "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01268","kind":"arxiv","version":3},"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/2408.01268/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":"2408.01268","created_at":"2026-07-05T11:39:03.864003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.01268v3","created_at":"2026-07-05T11:39:03.864003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01268","created_at":"2026-07-05T11:39:03.864003+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCO43AROAXWP","created_at":"2026-07-05T11:39:03.864003+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCO43AROAXWPWH3O","created_at":"2026-07-05T11:39:03.864003+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCO43ARO","created_at":"2026-07-05T11:39:03.864003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19485","citing_title":"Expanders in Models of Social Networks","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE","json":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE.json","graph_json":"https://pith.science/api/pith-number/TCO43AROAXWPWH3OM4POOIPTQE/graph.json","events_json":"https://pith.science/api/pith-number/TCO43AROAXWPWH3OM4POOIPTQE/events.json","paper":"https://pith.science/paper/TCO43ARO"},"agent_actions":{"view_html":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE","download_json":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE.json","view_paper":"https://pith.science/paper/TCO43ARO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.01268&json=true","fetch_graph":"https://pith.science/api/pith-number/TCO43AROAXWPWH3OM4POOIPTQE/graph.json","fetch_events":"https://pith.science/api/pith-number/TCO43AROAXWPWH3OM4POOIPTQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE/action/storage_attestation","attest_author":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE/action/author_attestation","sign_citation":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE/action/citation_signature","submit_replication":"https://pith.science/pith/TCO43AROAXWPWH3OM4POOIPTQE/action/replication_record"}},"created_at":"2026-07-05T11:39:03.864003+00:00","updated_at":"2026-07-05T11:39:03.864003+00:00"}