{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GWO3Z2GY2XS4ND3LSAPNJ6QQCW","short_pith_number":"pith:GWO3Z2GY","canonical_record":{"source":{"id":"1703.07419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"1545b10d4e40382b980be20bb306d22e863dfe92933d52874252347e1100107b","abstract_canon_sha256":"819886eaf54bedcf4009f6000378998116fb541c33d5e9b6c72997a8126c9a04"},"schema_version":"1.0"},"canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","source":{"kind":"arxiv","id":"1703.07419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07419","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07419v2","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07419","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"GWO3Z2GY2XS4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWO3Z2GY2XS4ND3L","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWO3Z2GY","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GWO3Z2GY2XS4ND3LSAPNJ6QQCW","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"1545b10d4e40382b980be20bb306d22e863dfe92933d52874252347e1100107b","abstract_canon_sha256":"819886eaf54bedcf4009f6000378998116fb541c33d5e9b6c72997a8126c9a04"},"schema_version":"1.0"},"canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:17.658768Z","signature_b64":"bZAf+HTX40LF8zRZatsEBPMbCOB11OBr6S9zPxOXFBfj4oJBx52/4b2kxB/c9GGpth6iES5e9N6+eZLXmFiRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","last_reissued_at":"2026-05-17T23:48:17.658102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:17.658102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07419","source_version":2,"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:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lK9ghrD/2e6wwJLHGlheIZsCMcglnp8QDwq1pF+PIMy+t/Pgvl4KZcs1ri3IP6J6B5DEo7SKH+Kwlh6z6s5xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:48:29.513107Z"},"content_sha256":"f691c9444f5627a035872029fef14f225bf311fdb75abfc8b71dde6d19860d41","schema_version":"1.0","event_id":"sha256:f691c9444f5627a035872029fef14f225bf311fdb75abfc8b71dde6d19860d41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GWO3Z2GY2XS4ND3LSAPNJ6QQCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Routing for Delay-Sensitive Traffic in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Rahul Singh","submitted_at":"2017-03-21T20:33:01Z","abstract_excerpt":"We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the problem as a constrained MDP, and show that when the underlay implements static policies such as FIFO with randomized routing, then a decentralized policy, that can be computed efficiently in a distributed fashion, is optimal. Our algorithm utilizes multi-timescale stochastic approximation techniques, and its convergence relies on the fact that the recursion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07419","kind":"arxiv","version":2},"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:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkkiNfvpTgC3/dN05NecYozLeh5yrNto4iL4GB9C4rjNziX3OGhTWbn7vQ3yrLB/Ux839WW/dkhAOKVj7eMnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:48:29.513778Z"},"content_sha256":"ff8a40040991ca6be4a7416142fa42217a234799c9655876787d518d3ba175ab","schema_version":"1.0","event_id":"sha256:ff8a40040991ca6be4a7416142fa42217a234799c9655876787d518d3ba175ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/bundle.json","state_url":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/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-19T17:48:29Z","links":{"resolver":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW","bundle":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/bundle.json","state":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GWO3Z2GY2XS4ND3LSAPNJ6QQCW","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":"819886eaf54bedcf4009f6000378998116fb541c33d5e9b6c72997a8126c9a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","title_canon_sha256":"1545b10d4e40382b980be20bb306d22e863dfe92933d52874252347e1100107b"},"schema_version":"1.0","source":{"id":"1703.07419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07419","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07419v2","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07419","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"GWO3Z2GY2XS4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWO3Z2GY2XS4ND3L","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWO3Z2GY","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:ff8a40040991ca6be4a7416142fa42217a234799c9655876787d518d3ba175ab","target":"graph","created_at":"2026-05-17T23:48:17Z","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":"We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the problem as a constrained MDP, and show that when the underlay implements static policies such as FIFO with randomized routing, then a decentralized policy, that can be computed efficiently in a distributed fashion, is optimal. Our algorithm utilizes multi-timescale stochastic approximation techniques, and its convergence relies on the fact that the recursion","authors_text":"Eytan Modiano, Rahul Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","title":"Optimal Routing for Delay-Sensitive Traffic in Overlay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07419","kind":"arxiv","version":2},"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:f691c9444f5627a035872029fef14f225bf311fdb75abfc8b71dde6d19860d41","target":"record","created_at":"2026-05-17T23:48:17Z","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":"819886eaf54bedcf4009f6000378998116fb541c33d5e9b6c72997a8126c9a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","title_canon_sha256":"1545b10d4e40382b980be20bb306d22e863dfe92933d52874252347e1100107b"},"schema_version":"1.0","source":{"id":"1703.07419","kind":"arxiv","version":2}},"canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","first_computed_at":"2026-05-17T23:48:17.658102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:17.658102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bZAf+HTX40LF8zRZatsEBPMbCOB11OBr6S9zPxOXFBfj4oJBx52/4b2kxB/c9GGpth6iES5e9N6+eZLXmFiRAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:17.658768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f691c9444f5627a035872029fef14f225bf311fdb75abfc8b71dde6d19860d41","sha256:ff8a40040991ca6be4a7416142fa42217a234799c9655876787d518d3ba175ab"],"state_sha256":"cb864a7d75c44856a39c686dd4b96cc970ce28f4d08e25cfa2362b8212fddd82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZcuLM7RIyvxanXyxLCaJpFK4vmoaceTGmPzvFHzjsbtPksE0BQoRDafw1phG1YeLvCfyLzz4BsSaT6LtN9tBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:48:29.517691Z","bundle_sha256":"781c46dad7c10b9e337909b7eb578e2b13538722ebf346a269f41396482b0c9e"}}