{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SMMKDRGJFV3O7FF2SZCRHMKSIA","short_pith_number":"pith:SMMKDRGJ","schema_version":"1.0","canonical_sha256":"9318a1c4c92d76ef94ba964513b152402d03ab403520eb8ae7438124dc6128ef","source":{"kind":"arxiv","id":"2502.15274","version":1},"attestation_state":"computed","paper":{"title":"Temporal connectivity of Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anna Brandenberger, C\\'eline Kerriou, G\\'abor Lugosi, Rivka Mitchell, Serte Donderwinkel","submitted_at":"2025-02-21T08:00:59Z","abstract_excerpt":"A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps indicate the propagation of information. We determine a threshold for the existence of monotone increasing paths between all pairs of vertices in temporal random geometric graphs. The results reveal that temporal connectivity appears at a significantly larger edge density than simple connectivity of the underlying random geometric graph. This is in contrast with E"},"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":"2502.15274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-21T08:00:59Z","cross_cats_sorted":[],"title_canon_sha256":"ec4acd1947320c1629722af6b9dedc489e471c974b2ca33fd70daa79138813ff","abstract_canon_sha256":"badf1f5d16777f0336655e8ca87aa4aefe6e4e27a0b02d8def6877b90b5f5afd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:59.043087Z","signature_b64":"/Smrrersj+E9W72dtft4hsp7Pfr8vv1RS3fHnpmxYsw+z/JUyTiqjIkcP9iq/tjnsiYTjr5j8CZKDQnbKN9xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9318a1c4c92d76ef94ba964513b152402d03ab403520eb8ae7438124dc6128ef","last_reissued_at":"2026-07-05T10:17:59.042622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:59.042622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal connectivity of Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anna Brandenberger, C\\'eline Kerriou, G\\'abor Lugosi, Rivka Mitchell, Serte Donderwinkel","submitted_at":"2025-02-21T08:00:59Z","abstract_excerpt":"A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps indicate the propagation of information. We determine a threshold for the existence of monotone increasing paths between all pairs of vertices in temporal random geometric graphs. The results reveal that temporal connectivity appears at a significantly larger edge density than simple connectivity of the underlying random geometric graph. This is in contrast with E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15274","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/2502.15274/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":"2502.15274","created_at":"2026-07-05T10:17:59.042699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15274v1","created_at":"2026-07-05T10:17:59.042699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15274","created_at":"2026-07-05T10:17:59.042699+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMMKDRGJFV3O","created_at":"2026-07-05T10:17:59.042699+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMMKDRGJFV3O7FF2","created_at":"2026-07-05T10:17:59.042699+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMMKDRGJ","created_at":"2026-07-05T10:17:59.042699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":147,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA","json":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA.json","graph_json":"https://pith.science/api/pith-number/SMMKDRGJFV3O7FF2SZCRHMKSIA/graph.json","events_json":"https://pith.science/api/pith-number/SMMKDRGJFV3O7FF2SZCRHMKSIA/events.json","paper":"https://pith.science/paper/SMMKDRGJ"},"agent_actions":{"view_html":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA","download_json":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA.json","view_paper":"https://pith.science/paper/SMMKDRGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15274&json=true","fetch_graph":"https://pith.science/api/pith-number/SMMKDRGJFV3O7FF2SZCRHMKSIA/graph.json","fetch_events":"https://pith.science/api/pith-number/SMMKDRGJFV3O7FF2SZCRHMKSIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA/action/storage_attestation","attest_author":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA/action/author_attestation","sign_citation":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA/action/citation_signature","submit_replication":"https://pith.science/pith/SMMKDRGJFV3O7FF2SZCRHMKSIA/action/replication_record"}},"created_at":"2026-07-05T10:17:59.042699+00:00","updated_at":"2026-07-05T10:17:59.042699+00:00"}