{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7MZM7QXSMIMB7TT4QRW7G6OTXF","short_pith_number":"pith:7MZM7QXS","schema_version":"1.0","canonical_sha256":"fb32cfc2f262181fce7c846df379d3b95a3ed9f83f39c0b8bbabd9fc8c2059b7","source":{"kind":"arxiv","id":"1908.09070","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Ajitesh Srivastava, Cauligi S. Raghavendra, Max Noormohammadpour","submitted_at":"2019-08-24T02:04:37Z","abstract_excerpt":"Flow routing over inter-datacenter networks is a well-known problem where the network assigns a path to a newly arriving flow potentially according to the network conditions and the properties of the new flow. An essential system-wide performance metric for a routing algorithm is the flow completion times, which affect the performance of applications running across multiple datacenters. Current static and dynamic routing approaches do not take advantage of flow size information in routing, which is practical in a controlled environment such as inter-datacenter networks that are managed by the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.09070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-08-24T02:04:37Z","cross_cats_sorted":["cs.PF","cs.SY","eess.SY"],"title_canon_sha256":"71f1d564f646b8606c31fbb4e17b515855371c967688de7293af058a808f4b69","abstract_canon_sha256":"cf1ee7ed558660621f0b2b7b33e9b031e009a5c53da5e36566e4eb90b4d14806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:36.503852Z","signature_b64":"6ZOhUL3QyE6I4R4Asd/gM8K4Pk7lx4vA/b1CbvCC8R0QjCl2GyVPoZ13ma+Ka8mGa1UKqZX5HdiHQS4lmVjKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb32cfc2f262181fce7c846df379d3b95a3ed9f83f39c0b8bbabd9fc8c2059b7","last_reissued_at":"2026-07-04T23:59:36.503455Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:36.503455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Ajitesh Srivastava, Cauligi S. Raghavendra, Max Noormohammadpour","submitted_at":"2019-08-24T02:04:37Z","abstract_excerpt":"Flow routing over inter-datacenter networks is a well-known problem where the network assigns a path to a newly arriving flow potentially according to the network conditions and the properties of the new flow. An essential system-wide performance metric for a routing algorithm is the flow completion times, which affect the performance of applications running across multiple datacenters. Current static and dynamic routing approaches do not take advantage of flow size information in routing, which is practical in a controlled environment such as inter-datacenter networks that are managed by the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09070","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.09070/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.09070","created_at":"2026-07-04T23:59:36.503513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09070v1","created_at":"2026-07-04T23:59:36.503513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09070","created_at":"2026-07-04T23:59:36.503513+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MZM7QXSMIMB","created_at":"2026-07-04T23:59:36.503513+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MZM7QXSMIMB7TT4","created_at":"2026-07-04T23:59:36.503513+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MZM7QXS","created_at":"2026-07-04T23:59:36.503513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF","json":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF.json","graph_json":"https://pith.science/api/pith-number/7MZM7QXSMIMB7TT4QRW7G6OTXF/graph.json","events_json":"https://pith.science/api/pith-number/7MZM7QXSMIMB7TT4QRW7G6OTXF/events.json","paper":"https://pith.science/paper/7MZM7QXS"},"agent_actions":{"view_html":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF","download_json":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF.json","view_paper":"https://pith.science/paper/7MZM7QXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09070&json=true","fetch_graph":"https://pith.science/api/pith-number/7MZM7QXSMIMB7TT4QRW7G6OTXF/graph.json","fetch_events":"https://pith.science/api/pith-number/7MZM7QXSMIMB7TT4QRW7G6OTXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF/action/storage_attestation","attest_author":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF/action/author_attestation","sign_citation":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF/action/citation_signature","submit_replication":"https://pith.science/pith/7MZM7QXSMIMB7TT4QRW7G6OTXF/action/replication_record"}},"created_at":"2026-07-04T23:59:36.503513+00:00","updated_at":"2026-07-04T23:59:36.503513+00:00"}