{"as_of":"2026-08-16T22:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09a280b22a34a6122b9039201c0687a5206c43e81e48b86361fd3591b14bc7d5","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:29:19.496725Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.09070/citation-record","integrity":"/paper/1908.09070/integrity","json":"/paper/1908.09070/citation-record.json","paper":"/paper/1908.09070"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.792518Z","title":"B4: Experience with a globally-deployed software defined wan,","venue":null,"work_id":"3f31c5ca-0a16-43eb-b7aa-192b77c1055b","year":2013},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.426481Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:56bdf90b9a6f71f47f9aebb413770d25b581a4daef074c7823cd65d98658d2a3","observation_id":"abe68325-5f6c-4fbc-83f0-1e18a025e775","resolution":{"observed_at":"2026-08-14T11:29:19.796190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.780878Z","title":"B4 and after: Managing hierarchy, parti- tioning, and asymmetry for availability and scale in google’s software- defined wan,","venue":null,"work_id":"14302a68-65f9-485b-943d-76655faa70e6","year":2018},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.432075Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:7ae068f9c45fcdf5efecf5e4425854c7dbdfcc3a76fd20d32390a88768e90ac1","observation_id":"98b15458-326f-4922-9ad6-03164f64ccb3","resolution":{"observed_at":"2026-08-14T11:29:19.784613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"posts/1782709","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.571449Z","title":null,"venue":null,"work_id":"81a44c7e-76f3-4cc3-baf2-485a56472a5e","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.436459Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:259060d9b18cc6efbf97429b63b8553bff4889c7166e27933090a9d2e1db46d7","observation_id":"d62f10f0-ac65-400b-93e0-207bbee93bae","resolution":{"observed_at":"2026-08-14T11:29:19.580043Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.769632Z","title":null,"venue":null,"work_id":"7be564b9-cf83-4664-92eb-2d4cf91c2f23","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.441208Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:8ac48d3c9542f5de442757bec4412ca664f643ac7635ee0ec6a44a494c81baf3","observation_id":"b0c09689-f97c-4df6-b202-dcceaac86609","resolution":{"observed_at":"2026-08-14T11:29:19.773394Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.758426Z","title":"On minimizing the completion times of long flows over inter-datacenter wan,","venue":null,"work_id":"ca9d9374-fc12-4df6-9dfb-059d1212e524","year":2018},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.445799Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:4cdfb58b3dfca2556e012487f82cb041f442b6939860a0d0020359546b738db1","observation_id":"959dac2d-c4f0-4690-beab-78d0de23230d","resolution":{"observed_at":"2026-08-14T11:29:19.762071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.745827Z","title":"Online multicast routing with bandwidth guarantees: a new approach using multicast network flow,","venue":null,"work_id":"ba9f65d6-e104-4236-8f14-9e10ccf82cc7","year":2003},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.450404Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:144b24b140f4de610d78f821746e96cec170558db8e80826d7bdedb43cf76072","observation_id":"adfdeda4-2aad-4e4a-962a-1ee88f8eccc1","resolution":{"observed_at":"2026-08-14T11:29:19.750163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.733060Z","title":null,"venue":null,"work_id":"a2b78a5e-a16d-427b-b27c-1a96ce5a37fd","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.454636Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:6eb90194a065d0707d5f9802ae90a8a70e37755035e199588b06bc56b0d317c0","observation_id":"57770d7f-fdd4-42cf-b6fc-5df47ce684d3","resolution":{"observed_at":"2026-08-14T11:29:19.737506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.719653Z","title":"Calendaring for wide area networks,","venue":null,"work_id":"6551578a-5808-4f6b-8a92-7ff910201fb8","year":2015},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.458260Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:c823fa7a44d3a21133691578a246249c3b3bc6f63739724d23b561f2b3d97eca","observation_id":"1a67d11c-955e-4518-868f-54db386b4fef","resolution":{"observed_at":"2026-08-14T11:29:19.723647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.708047Z","title":"Guaranteeing deadlines for inter- datacenter transfers,","venue":null,"work_id":"a682a243-e24e-417b-a8b0-15d11da52052","year":2015},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.461676Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:5fed4687576a5ffc9f92ba8e9bc2dd1ddcebb6c8727e8ca0d3b46f809c769bd9","observation_id":"cd98476c-073b-45bd-b9e0-279be7e8d78a","resolution":{"observed_at":"2026-08-14T11:29:19.712044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.696058Z","title":"Optimizing bulk transfers with software-defined optical wan,","venue":null,"work_id":"0ebafb1a-0d06-43e7-b914-5a8d63783c8b","year":2016},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.465330Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:d493ddb2cc92248cca751355a22aa53807a5fb91a52384e9aeca0817fa92db86","observation_id":"2ed3e42c-98c4-4260-b9ea-18879b2f5ac4","resolution":{"observed_at":"2026-08-14T11:29:19.700001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.683235Z","title":"Inside the Social Network’s (Datacenter) Network,","venue":null,"work_id":"e2f4f6a3-b400-4310-ab86-86c2a81ef420","year":2015},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.468740Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:194ae1e238153b517e7ad5e0f72b7e7dbf9f64679334556325c7334c4f937cd0","observation_id":"61cdb673-3add-41b6-9aef-6edbfc4491d7","resolution":{"observed_at":"2026-08-14T11:29:19.688241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.669140Z","title":"Data networks,","venue":null,"work_id":"4ab7d50a-443a-4755-9b4c-22fe0b0b550f","year":1987},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.472428Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:62fec4281cb325a3f0aa1e9c404522a9a2d4609c232c106fe8736149276fc4a6","observation_id":"edff381f-6ffc-49f8-840b-a3c89337cf8a","resolution":{"observed_at":"2026-08-14T11:29:19.673689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.655913Z","title":"Software-defined networking,","venue":null,"work_id":"509cb477-9ebd-4258-823d-387b7cdd7389","year":2009},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.476215Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:392fbcb793a55a14067d18644fe00f40d50305ea55e1ef803409f8ef016efe4d","observation_id":"3d1c415e-f561-4f8c-925b-969d586409e9","resolution":{"observed_at":"2026-08-14T11:29:19.660422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.642861Z","title":"Segment routing architecture,","venue":null,"work_id":"5e5d53f1-f2f3-46f0-b687-7bd445afb095","year":2018},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.479952Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:870e945d05f41abf97d54b53cd0e24612b70808f9ca2a51280ba6e4e6ace99ab","observation_id":"4b877cde-09dc-4d4a-be9e-cdcb2dddabad","resolution":{"observed_at":"2026-08-14T11:29:19.646907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.630375Z","title":"[Online]","venue":null,"work_id":"42c40f19-4289-41f3-a185-f22dd9ce12ee","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.483284Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:8eeec63183d341545b70ecbcf80741fba4ccb31436a579e25ba46c025334305a","observation_id":"beebf631-911e-4f58-b7bb-55c2df50c24f","resolution":{"observed_at":"2026-08-14T11:29:19.634016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.617468Z","title":"[Online]","venue":null,"work_id":"d9526113-feba-4cd1-9ef5-64cd00a13014","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.487186Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:b30d21aef154f497fc819f0f93351492af622925ec612509775e5ce614cddd8f","observation_id":"347a8706-7634-4f01-ab7c-f30fb7e4298c","resolution":{"observed_at":"2026-08-14T11:29:19.622360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.602673Z","title":"[Online]","venue":null,"work_id":"bbede796-7c93-4a4d-a7d1-85743eae9b84","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.491797Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:fa5d04c008481071d5a2e7781ba1a90d0c6e96eaba5a5cf75d412034892f0d52","observation_id":"ef527447-ea34-416c-a334-19911c8382a2","resolution":{"observed_at":"2026-08-14T11:29:19.608208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:29:19.588981Z","title":"[Online]","venue":null,"work_id":"2c9b9a8a-cac3-4585-9c82-d3a9780a72fb","year":null},"citing_paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:29:19.496725Z"},"links":{"citing_paper":"/paper/1908.09070"},"observation_digest":"sha256:293aedafc74863c5dbfa2fe6ee5e92818b2b6d38e8ac35c1d2609d612b91742f","observation_id":"6f2ad4ab-295b-4f22-b8d9-721df8a33dbb","resolution":{"observed_at":"2026-08-14T11:29:19.593301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09070","last_updated":"2019-08-24T02:04:37Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-16T06:29:57.993033Z","submitted_at":"2019-08-24T02:04:37Z","title":"Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":15},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.09070."}