{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CUWYAGLFAFWEUVXLKXNBWR3TYM","short_pith_number":"pith:CUWYAGLF","canonical_record":{"source":{"id":"1303.3660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T02:10:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13b51c24c930b9e24cdac3e93629bbf418aeddcd5f95aea56960829c6819e964","abstract_canon_sha256":"09ed85b6eff6e0909015735c4eddb08114d34ec3889630da8c41490480729e77"},"schema_version":"1.0"},"canonical_sha256":"152d801965016c4a56eb55da1b4773c323754f2ab9b5d30859e334bd9d6e4295","source":{"kind":"arxiv","id":"1303.3660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3660","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3660v1","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3660","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"CUWYAGLFAFWE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CUWYAGLFAFWEUVXL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CUWYAGLF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CUWYAGLFAFWEUVXLKXNBWR3TYM","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T02:10:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13b51c24c930b9e24cdac3e93629bbf418aeddcd5f95aea56960829c6819e964","abstract_canon_sha256":"09ed85b6eff6e0909015735c4eddb08114d34ec3889630da8c41490480729e77"},"schema_version":"1.0"},"canonical_sha256":"152d801965016c4a56eb55da1b4773c323754f2ab9b5d30859e334bd9d6e4295","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:52.741406Z","signature_b64":"eke4vA90oxGWg/Lw1qQoj90mRgLL6llExmg8eB/64fZCuKh2eOxjUTntd1QG1MISrRMyiR3saNpi8FXpHRDzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"152d801965016c4a56eb55da1b4773c323754f2ab9b5d30859e334bd9d6e4295","last_reissued_at":"2026-05-18T03:30:52.740731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:52.740731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3660","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-18T03:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bVmKJ9hrsi/Wmb3jElDxQGs71y/MU9DjbIg1/1fs8+NZutaDiA8kysTVuCrYsd0PBXkk9tfXzRL4NJBqGvWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:38:37.788479Z"},"content_sha256":"f11c1b0be4eb8b6d674ec6fa4962cd4d8e250d88c0cbeeb35414535907924241","schema_version":"1.0","event_id":"sha256:f11c1b0be4eb8b6d674ec6fa4962cd4d8e250d88c0cbeeb35414535907924241"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CUWYAGLFAFWEUVXLKXNBWR3TYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Traversal Times on Dynamic Markovian Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Amotz Bar-Noy, Don Towsley, Feng Yu, Matthew P. Johnson, Philippe Nain, Prithwish Basu","submitted_at":"2013-03-15T02:10:06Z","abstract_excerpt":"In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in dynamic graphs, in which the state of an edge in one time slot (i.e., its presence or absence) is random, and may depend on its state in the previous time step. The traversal time is due to both time spent waiting for edges to appear and time spent crossing them once they become available. We compute the expected traversal time (ETT) for a dynamic path in a numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3660","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-18T03:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmHnUN7DF9jNsfXwweuB0SLCaqj2CCpqTaa1fv+P0ZEYTSiaiYjPbaE9ZxxVk2+pamxJi35xlemXgm77GXwZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:38:37.788835Z"},"content_sha256":"176e9f411522d6c5636c74e89baaa769f5b374e2acef1f78480a688b5d3c75e9","schema_version":"1.0","event_id":"sha256:176e9f411522d6c5636c74e89baaa769f5b374e2acef1f78480a688b5d3c75e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/bundle.json","state_url":"https://pith.science/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/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-19T11:38:37Z","links":{"resolver":"https://pith.science/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM","bundle":"https://pith.science/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/bundle.json","state":"https://pith.science/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUWYAGLFAFWEUVXLKXNBWR3TYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CUWYAGLFAFWEUVXLKXNBWR3TYM","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":"09ed85b6eff6e0909015735c4eddb08114d34ec3889630da8c41490480729e77","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T02:10:06Z","title_canon_sha256":"13b51c24c930b9e24cdac3e93629bbf418aeddcd5f95aea56960829c6819e964"},"schema_version":"1.0","source":{"id":"1303.3660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3660","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3660v1","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3660","created_at":"2026-05-18T03:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"CUWYAGLFAFWE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CUWYAGLFAFWEUVXL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CUWYAGLF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:176e9f411522d6c5636c74e89baaa769f5b374e2acef1f78480a688b5d3c75e9","target":"graph","created_at":"2026-05-18T03:30:52Z","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":"In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in dynamic graphs, in which the state of an edge in one time slot (i.e., its presence or absence) is random, and may depend on its state in the previous time step. The traversal time is due to both time spent waiting for edges to appear and time spent crossing them once they become available. We compute the expected traversal time (ETT) for a dynamic path in a numb","authors_text":"Amotz Bar-Noy, Don Towsley, Feng Yu, Matthew P. Johnson, Philippe Nain, Prithwish Basu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T02:10:06Z","title":"Computing Traversal Times on Dynamic Markovian Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3660","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:f11c1b0be4eb8b6d674ec6fa4962cd4d8e250d88c0cbeeb35414535907924241","target":"record","created_at":"2026-05-18T03:30:52Z","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":"09ed85b6eff6e0909015735c4eddb08114d34ec3889630da8c41490480729e77","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T02:10:06Z","title_canon_sha256":"13b51c24c930b9e24cdac3e93629bbf418aeddcd5f95aea56960829c6819e964"},"schema_version":"1.0","source":{"id":"1303.3660","kind":"arxiv","version":1}},"canonical_sha256":"152d801965016c4a56eb55da1b4773c323754f2ab9b5d30859e334bd9d6e4295","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"152d801965016c4a56eb55da1b4773c323754f2ab9b5d30859e334bd9d6e4295","first_computed_at":"2026-05-18T03:30:52.740731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:52.740731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eke4vA90oxGWg/Lw1qQoj90mRgLL6llExmg8eB/64fZCuKh2eOxjUTntd1QG1MISrRMyiR3saNpi8FXpHRDzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:52.741406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f11c1b0be4eb8b6d674ec6fa4962cd4d8e250d88c0cbeeb35414535907924241","sha256:176e9f411522d6c5636c74e89baaa769f5b374e2acef1f78480a688b5d3c75e9"],"state_sha256":"ed101b295d9f2973af525d94cd2213de24271821be4bcc1ed9c95f4b7a6c144c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8Tvsewhwlz6ihTXHlkLzMyo2Uqd3F1wlRTfOmdnln0TfNA356DMhJJWSUmdqXGYF8uGttNJ6uNUoGsvnRq/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:38:37.790543Z","bundle_sha256":"50fe56a8136da3d27844d720865f9150df5766bb6c639bbddca09d7988138c5e"}}