{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CMBFLKAGIHHAGCLWAQLMEQ7MZE","short_pith_number":"pith:CMBFLKAG","canonical_record":{"source":{"id":"2506.04386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T19:00:14Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"016666ade509bfc1273a8abc00677eecbafb37274c1206a71f9094fa908fbf9b","abstract_canon_sha256":"e86d7375fc9d3ad6af5c7d7deedb62f83b72e67db1ddf8cb7e10d7fde3f00bc1"},"schema_version":"1.0"},"canonical_sha256":"130255a80641ce0309760416c243ecc92e60cd1b228684fee30489f087783865","source":{"kind":"arxiv","id":"2506.04386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04386","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04386v1","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04386","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"CMBFLKAGIHHA","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_16","alias_value":"CMBFLKAGIHHAGCLW","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_8","alias_value":"CMBFLKAG","created_at":"2026-07-05T11:16:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CMBFLKAGIHHAGCLWAQLMEQ7MZE","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T19:00:14Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"016666ade509bfc1273a8abc00677eecbafb37274c1206a71f9094fa908fbf9b","abstract_canon_sha256":"e86d7375fc9d3ad6af5c7d7deedb62f83b72e67db1ddf8cb7e10d7fde3f00bc1"},"schema_version":"1.0"},"canonical_sha256":"130255a80641ce0309760416c243ecc92e60cd1b228684fee30489f087783865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:13.667691Z","signature_b64":"kpYR4g94/j2Tu+aUfDumqgTBXsFE6Uca8S4ZLL/uijeqLdjiOkdlYwW8vEWd7jyzVLEBRf4M0M/+VZC1pFskDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"130255a80641ce0309760416c243ecc92e60cd1b228684fee30489f087783865","last_reissued_at":"2026-07-05T11:16:13.667222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:13.667222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04386","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBKb85sdR9Z+jbyFjJD1Z8v8x7sHIL8Wz89sMpcms7X5JFaB/6cTzjUklgkreZExSUyemVwsUBVpzQ9Q+O38Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:47:35.448842Z"},"content_sha256":"9ec41a1de01266cc5a664097adadeaad7224708e22f62dac624bf9a5c49e6b09","schema_version":"1.0","event_id":"sha256:9ec41a1de01266cc5a664097adadeaad7224708e22f62dac624bf9a5c49e6b09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CMBFLKAGIHHAGCLWAQLMEQ7MZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rumors on evolving graphs through stationary times","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Vicenzo Bonasorte","submitted_at":"2025-06-04T19:00:14Z","abstract_excerpt":"We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the information is propagated to neighbors of the informed vertices, in the $k$-th generated random graph. The way this information propagates from vertex to vertex at each step will depend on the ``protocol\". We provide a method based on strong stationary times to study the completion time when the graphs are Markovian time dependent, using known results of the literat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04386","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/2506.04386/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fytLzMUPxcfHZzPAXDjtJyhtJHzIRags618jdnD3/mESVZdu3Qr6eqgXJwqn3HkpouHpWCe30ypZBQU/CMuaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:47:35.449359Z"},"content_sha256":"26d98595189a36e7f302fa4470637d1065b7d3725f6728a3ad8204c3134831b0","schema_version":"1.0","event_id":"sha256:26d98595189a36e7f302fa4470637d1065b7d3725f6728a3ad8204c3134831b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/bundle.json","state_url":"https://pith.science/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T23:47:35Z","links":{"resolver":"https://pith.science/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE","bundle":"https://pith.science/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/bundle.json","state":"https://pith.science/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMBFLKAGIHHAGCLWAQLMEQ7MZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CMBFLKAGIHHAGCLWAQLMEQ7MZE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e86d7375fc9d3ad6af5c7d7deedb62f83b72e67db1ddf8cb7e10d7fde3f00bc1","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T19:00:14Z","title_canon_sha256":"016666ade509bfc1273a8abc00677eecbafb37274c1206a71f9094fa908fbf9b"},"schema_version":"1.0","source":{"id":"2506.04386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04386","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04386v1","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04386","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"CMBFLKAGIHHA","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_16","alias_value":"CMBFLKAGIHHAGCLW","created_at":"2026-07-05T11:16:13Z"},{"alias_kind":"pith_short_8","alias_value":"CMBFLKAG","created_at":"2026-07-05T11:16:13Z"}],"graph_snapshots":[{"event_id":"sha256:26d98595189a36e7f302fa4470637d1065b7d3725f6728a3ad8204c3134831b0","target":"graph","created_at":"2026-07-05T11:16:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.04386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the information is propagated to neighbors of the informed vertices, in the $k$-th generated random graph. The way this information propagates from vertex to vertex at each step will depend on the ``protocol\". We provide a method based on strong stationary times to study the completion time when the graphs are Markovian time dependent, using known results of the literat","authors_text":"Vicenzo Bonasorte","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T19:00:14Z","title":"Rumors on evolving graphs through stationary times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04386","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9ec41a1de01266cc5a664097adadeaad7224708e22f62dac624bf9a5c49e6b09","target":"record","created_at":"2026-07-05T11:16:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e86d7375fc9d3ad6af5c7d7deedb62f83b72e67db1ddf8cb7e10d7fde3f00bc1","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T19:00:14Z","title_canon_sha256":"016666ade509bfc1273a8abc00677eecbafb37274c1206a71f9094fa908fbf9b"},"schema_version":"1.0","source":{"id":"2506.04386","kind":"arxiv","version":1}},"canonical_sha256":"130255a80641ce0309760416c243ecc92e60cd1b228684fee30489f087783865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"130255a80641ce0309760416c243ecc92e60cd1b228684fee30489f087783865","first_computed_at":"2026-07-05T11:16:13.667222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:13.667222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kpYR4g94/j2Tu+aUfDumqgTBXsFE6Uca8S4ZLL/uijeqLdjiOkdlYwW8vEWd7jyzVLEBRf4M0M/+VZC1pFskDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:13.667691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ec41a1de01266cc5a664097adadeaad7224708e22f62dac624bf9a5c49e6b09","sha256:26d98595189a36e7f302fa4470637d1065b7d3725f6728a3ad8204c3134831b0"],"state_sha256":"a3543be99523828aaf3ddab2f4d90c230fabc1f31ce51d7400de918f579ec10c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUhhsyOYtEVcvAT5Ssd10kUWgIDt6h7noMUc35ldXQz803ITWJtMBi2zyIi+xMKJyjE4uan9G67yFchdd23cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:47:35.454674Z","bundle_sha256":"0e10e3facb896acccc47fb5a9c62d2689796b84d79cbb63b85c2866604f9bd42"}}