{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IUKPALDJQHZ5J64MGSEHRBO5QN","short_pith_number":"pith:IUKPALDJ","canonical_record":{"source":{"id":"1210.3277","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-11T15:51:25Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"ac0b09d090b5a6a99dd2855ee7b8a39bd7315f80323c73edaed18a78bd31249f","abstract_canon_sha256":"e65c9eaa99b45a0059e279fcd500c9fac11f7bf24dd185dea87ed8d41c38cfb8"},"schema_version":"1.0"},"canonical_sha256":"4514f02c6981f3d4fb8c34887885dd834fc482b379c5f4c9ad3ee2eb4b677110","source":{"kind":"arxiv","id":"1210.3277","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3277","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3277v5","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3277","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"pith_short_12","alias_value":"IUKPALDJQHZ5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUKPALDJQHZ5J64M","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUKPALDJ","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IUKPALDJQHZ5J64MGSEHRBO5QN","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3277","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-11T15:51:25Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"ac0b09d090b5a6a99dd2855ee7b8a39bd7315f80323c73edaed18a78bd31249f","abstract_canon_sha256":"e65c9eaa99b45a0059e279fcd500c9fac11f7bf24dd185dea87ed8d41c38cfb8"},"schema_version":"1.0"},"canonical_sha256":"4514f02c6981f3d4fb8c34887885dd834fc482b379c5f4c9ad3ee2eb4b677110","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:08.619546Z","signature_b64":"1o+jeB1odOIpHv/fzF4pPrPC0wDIqQT7D4KOHNiIq5zj3ecEfR+Jx2xiK3G2yYioZVUP9Fy+gmG9Tf2s8OUCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4514f02c6981f3d4fb8c34887885dd834fc482b379c5f4c9ad3ee2eb4b677110","last_reissued_at":"2026-05-18T02:44:08.618967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:08.618967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3277","source_version":5,"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-18T02:44:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qr384KQN7v1GLj1JiXzXH23JUML43ah4ZcYfP9E0ucSclaGLwm/DVTLWlFXt644xyhYgfWn587b1q1ppbGAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:22:11.731367Z"},"content_sha256":"fae4d4fff476f784c9f33e294d73727372939e0bb471c3c490bb83b8733734ed","schema_version":"1.0","event_id":"sha256:fae4d4fff476f784c9f33e294d73727372939e0bb471c3c490bb83b8733734ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IUKPALDJQHZ5J64MGSEHRBO5QN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Bernard Mans, Nicola Santoro, Paola Flocchini","submitted_at":"2012-10-11T15:51:25Z","abstract_excerpt":"Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet, connectivity in these networks can be established over time and space, based on temporal analogues of multi-hop paths (also called {\\em journeys}). Attempting to optimize the selection of the journeys in these networks naturally leads to the study of three cases: shortest (minimum hop), fastest (minimum duration), and foremost (earliest arrival) journeys. Efficient centralized algorithms exists to compute all cases, when the full knowledge of the network evolution is given.\n  In this paper, we study the {\\em dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3277","kind":"arxiv","version":5},"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-18T02:44:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuwSJ0uC4KGuXuxh3MmQzRSPNrOUwVn9tiS4K+tB5ChqZAxOUHuNKCPo2rMzeJX4G+lKm5YoqYhiEGlcSl5BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:22:11.731716Z"},"content_sha256":"5d9329f3b4514f8b63b99e0175c39a7f9853cd5be89e0081e0f94f0c01b329a6","schema_version":"1.0","event_id":"sha256:5d9329f3b4514f8b63b99e0175c39a7f9853cd5be89e0081e0f94f0c01b329a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/bundle.json","state_url":"https://pith.science/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/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-03T09:22:11Z","links":{"resolver":"https://pith.science/pith/IUKPALDJQHZ5J64MGSEHRBO5QN","bundle":"https://pith.science/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/bundle.json","state":"https://pith.science/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUKPALDJQHZ5J64MGSEHRBO5QN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IUKPALDJQHZ5J64MGSEHRBO5QN","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":"e65c9eaa99b45a0059e279fcd500c9fac11f7bf24dd185dea87ed8d41c38cfb8","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-11T15:51:25Z","title_canon_sha256":"ac0b09d090b5a6a99dd2855ee7b8a39bd7315f80323c73edaed18a78bd31249f"},"schema_version":"1.0","source":{"id":"1210.3277","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3277","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3277v5","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3277","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"pith_short_12","alias_value":"IUKPALDJQHZ5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUKPALDJQHZ5J64M","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUKPALDJ","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:5d9329f3b4514f8b63b99e0175c39a7f9853cd5be89e0081e0f94f0c01b329a6","target":"graph","created_at":"2026-05-18T02:44:08Z","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":"Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet, connectivity in these networks can be established over time and space, based on temporal analogues of multi-hop paths (also called {\\em journeys}). Attempting to optimize the selection of the journeys in these networks naturally leads to the study of three cases: shortest (minimum hop), fastest (minimum duration), and foremost (earliest arrival) journeys. Efficient centralized algorithms exists to compute all cases, when the full knowledge of the network evolution is given.\n  In this paper, we study the {\\em dis","authors_text":"Arnaud Casteigts, Bernard Mans, Nicola Santoro, Paola Flocchini","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-11T15:51:25Z","title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3277","kind":"arxiv","version":5},"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:fae4d4fff476f784c9f33e294d73727372939e0bb471c3c490bb83b8733734ed","target":"record","created_at":"2026-05-18T02:44:08Z","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":"e65c9eaa99b45a0059e279fcd500c9fac11f7bf24dd185dea87ed8d41c38cfb8","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-11T15:51:25Z","title_canon_sha256":"ac0b09d090b5a6a99dd2855ee7b8a39bd7315f80323c73edaed18a78bd31249f"},"schema_version":"1.0","source":{"id":"1210.3277","kind":"arxiv","version":5}},"canonical_sha256":"4514f02c6981f3d4fb8c34887885dd834fc482b379c5f4c9ad3ee2eb4b677110","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4514f02c6981f3d4fb8c34887885dd834fc482b379c5f4c9ad3ee2eb4b677110","first_computed_at":"2026-05-18T02:44:08.618967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:08.618967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1o+jeB1odOIpHv/fzF4pPrPC0wDIqQT7D4KOHNiIq5zj3ecEfR+Jx2xiK3G2yYioZVUP9Fy+gmG9Tf2s8OUCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:08.619546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3277","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae4d4fff476f784c9f33e294d73727372939e0bb471c3c490bb83b8733734ed","sha256:5d9329f3b4514f8b63b99e0175c39a7f9853cd5be89e0081e0f94f0c01b329a6"],"state_sha256":"f5d18c38ca155427ddbe91fa610b4cf424c394eaaa6e96d05ae0b235d588e507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YwTZL9D+jyN+uEbMal4DgllQ6NClQ6eDuxY1nHhLzfr6tKjpc9P9a6Czc+Rn95Oo7cnqP7aXAGMzy/HJO1JDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:22:11.733697Z","bundle_sha256":"85283a1fae48f5564042f8c0e0ebe0f99fccba95c01e7596c057f71cb0b068bb"}}