{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OTLBCL76HZJWCK2ZHGM5XNBLGR","short_pith_number":"pith:OTLBCL76","canonical_record":{"source":{"id":"2306.11401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-06-20T09:18:04Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ad961b5d0dcd92f78da1c7afd0f6ffeacbe56c84e9863e77a575aa2e5adf9267","abstract_canon_sha256":"6e199f268491ab22746cce8aaf3b31c8eda0c8fc9381587547b149a7cf8cdb5a"},"schema_version":"1.0"},"canonical_sha256":"74d6112ffe3e53612b593999dbb42b34518a953d7b4500ff024b78ab7d8c4d7c","source":{"kind":"arxiv","id":"2306.11401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11401","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11401v1","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11401","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"OTLBCL76HZJW","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"OTLBCL76HZJWCK2Z","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"OTLBCL76","created_at":"2026-07-05T06:22:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OTLBCL76HZJWCK2ZHGM5XNBLGR","target":"record","payload":{"canonical_record":{"source":{"id":"2306.11401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-06-20T09:18:04Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ad961b5d0dcd92f78da1c7afd0f6ffeacbe56c84e9863e77a575aa2e5adf9267","abstract_canon_sha256":"6e199f268491ab22746cce8aaf3b31c8eda0c8fc9381587547b149a7cf8cdb5a"},"schema_version":"1.0"},"canonical_sha256":"74d6112ffe3e53612b593999dbb42b34518a953d7b4500ff024b78ab7d8c4d7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:19.388335Z","signature_b64":"43lRSG0wr0eRWAI/5PRa4OX1Uxf1YwnSEvRcytKGK3c9XhMWPdihn1dcNhPbcQcnSQ1SwEtDHMNF92fvfospBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d6112ffe3e53612b593999dbb42b34518a953d7b4500ff024b78ab7d8c4d7c","last_reissued_at":"2026-07-05T06:22:19.387701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:19.387701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.11401","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-05T06:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v75WPdOyJ2VJASIthE0yqdxcQn+GSo5sQtVheE4z0uIVv/iED3N6vJZgFbxzr7qHBoDNLn1WBZ2FMG/reyHDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:00:45.482138Z"},"content_sha256":"8f9e6ff008ceac3c6e40211e0aa9c0b61817e058222f21029350e5d370bd1ff5","schema_version":"1.0","event_id":"sha256:8f9e6ff008ceac3c6e40211e0aa9c0b61817e058222f21029350e5d370bd1ff5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OTLBCL76HZJWCK2ZHGM5XNBLGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Increasing paths in random temporal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Gabor Lugosi, Nicolas Broutin, Nina Kam\\v{c}ev","submitted_at":"2023-06-20T09:18:04Z","abstract_excerpt":"We consider random temporal graphs, a version of the classical Erd\\H{o}s--R\\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time stamps. We study the asymptotics for the distances in such graphs, mostly in the regime of interest where np is of order log n. We establish the first order asymptotics for the lengths of increasing paths: the lengths of the shortest and longest paths between typical vertices, the maxima of these lengths from a given vertex, as well as the maxima between an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11401","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/2306.11401/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-05T06:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4ESGAvar1vg6eKVKLg+oXIlPi/ywN+zb7dkGAH3Zo1398RBo6LcmG+5VYSaPv5NWvpB4NKjXgR3I3OluOwwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:00:45.482639Z"},"content_sha256":"1f853eaa4557391fcd8dc52dc65ae0e8745c9d8894f40db8f2e74ebf7edb0e74","schema_version":"1.0","event_id":"sha256:1f853eaa4557391fcd8dc52dc65ae0e8745c9d8894f40db8f2e74ebf7edb0e74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/bundle.json","state_url":"https://pith.science/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/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-15T22:00:45Z","links":{"resolver":"https://pith.science/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR","bundle":"https://pith.science/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/bundle.json","state":"https://pith.science/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTLBCL76HZJWCK2ZHGM5XNBLGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OTLBCL76HZJWCK2ZHGM5XNBLGR","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":"6e199f268491ab22746cce8aaf3b31c8eda0c8fc9381587547b149a7cf8cdb5a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-06-20T09:18:04Z","title_canon_sha256":"ad961b5d0dcd92f78da1c7afd0f6ffeacbe56c84e9863e77a575aa2e5adf9267"},"schema_version":"1.0","source":{"id":"2306.11401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11401","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11401v1","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11401","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"OTLBCL76HZJW","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"OTLBCL76HZJWCK2Z","created_at":"2026-07-05T06:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"OTLBCL76","created_at":"2026-07-05T06:22:19Z"}],"graph_snapshots":[{"event_id":"sha256:1f853eaa4557391fcd8dc52dc65ae0e8745c9d8894f40db8f2e74ebf7edb0e74","target":"graph","created_at":"2026-07-05T06:22:19Z","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/2306.11401/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider random temporal graphs, a version of the classical Erd\\H{o}s--R\\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time stamps. We study the asymptotics for the distances in such graphs, mostly in the regime of interest where np is of order log n. We establish the first order asymptotics for the lengths of increasing paths: the lengths of the shortest and longest paths between typical vertices, the maxima of these lengths from a given vertex, as well as the maxima between an","authors_text":"Gabor Lugosi, Nicolas Broutin, Nina Kam\\v{c}ev","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-06-20T09:18:04Z","title":"Increasing paths in random temporal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11401","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:8f9e6ff008ceac3c6e40211e0aa9c0b61817e058222f21029350e5d370bd1ff5","target":"record","created_at":"2026-07-05T06:22:19Z","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":"6e199f268491ab22746cce8aaf3b31c8eda0c8fc9381587547b149a7cf8cdb5a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-06-20T09:18:04Z","title_canon_sha256":"ad961b5d0dcd92f78da1c7afd0f6ffeacbe56c84e9863e77a575aa2e5adf9267"},"schema_version":"1.0","source":{"id":"2306.11401","kind":"arxiv","version":1}},"canonical_sha256":"74d6112ffe3e53612b593999dbb42b34518a953d7b4500ff024b78ab7d8c4d7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74d6112ffe3e53612b593999dbb42b34518a953d7b4500ff024b78ab7d8c4d7c","first_computed_at":"2026-07-05T06:22:19.387701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:22:19.387701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"43lRSG0wr0eRWAI/5PRa4OX1Uxf1YwnSEvRcytKGK3c9XhMWPdihn1dcNhPbcQcnSQ1SwEtDHMNF92fvfospBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:22:19.388335Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.11401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f9e6ff008ceac3c6e40211e0aa9c0b61817e058222f21029350e5d370bd1ff5","sha256:1f853eaa4557391fcd8dc52dc65ae0e8745c9d8894f40db8f2e74ebf7edb0e74"],"state_sha256":"5a6afe0fb8bb6a7e07adfd45035673c58e75ca7888b65edcab8ef6e011e3a532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aACQ7BNQx1b6oq3JoQun74ndkCSibF+RX/BOqg9KcNZcklBVNSxV88Ap5KMXqFlf0oJLPObJucO2kQ9GRm87AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:00:45.487113Z","bundle_sha256":"e34ea5dc81332e0b77a5125fa2477d7b34f2f71b6caf116986a612641b5ff8b0"}}