{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LZ2TV4ACSCX73NRCPKK4FAR5IF","short_pith_number":"pith:LZ2TV4AC","canonical_record":{"source":{"id":"1907.02146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-03T22:13:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e3e6774051df2a84c0f95b6101bc63c0c24471731b8c9d5da0b3d3c848325963","abstract_canon_sha256":"91fecea4f879aba7e4eb8a992b9f531bf17908cedb7692fd5ab560a1ca517c6d"},"schema_version":"1.0"},"canonical_sha256":"5e753af00290affdb6227a95c2823d4161b97e2aa737d8e0f35547db3efa730f","source":{"kind":"arxiv","id":"1907.02146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02146","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02146v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02146","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"LZ2TV4ACSCX7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZ2TV4ACSCX73NRC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZ2TV4AC","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LZ2TV4ACSCX73NRCPKK4FAR5IF","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-03T22:13:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e3e6774051df2a84c0f95b6101bc63c0c24471731b8c9d5da0b3d3c848325963","abstract_canon_sha256":"91fecea4f879aba7e4eb8a992b9f531bf17908cedb7692fd5ab560a1ca517c6d"},"schema_version":"1.0"},"canonical_sha256":"5e753af00290affdb6227a95c2823d4161b97e2aa737d8e0f35547db3efa730f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.723016Z","signature_b64":"plYRQppgzoYs4XB76F8ijwPGzhtlbtNqmCAoJLM2w3dL93TYiKyXe5V5anNqnYWUsGFxczEIGdbLeAs+DjZfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e753af00290affdb6227a95c2823d4161b97e2aa737d8e0f35547db3efa730f","last_reissued_at":"2026-05-17T23:41:29.722335Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.722335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02146","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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Cu59rBwod8mzZ3BEtW1vHqgaj+1IQ3IO5Dv8ckBy4gR6XC+2oOMRjFvqVU0W0kcq5wyo0qgIWR/UU043IHUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:19:46.459975Z"},"content_sha256":"c474f80bb1bdca193a3f45511ec2e048c4085fdbdae26e17e702b8160c407ccd","schema_version":"1.0","event_id":"sha256:c474f80bb1bdca193a3f45511ec2e048c4085fdbdae26e17e702b8160c407ccd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LZ2TV4ACSCX73NRCPKK4FAR5IF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On computing distances and latencies in Link Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SI","authors_text":"Fr\\'ed\\'eric Simard","submitted_at":"2019-07-03T22:13:08Z","abstract_excerpt":"Link Streams were proposed a few years ago as a model of temporal networks. We seek to understand the topological and temporal nature of those objects through efficiently computing the distances, latencies and lengths of shortest fastest paths. We develop different algorithms to compute those values efficiently. Proofs of correctness for those methods are presented as well as bounds on their temporal complexities as functions of link stream parameters. One purpose of this study is to help develop algorithms to compute centrality functions on link streams such as the betweenness centrality and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02146","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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txkh9ISyATSPvEEfjkXljXa/SBYfpZYqRPU5bZsDKfLLR0VEaoZC5NngL+qY79W9rTvD/gQJ08WfgXZqD0bnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:19:46.460639Z"},"content_sha256":"864dc3ca257e5f056e9f7c8191073f14d0264ea2174c2b4ee978c514e36397b8","schema_version":"1.0","event_id":"sha256:864dc3ca257e5f056e9f7c8191073f14d0264ea2174c2b4ee978c514e36397b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/bundle.json","state_url":"https://pith.science/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/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-06-07T00:19:46Z","links":{"resolver":"https://pith.science/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF","bundle":"https://pith.science/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/bundle.json","state":"https://pith.science/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ2TV4ACSCX73NRCPKK4FAR5IF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LZ2TV4ACSCX73NRCPKK4FAR5IF","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":"91fecea4f879aba7e4eb8a992b9f531bf17908cedb7692fd5ab560a1ca517c6d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-03T22:13:08Z","title_canon_sha256":"e3e6774051df2a84c0f95b6101bc63c0c24471731b8c9d5da0b3d3c848325963"},"schema_version":"1.0","source":{"id":"1907.02146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02146","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02146v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02146","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"LZ2TV4ACSCX7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZ2TV4ACSCX73NRC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZ2TV4AC","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:864dc3ca257e5f056e9f7c8191073f14d0264ea2174c2b4ee978c514e36397b8","target":"graph","created_at":"2026-05-17T23:41:29Z","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":"Link Streams were proposed a few years ago as a model of temporal networks. We seek to understand the topological and temporal nature of those objects through efficiently computing the distances, latencies and lengths of shortest fastest paths. We develop different algorithms to compute those values efficiently. Proofs of correctness for those methods are presented as well as bounds on their temporal complexities as functions of link stream parameters. One purpose of this study is to help develop algorithms to compute centrality functions on link streams such as the betweenness centrality and ","authors_text":"Fr\\'ed\\'eric Simard","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-03T22:13:08Z","title":"On computing distances and latencies in Link Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02146","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:c474f80bb1bdca193a3f45511ec2e048c4085fdbdae26e17e702b8160c407ccd","target":"record","created_at":"2026-05-17T23:41:29Z","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":"91fecea4f879aba7e4eb8a992b9f531bf17908cedb7692fd5ab560a1ca517c6d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-03T22:13:08Z","title_canon_sha256":"e3e6774051df2a84c0f95b6101bc63c0c24471731b8c9d5da0b3d3c848325963"},"schema_version":"1.0","source":{"id":"1907.02146","kind":"arxiv","version":1}},"canonical_sha256":"5e753af00290affdb6227a95c2823d4161b97e2aa737d8e0f35547db3efa730f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e753af00290affdb6227a95c2823d4161b97e2aa737d8e0f35547db3efa730f","first_computed_at":"2026-05-17T23:41:29.722335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.722335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"plYRQppgzoYs4XB76F8ijwPGzhtlbtNqmCAoJLM2w3dL93TYiKyXe5V5anNqnYWUsGFxczEIGdbLeAs+DjZfAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.723016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c474f80bb1bdca193a3f45511ec2e048c4085fdbdae26e17e702b8160c407ccd","sha256:864dc3ca257e5f056e9f7c8191073f14d0264ea2174c2b4ee978c514e36397b8"],"state_sha256":"b028b7b882dff3efea28d3c0d2f738d780cb8e004f5b15a121dd0de07a05204e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsgYoseJCqbOqFLCiGrj2W1RQQ39e9tlt/GnFROXn/+WU8MbwmJP/0cr0gQKkx1IwT4zK2UN5CL2bE0fig33CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:19:46.463910Z","bundle_sha256":"260d0651313b7b0b1280b347179e0916c7e2924457b426fedd6bdd345fd44d06"}}