{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B6QWOSXNDWYD4OCARMJJJIDU3J","short_pith_number":"pith:B6QWOSXN","canonical_record":{"source":{"id":"1810.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-29T07:49:10Z","cross_cats_sorted":["cs.DS","cs.PF","cs.SY"],"title_canon_sha256":"0212ae2bc3bd7175f2e6c5a40c527cafd11d279208d0d152777bdb20763f1987","abstract_canon_sha256":"fd437992a5af7a4685dda0f9a2ced3228f4b1911a018a8ee85e0500c10d8cc2a"},"schema_version":"1.0"},"canonical_sha256":"0fa1674aed1db03e38408b1294a074da6bf25679dc0f7334a289432c85426898","source":{"kind":"arxiv","id":"1810.00169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00169","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00169v1","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00169","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"B6QWOSXNDWYD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B6QWOSXNDWYD4OCA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B6QWOSXN","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B6QWOSXNDWYD4OCARMJJJIDU3J","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-29T07:49:10Z","cross_cats_sorted":["cs.DS","cs.PF","cs.SY"],"title_canon_sha256":"0212ae2bc3bd7175f2e6c5a40c527cafd11d279208d0d152777bdb20763f1987","abstract_canon_sha256":"fd437992a5af7a4685dda0f9a2ced3228f4b1911a018a8ee85e0500c10d8cc2a"},"schema_version":"1.0"},"canonical_sha256":"0fa1674aed1db03e38408b1294a074da6bf25679dc0f7334a289432c85426898","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.529468Z","signature_b64":"CEFHXgdmaNQ0kVmOqNxjmicDCsu5ngFpqhPata20J7DrVxOlvmPQMuGuxz9IjhKztwesnoR1weJjRoxWINFLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fa1674aed1db03e38408b1294a074da6bf25679dc0f7334a289432c85426898","last_reissued_at":"2026-05-17T23:54:02.528827Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.528827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00169","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:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HfZDVKI64BAzkaoPF24EIDXKshGHYciWbiYQ+GR/Ty5WZeSLhpHf1QBVPKJnets3I6MnPlSuINutlLeZ/48AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:57:10.880779Z"},"content_sha256":"d858c0a77426dec6021da6d3a2bc5e97eb63e98286bbd4f77d7c54de5f159c9e","schema_version":"1.0","event_id":"sha256:d858c0a77426dec6021da6d3a2bc5e97eb63e98286bbd4f77d7c54de5f159c9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B6QWOSXNDWYD4OCARMJJJIDU3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF","cs.SY"],"primary_cat":"cs.NI","authors_text":"Ajitesh Srivastava, Cauligi S. Raghavendra, Mohammad Noormohammadpour","submitted_at":"2018-09-29T07:49:10Z","abstract_excerpt":"Long flows contribute huge volumes of traffic over inter-datacenter WAN. The Flow Completion Time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users' quality of experience. Flow routing techniques based on propagation or queuing latency or instantaneous link utilization are insufficient for minimization of the long flows' FCT. We propose a routing approach that uses the remaining sizes and paths of all ongoing flows to minimize the worst-case completion time of incoming flows assuming no knowledge of future flow arrivals. Our app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00169","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:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agUc+hjafyvLvkJd0G6jchRpIEp1BQUvAMos/v3G8/vDhFOCyKkBDndGGDg+VYLwyWdPTOkOiwmfOBQrmNBDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:57:10.881127Z"},"content_sha256":"dcaeea87f0d5d2857f8c6903fe8cbce8bd0937f93b58e77bd17d94c8c19cad1e","schema_version":"1.0","event_id":"sha256:dcaeea87f0d5d2857f8c6903fe8cbce8bd0937f93b58e77bd17d94c8c19cad1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/bundle.json","state_url":"https://pith.science/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/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-08T12:57:10Z","links":{"resolver":"https://pith.science/pith/B6QWOSXNDWYD4OCARMJJJIDU3J","bundle":"https://pith.science/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/bundle.json","state":"https://pith.science/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6QWOSXNDWYD4OCARMJJJIDU3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B6QWOSXNDWYD4OCARMJJJIDU3J","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":"fd437992a5af7a4685dda0f9a2ced3228f4b1911a018a8ee85e0500c10d8cc2a","cross_cats_sorted":["cs.DS","cs.PF","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-29T07:49:10Z","title_canon_sha256":"0212ae2bc3bd7175f2e6c5a40c527cafd11d279208d0d152777bdb20763f1987"},"schema_version":"1.0","source":{"id":"1810.00169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00169","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00169v1","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00169","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"B6QWOSXNDWYD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B6QWOSXNDWYD4OCA","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B6QWOSXN","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:dcaeea87f0d5d2857f8c6903fe8cbce8bd0937f93b58e77bd17d94c8c19cad1e","target":"graph","created_at":"2026-05-17T23:54:02Z","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":"Long flows contribute huge volumes of traffic over inter-datacenter WAN. The Flow Completion Time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users' quality of experience. Flow routing techniques based on propagation or queuing latency or instantaneous link utilization are insufficient for minimization of the long flows' FCT. We propose a routing approach that uses the remaining sizes and paths of all ongoing flows to minimize the worst-case completion time of incoming flows assuming no knowledge of future flow arrivals. Our app","authors_text":"Ajitesh Srivastava, Cauligi S. Raghavendra, Mohammad Noormohammadpour","cross_cats":["cs.DS","cs.PF","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-29T07:49:10Z","title":"On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00169","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:d858c0a77426dec6021da6d3a2bc5e97eb63e98286bbd4f77d7c54de5f159c9e","target":"record","created_at":"2026-05-17T23:54:02Z","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":"fd437992a5af7a4685dda0f9a2ced3228f4b1911a018a8ee85e0500c10d8cc2a","cross_cats_sorted":["cs.DS","cs.PF","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-29T07:49:10Z","title_canon_sha256":"0212ae2bc3bd7175f2e6c5a40c527cafd11d279208d0d152777bdb20763f1987"},"schema_version":"1.0","source":{"id":"1810.00169","kind":"arxiv","version":1}},"canonical_sha256":"0fa1674aed1db03e38408b1294a074da6bf25679dc0f7334a289432c85426898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fa1674aed1db03e38408b1294a074da6bf25679dc0f7334a289432c85426898","first_computed_at":"2026-05-17T23:54:02.528827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.528827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CEFHXgdmaNQ0kVmOqNxjmicDCsu5ngFpqhPata20J7DrVxOlvmPQMuGuxz9IjhKztwesnoR1weJjRoxWINFLBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.529468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d858c0a77426dec6021da6d3a2bc5e97eb63e98286bbd4f77d7c54de5f159c9e","sha256:dcaeea87f0d5d2857f8c6903fe8cbce8bd0937f93b58e77bd17d94c8c19cad1e"],"state_sha256":"e82ac28f4bdc4e0573c9d933fb524f7332c97c17b809d0c4feed92f034864a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnLixuAQT1HK43VCGDeEKkSKEqiQnz2ycVgG9qRnAYDVZrkfV1eSjg77D1+2Agn+ijNZMfqsxXf1LgGlGkHZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:57:10.883235Z","bundle_sha256":"7259434340d973d83f97dcf2a76af50b7731252dd57a41e6b89ea554d2fd9848"}}