{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MBSEEDAMAUE776QWVMHHZG3PJ4","short_pith_number":"pith:MBSEEDAM","schema_version":"1.0","canonical_sha256":"6064420c0c0509fffa16ab0e7c9b6f4f3118f22f1f8eb48f4b3ca3bd66279c7a","source":{"kind":"arxiv","id":"2409.12710","version":1},"attestation_state":"computed","paper":{"title":"Age of gossip from connective properties via first passage percolation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Marcus Michelen, Thomas Jacob Maranzatto","submitted_at":"2024-09-19T12:35:40Z","abstract_excerpt":"In gossip networks, a source node forwards time-stamped updates to a network of observers according to a Poisson process. The observers then update each other on this information according to Poisson processes as well. The Age of Information (AoI) of a given node is the difference between the current time and the most recent time-stamp of source information that the node has received.\n  We provide a method for evaluating the AoI of a node in terms of first passage percolation. We then use this distributional identity to prove matching upper and lower bounds on the AoI in terms of connectivity "},"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":"2409.12710","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-09-19T12:35:40Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"cc7808cc53b007ef3df62499db8ee2dcbc620e5868500b896d5a0ba54d1c71f7","abstract_canon_sha256":"81880051466e22506d7957f1734c33ad5c87428cdc3c82ac44ec4c2c5f29306b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:11.025280Z","signature_b64":"Zgj1tP4ZZtPlFU5Oys15tRA9Lsyrr9h03Pd40K8YFPtlfQRkpWbkxSzYOOsAQxJozN9/YKjWbN/ka9GOylvRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6064420c0c0509fffa16ab0e7c9b6f4f3118f22f1f8eb48f4b3ca3bd66279c7a","last_reissued_at":"2026-07-05T09:09:11.024830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:11.024830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Age of gossip from connective properties via first passage percolation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Marcus Michelen, Thomas Jacob Maranzatto","submitted_at":"2024-09-19T12:35:40Z","abstract_excerpt":"In gossip networks, a source node forwards time-stamped updates to a network of observers according to a Poisson process. The observers then update each other on this information according to Poisson processes as well. The Age of Information (AoI) of a given node is the difference between the current time and the most recent time-stamp of source information that the node has received.\n  We provide a method for evaluating the AoI of a node in terms of first passage percolation. We then use this distributional identity to prove matching upper and lower bounds on the AoI in terms of connectivity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12710","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/2409.12710/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":"2409.12710","created_at":"2026-07-05T09:09:11.024886+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12710v1","created_at":"2026-07-05T09:09:11.024886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12710","created_at":"2026-07-05T09:09:11.024886+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBSEEDAMAUE7","created_at":"2026-07-05T09:09:11.024886+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBSEEDAMAUE776QW","created_at":"2026-07-05T09:09:11.024886+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBSEEDAM","created_at":"2026-07-05T09:09:11.024886+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13086","citing_title":"Information Degradation and Misinformation in Gossip Networks","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4","json":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4.json","graph_json":"https://pith.science/api/pith-number/MBSEEDAMAUE776QWVMHHZG3PJ4/graph.json","events_json":"https://pith.science/api/pith-number/MBSEEDAMAUE776QWVMHHZG3PJ4/events.json","paper":"https://pith.science/paper/MBSEEDAM"},"agent_actions":{"view_html":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4","download_json":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4.json","view_paper":"https://pith.science/paper/MBSEEDAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12710&json=true","fetch_graph":"https://pith.science/api/pith-number/MBSEEDAMAUE776QWVMHHZG3PJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/MBSEEDAMAUE776QWVMHHZG3PJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4/action/storage_attestation","attest_author":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4/action/author_attestation","sign_citation":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4/action/citation_signature","submit_replication":"https://pith.science/pith/MBSEEDAMAUE776QWVMHHZG3PJ4/action/replication_record"}},"created_at":"2026-07-05T09:09:11.024886+00:00","updated_at":"2026-07-05T09:09:11.024886+00:00"}