{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2C4KPFEIIR72I6QJFQFHSUNJNQ","short_pith_number":"pith:2C4KPFEI","schema_version":"1.0","canonical_sha256":"d0b8a79488447fa47a092c0a7951a96c24581ee548721318a90d48a6a3c0616d","source":{"kind":"arxiv","id":"2205.14888","version":4},"attestation_state":"computed","paper":{"title":"Giant Components in Random Temporal Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arnaud Casteigts, Bojana Kodric, Malte Renken, Michael Raskin, Pierluigi Crescenzi, Ruben Becker, Viktor Zamaraev","submitted_at":"2022-05-30T07:05:05Z","abstract_excerpt":"A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erd\\H{o}s-R\\'enyi random graph model. The proposed model is obtained by randomly permuting the edges of an Erd\\H{o}s-R\\'enyi random graph and interpreting this permutation as an ordering of presence times. It was shown that the connectivity threshold in the Erd\\H{o}s-R\\'enyi model fans out into multiple phase transitions for several distinct notions of reachability in the temporal setting.\n  In the present paper, we identify a "},"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":"2205.14888","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2022-05-30T07:05:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"10ac19361969a644511d59b23663886f3c191170092ff582387b88acf8c0be78","abstract_canon_sha256":"64c5b720d8f0175e0889adece77f9da0e57fa28bc0d047defa3d7a983d03cf5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:16.504515Z","signature_b64":"K89JH0t/BQnxaHdCkkKwc212cc03aI+c3VvRg8M/p21aEYYq9fmfeLAvr9XP2iqjx0CbHWaoPuM7xo1lKuvaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0b8a79488447fa47a092c0a7951a96c24581ee548721318a90d48a6a3c0616d","last_reissued_at":"2026-07-05T06:42:16.504007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:16.504007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Giant Components in Random Temporal Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arnaud Casteigts, Bojana Kodric, Malte Renken, Michael Raskin, Pierluigi Crescenzi, Ruben Becker, Viktor Zamaraev","submitted_at":"2022-05-30T07:05:05Z","abstract_excerpt":"A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erd\\H{o}s-R\\'enyi random graph model. The proposed model is obtained by randomly permuting the edges of an Erd\\H{o}s-R\\'enyi random graph and interpreting this permutation as an ordering of presence times. It was shown that the connectivity threshold in the Erd\\H{o}s-R\\'enyi model fans out into multiple phase transitions for several distinct notions of reachability in the temporal setting.\n  In the present paper, we identify a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14888","kind":"arxiv","version":4},"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/2205.14888/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":"2205.14888","created_at":"2026-07-05T06:42:16.504069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14888v4","created_at":"2026-07-05T06:42:16.504069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14888","created_at":"2026-07-05T06:42:16.504069+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C4KPFEIIR72","created_at":"2026-07-05T06:42:16.504069+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C4KPFEIIR72I6QJ","created_at":"2026-07-05T06:42:16.504069+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C4KPFEI","created_at":"2026-07-05T06:42:16.504069+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09488","citing_title":"The temporal stochastic block model","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ","json":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ.json","graph_json":"https://pith.science/api/pith-number/2C4KPFEIIR72I6QJFQFHSUNJNQ/graph.json","events_json":"https://pith.science/api/pith-number/2C4KPFEIIR72I6QJFQFHSUNJNQ/events.json","paper":"https://pith.science/paper/2C4KPFEI"},"agent_actions":{"view_html":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ","download_json":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ.json","view_paper":"https://pith.science/paper/2C4KPFEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14888&json=true","fetch_graph":"https://pith.science/api/pith-number/2C4KPFEIIR72I6QJFQFHSUNJNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2C4KPFEIIR72I6QJFQFHSUNJNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ/action/storage_attestation","attest_author":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ/action/author_attestation","sign_citation":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ/action/citation_signature","submit_replication":"https://pith.science/pith/2C4KPFEIIR72I6QJFQFHSUNJNQ/action/replication_record"}},"created_at":"2026-07-05T06:42:16.504069+00:00","updated_at":"2026-07-05T06:42:16.504069+00:00"}