{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P4SB4XKZDDFST7COB253E2IBP4","short_pith_number":"pith:P4SB4XKZ","canonical_record":{"source":{"id":"1903.03636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-08T19:22:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"738c545a4c4a9a2cf4f44914b0848f8b5039a95cd6af68885ac2700816b65044","abstract_canon_sha256":"ba3e5273f6f33a9b275fb1a2e3d575763db4720d707ee8cf00e2d4021f96f9f6"},"schema_version":"1.0"},"canonical_sha256":"7f241e5d5918cb29fc4e0ebbb269017f2da6d38b9419f42842fb3f05be12ca88","source":{"kind":"arxiv","id":"1903.03636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03636","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03636v1","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03636","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4SB4XKZDDFS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P4SB4XKZDDFST7CO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P4SB4XKZ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P4SB4XKZDDFST7COB253E2IBP4","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-08T19:22:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"738c545a4c4a9a2cf4f44914b0848f8b5039a95cd6af68885ac2700816b65044","abstract_canon_sha256":"ba3e5273f6f33a9b275fb1a2e3d575763db4720d707ee8cf00e2d4021f96f9f6"},"schema_version":"1.0"},"canonical_sha256":"7f241e5d5918cb29fc4e0ebbb269017f2da6d38b9419f42842fb3f05be12ca88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:38.809419Z","signature_b64":"xmJ7aamhWGztJvHRLi8bYajRa7fTLB3HirkoSIqpEAclvBTs6JxyB8FC+DSzALgQ0VtoC9KStNYTX0W/6GeqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f241e5d5918cb29fc4e0ebbb269017f2da6d38b9419f42842fb3f05be12ca88","last_reissued_at":"2026-05-17T23:51:38.808794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:38.808794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03636","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-05-17T23:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8euuXLClCx073f57IuPZayGYuAPfNZeW1u+U3IIr/VGPBIr/kPM/QJGLI2JyJHcqZVWF+LcdzktkskYhsVxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:13:07.939967Z"},"content_sha256":"12368621a7cd6fc395f2a079493b9fcdd8dac88e9330a5768edf3746d7f90a02","schema_version":"1.0","event_id":"sha256:12368621a7cd6fc395f2a079493b9fcdd8dac88e9330a5768edf3746d7f90a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P4SB4XKZDDFST7COB253E2IBP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How fast can we reach a target vertex in stochastic temporal graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christoforos Raptopoulos, Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Sotiris Nikoletseas, Viktor Zamaraev","submitted_at":"2019-03-08T19:22:56Z","abstract_excerpt":"Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph $G=(V,E)$, a temporal graph on $G$ is a sequence of snapshots $G_t$, one for each time step $t\\geq 1$. In this paper we study stochastic temporal graphs, i.e. stochastic processes $\\mathcal{G}$ whose random variables are the snapshots of a temporal graph on $G$. A natural feature observed in various real-life scenarios is a memory effect in the appearance probabilities of particular edges; i.e. the probability an edge $e\\in E$ appears at time step $t$ depends o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03636","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":""},"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-05-17T23:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iFmgwUtmCwSwZF+jlP+CfX0tJ7dTGCPoqg8iH+f0vwIEhh1UM2QUCVACjWazD6NtvRY8NNqX4jzp6pOdbhXRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:13:07.940581Z"},"content_sha256":"920ef4ff5a8fb7c2497c3233eab926d1f03597423ea2309cfdde59f01e801055","schema_version":"1.0","event_id":"sha256:920ef4ff5a8fb7c2497c3233eab926d1f03597423ea2309cfdde59f01e801055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4SB4XKZDDFST7COB253E2IBP4/bundle.json","state_url":"https://pith.science/pith/P4SB4XKZDDFST7COB253E2IBP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4SB4XKZDDFST7COB253E2IBP4/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-05-31T01:13:07Z","links":{"resolver":"https://pith.science/pith/P4SB4XKZDDFST7COB253E2IBP4","bundle":"https://pith.science/pith/P4SB4XKZDDFST7COB253E2IBP4/bundle.json","state":"https://pith.science/pith/P4SB4XKZDDFST7COB253E2IBP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4SB4XKZDDFST7COB253E2IBP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P4SB4XKZDDFST7COB253E2IBP4","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":"ba3e5273f6f33a9b275fb1a2e3d575763db4720d707ee8cf00e2d4021f96f9f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-08T19:22:56Z","title_canon_sha256":"738c545a4c4a9a2cf4f44914b0848f8b5039a95cd6af68885ac2700816b65044"},"schema_version":"1.0","source":{"id":"1903.03636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03636","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03636v1","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03636","created_at":"2026-05-17T23:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4SB4XKZDDFS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P4SB4XKZDDFST7CO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P4SB4XKZ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:920ef4ff5a8fb7c2497c3233eab926d1f03597423ea2309cfdde59f01e801055","target":"graph","created_at":"2026-05-17T23:51:38Z","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"},"paper":{"abstract_excerpt":"Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph $G=(V,E)$, a temporal graph on $G$ is a sequence of snapshots $G_t$, one for each time step $t\\geq 1$. In this paper we study stochastic temporal graphs, i.e. stochastic processes $\\mathcal{G}$ whose random variables are the snapshots of a temporal graph on $G$. A natural feature observed in various real-life scenarios is a memory effect in the appearance probabilities of particular edges; i.e. the probability an edge $e\\in E$ appears at time step $t$ depends o","authors_text":"Christoforos Raptopoulos, Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Sotiris Nikoletseas, Viktor Zamaraev","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-08T19:22:56Z","title":"How fast can we reach a target vertex in stochastic temporal graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03636","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:12368621a7cd6fc395f2a079493b9fcdd8dac88e9330a5768edf3746d7f90a02","target":"record","created_at":"2026-05-17T23:51:38Z","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":"ba3e5273f6f33a9b275fb1a2e3d575763db4720d707ee8cf00e2d4021f96f9f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-08T19:22:56Z","title_canon_sha256":"738c545a4c4a9a2cf4f44914b0848f8b5039a95cd6af68885ac2700816b65044"},"schema_version":"1.0","source":{"id":"1903.03636","kind":"arxiv","version":1}},"canonical_sha256":"7f241e5d5918cb29fc4e0ebbb269017f2da6d38b9419f42842fb3f05be12ca88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f241e5d5918cb29fc4e0ebbb269017f2da6d38b9419f42842fb3f05be12ca88","first_computed_at":"2026-05-17T23:51:38.808794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:38.808794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xmJ7aamhWGztJvHRLi8bYajRa7fTLB3HirkoSIqpEAclvBTs6JxyB8FC+DSzALgQ0VtoC9KStNYTX0W/6GeqCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:38.809419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12368621a7cd6fc395f2a079493b9fcdd8dac88e9330a5768edf3746d7f90a02","sha256:920ef4ff5a8fb7c2497c3233eab926d1f03597423ea2309cfdde59f01e801055"],"state_sha256":"8883003dd55d5ac13fc14b192b42b8dda564913d583a6615a2a152550b998485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgUjwLkAk0YxC26b1YITn4T4JAYe3lqZAJQVzlq1twkO+SfKugVfvo/Rrov6lbmFxp70yaJyZtiGspgHUNFHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:13:07.944220Z","bundle_sha256":"2cb12f7171d5aa6716911dcdd54c444ef52ff0c646dc407138900409026d803b"}}