{"as_of":"2026-08-16T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be57df47ae5edc1e8c23942196b53017179c888605ca3049f9021e654bdafcfd","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:25:33.438881Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"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.09473/citation-record","integrity":"/paper/1908.09473/integrity","json":"/paper/1908.09473/citation-record.json","paper":"/paper/1908.09473"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-53426-7_3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.636507Z","title":null,"venue":null,"work_id":"124e5bcc-24b1-4251-9c71-ca0c87c5e9df","year":2016},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.288591Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:f435ea3733add8b4043e80e8424ee43c99502b6c5819aaf0bcedb5f83208a179","observation_id":"10f876d0-ba36-434c-92d5-b530bca9bd98","resolution":{"observed_at":"2026-08-14T11:25:33.640238Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.294140Z","title":"Networkdecomposition and locality in distributed computation","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.294140Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:b769d66159492c530762c6a12ed261de2badfe7299a12700fc5bbddc5528a071","observation_id":"ae149e88-71a4-481b-a33d-d0db697b6e70","resolution":{"observed_at":"2026-08-14T11:25:33.294140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539701385351","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.624675Z","title":"Corneil and Udi Rotics","venue":null,"work_id":"8149eacf-d252-41bc-9835-64dfad2f66e9","year":2005},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.298731Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:be60b3feea0efed538641a852d73cc8d8d52bedeac78eb75c3d2be178a5129b1","observation_id":"70b30ed8-0fed-443c-889b-6244198add98","resolution":{"observed_at":"2026-08-14T11:25:33.628905Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.304320Z","title":"Upper bounds to the clique width of graphs.Discrete Applied Mathematics, pages 77–114, 2000.doi:10.1016/S0166-218X(99)00184-5","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.304320Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:d1012428f14fe62719d42c5970123413709ca413b85986d10515d02df8b32332","observation_id":"3f8cce42-6b9c-4b82-9e55-10303df1d277","resolution":{"observed_at":"2026-08-14T11:25:33.304320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4916.10549","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:34.225109Z","title":"Distributed approximation: a survey","venue":null,"work_id":"dd2339b4-3a6d-4c13-b9d1-8520d94925e8","year":2004},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.308738Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:678164dad38aedea00cb237651f632b3f7ed54e22650c460e82fd08b1be86211","observation_id":"7bce360e-6288-44a9-a70a-2805c046dddd","resolution":{"observed_at":"2026-08-14T11:25:34.230931Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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:25:34.375231Z","title":"An unconditional lower bound on the time-approximation trade-off for the distributed minimumspanningtreeproblem","venue":null,"work_id":"a91cdae5-f90b-4ae8-b2b3-2283e8d6221a","year":2006},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.313520Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:c66c0595378554246e4a851c7a38f0e99a0cf2ad434320e6a4f3334b981501de","observation_id":"792cd544-112f-4921-b848-c7ef7498e974","resolution":{"observed_at":"2026-08-14T11:25:34.379639Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.318912Z","title":"Gallager, Pierre A","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.318912Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:35ce1e0667ed5de81f1edae67d4bebfe131a332a2c8d4b025a9caa72f6b5eeb3","observation_id":"9d947403-7237-4967-80b8-bbdcefbed0ee","resolution":{"observed_at":"2026-08-14T11:25:33.318912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:25:34.360072Z","title":"Garay, Shay Kutten, and David Peleg","venue":null,"work_id":"208e8cff-3a46-4768-be5d-784edf9ae1d0","year":1998},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.323557Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:76155613d94c63d0317e5c73ab5c28341b6891de85c8c060522e748ce870fb06","observation_id":"387d12ee-cc71-457b-865c-dbf85787a0a4","resolution":{"observed_at":"2026-08-14T11:25:34.365070Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.327987Z","title":"The intersection graphs of subtrees in trees are exactly the chordal graphs.Journal of Combinatorial Theory, Series B, pages 47–56, 1974.doi:10.1016/0095-8956(74)90094-X","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.327987Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:8a72e44a0cf645ba968a7ad51160935f6b45685a32627d6de643e4f7793b5561","observation_id":"9b1b4983-d98e-4166-bbbc-500a8b770517","resolution":{"observed_at":"2026-08-14T11:25:33.327987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.332162Z","title":"Near-optimal scheduling of distributed algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.332162Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:02e0d41cd2f64d92c4a59b893880ece3d70490a1ee77c619c7a357d0d2e8c5b9","observation_id":"7b16c3e9-96f5-4644-86de-cdebce191708","resolution":{"observed_at":"2026-08-14T11:25:33.332162Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974331.ch16","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.598813Z","title":"DistributedalgorithmsforplanarnetworksII:low-congestion shortcuts, mst, and min-cut","venue":null,"work_id":"0572b790-0a27-4b40-99eb-44ac93a84578","year":2016},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.336433Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:8693c9281abb6fedcf7eb37ae7792ad77b531f4edd2e8c67c35fc0b63c5cacc4","observation_id":"2c4c95c7-210a-4a6a-afa6-73246e4269db","resolution":{"observed_at":"2026-08-14T11:25:33.602837Z","resolver_source":"doi","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":"10.4230/lipics.disc.2018.30","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.586586Z","title":"Distributed MST and broadcast with fewer messages, and faster gossiping","venue":null,"work_id":"1cf73682-015d-408e-939b-aa94bf592759","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.340486Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:fa8ff2424f2b8ecb47ce01cf4169085e7ba3eae842c30b5761f003c846ecedad","observation_id":"f1c09c25-ee67-4df1-a77c-e37088acf362","resolution":{"observed_at":"2026-08-14T11:25:33.590560Z","resolver_source":"doi","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:25:34.345552Z","title":"DistributedMSTandroutinginalmostmixingtime","venue":null,"work_id":"a55afc54-272d-472d-9ba5-2a9613a1100a","year":null},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.345861Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:1cdcb0210b145c9b028b8a50de268d59a7b03761ac8c5dabeba01388a687640e","observation_id":"c213c383-9062-4b7d-a737-24efaf0f8ce9","resolution":{"observed_at":"2026-08-14T11:25:34.349506Z","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":"10.4230/lipics.disc.2018.31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.573873Z","title":"New distributed algorithms in almost mixing time via transformations from parallel algorithms","venue":null,"work_id":"d80af218-7842-4399-a822-361994509cf3","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.353561Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:64f59ab26971d684f8cd334b85600cb6f66065be9498e660df725e9cdf3be179","observation_id":"2a7982e4-4a2a-419f-8eea-2587f49c400a","resolution":{"observed_at":"2026-08-14T11:25:33.578702Z","resolver_source":"doi","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":"10.4230/lipics.disc.2018.32","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.560853Z","title":"Time-messagetrade-offsindistributedalgorithms","venue":null,"work_id":"50f511ae-a9b9-4fd5-99d2-de4cd0808818","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.357704Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:d7d8074d66c37c11669c9411ec66003eddd0d691063d49befe509473f9d7aa63","observation_id":"78463dbb-6839-4535-b003-134c247ef8b6","resolution":{"observed_at":"2026-08-14T11:25:33.565270Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.366828Z","title":"Low-congestion shortcuts without embedding","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.366828Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:b747c787a9fe81f4a9cadd4276e6f277ac54a6cd21e9a534a533fdefa70d5537","observation_id":"7af9051d-6329-40ec-8141-6463bab13ab1","resolution":{"observed_at":"2026-08-14T11:25:33.366828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-53426-7_12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.547737Z","title":null,"venue":null,"work_id":"45855c7b-f5d1-4be9-918c-33f48e3650c3","year":2016},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.373064Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:eb7045a5780565946073ad35671008f76e1131b4d731533d7f9ae1655f6c46b6","observation_id":"d47aa4f9-5414-4863-9888-74f2ead68587","resolution":{"observed_at":"2026-08-14T11:25:33.551717Z","resolver_source":"doi","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:25:34.331969Z","title":"Faster distributed shortest path approximations via shortcuts","venue":null,"work_id":"2c21a3bf-aa00-41b7-aeab-3c4db5a62401","year":null},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.377809Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:1cf33448bf2cc977e3e255b4c69ae943f73a414d16f7a2681814658b67d1f68f","observation_id":"ba573342-ae29-4517-b337-1f9e6627e628","resolution":{"observed_at":"2026-08-14T11:25:34.336877Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.387463Z","title":"Minorexcludednetworkfamiliesadmitfastdistributed algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.387463Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:ef2012898502345c6be9da94471d0db11aca03e356bac1fbd2e4fbddccc978c1","observation_id":"0ff60a0d-27ce-4ed8-9bc7-d70deabafe4c","resolution":{"observed_at":"2026-08-14T11:25:33.387463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:25:34.319014Z","title":"MSTin O(1)roundsofcongestedclique","venue":null,"work_id":"e1e5ca17-0ebd-4c9d-b003-0ea0a6f94cad","year":null},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.393199Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:4c2ada18a138e24f79b36f911c3bbdcc626388171af091b1229928b19a11c590","observation_id":"cbe871cc-4fec-46c3-bdb4-d9e49f771876","resolution":{"observed_at":"2026-08-14T11:25:34.323343Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.402490Z","title":"Fastdistributedconstructionofsmall k-dominatingsetsandapplications","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.402490Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:3648c62b5573f65eca9fa6877e8ea7894a165712504038e7d7f0b0126b552892","observation_id":"f4b26f64-74b6-44b0-ac86-d78485b98a34","resolution":{"observed_at":"2026-08-14T11:25:33.402490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10708","last_updated":"2025-07-14T18:48:35Z","snapshot_observed_at":"2026-08-14T19:10:35.531611Z","submitted_at":"2018-05-27T23:01:25Z","title":"Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model","version":2},"cited_work":{"arxiv_id":"1805.10708","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.10708","snapshot_observed_at":"2026-08-14T11:25:33.798492Z","title":"Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model","venue":"cs.DS","work_id":"18b2358f-31b4-44db-bfc8-f99cde3b05fe","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.406310Z"},"links":{"cited_paper":"/paper/1805.10708","citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:4dc9ca36d2521f1fc1e7d1f4f80b83f95ff4c8f2bcc45b746507c18fa4d2ac4d","observation_id":"8d16ec17-5189-4c3c-a503-c3dfaf32f53f","resolution":{"observed_at":"2026-08-14T11:25:33.803054Z","resolver_source":"local_arxiv","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":"10.1137/1.9781611975031.167","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.519934Z","title":null,"venue":null,"work_id":"134245d6-2741-40c2-b7fa-3b47bfe9becd","year":null},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.397652Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:61d497c970e29cd8dd23aaf7c886cd85a830d5d8e242f7234444a506563e8d25","observation_id":"5fea6dd1-e62f-449b-a811-d1e6aecc44bf","resolution":{"observed_at":"2026-08-14T11:25:33.524166Z","resolver_source":"doi","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":"10.1007/978-3-662-46078-8_31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.490067Z","title":"Filling logarithmic gaps in distributed complexity for global problems","venue":null,"work_id":"d84fecf2-0691-41d6-9067-51d6c1d6aeca","year":2015},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.415120Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:c8c1b83b1a620c3aaeeb6b8fc6fdf7ed7004148f533c8b7f723a8814e6ed4664","observation_id":"0f96f627-46a9-4d0c-8d8f-29843796b66d","resolution":{"observed_at":"2026-08-14T11:25:33.496806Z","resolver_source":"doi","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":{"arxiv_id":"1404.5468","last_updated":"2014-04-22T12:22:31Z","snapshot_observed_at":"2026-08-14T23:36:45.472598Z","submitted_at":"2014-04-22T12:22:31Z","title":"Intersection Graphs: An Introduction","version":1},"cited_work":{"arxiv_id":"1404.5468","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.5468","snapshot_observed_at":"2026-08-14T11:25:33.779118Z","title":"Intersection Graphs: An Introduction","venue":"cs.DM","work_id":"d74f2e84-800f-4d5d-851a-ee734d709b87","year":2014},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.419606Z"},"links":{"cited_paper":"/paper/1404.5468","citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:1b09d6634142ed787538ce662bc51420b9d9efe861a3c968f26924284ab2a711","observation_id":"163ce8a4-30f4-41f1-b229-a77f20a98aaa","resolution":{"observed_at":"2026-08-14T11:25:33.784843Z","resolver_source":"local_arxiv","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":"10.1007/s00446-005-0127-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.506235Z","title":"Distributed MST for constant diameter graphs","venue":null,"work_id":"9871225b-29b2-4b92-93d5-b04121df7692","year":2006},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.410673Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:39198ce2ceb6325fea1f240d6fbd88a10388a2f38f6042c8ab9f7c1a6a169809","observation_id":"8830879f-30d4-4454-9b56-d39813623da4","resolution":{"observed_at":"2026-08-14T11:25:33.510757Z","resolver_source":"doi","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:25:34.305905Z","title":"The distributed minimum spanning tree problem.Bulletin of the European Association for Theoretical Computer Science (EATCS), 2018","venue":null,"work_id":"f5329f7c-a2f7-4d45-a6d0-13c1a14030f2","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.427459Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:9647c0b60cec910fb605963fd35dd2c24f36a7060b108cde3e2340d8c35a44c4","observation_id":"17043dc5-1f8c-4fec-a823-f5cccaad8669","resolution":{"observed_at":"2026-08-14T11:25:34.310276Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.431173Z","title":"A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction.SIAM Journal on Computing, pages 1427–1442, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.431173Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:a5e0851f7b4d4ff4073c37021b2514ecf622477fbe661be8ac208269b3f5186f","observation_id":"a4d67999-0efe-4fa5-9a90-5bed05a582c0","resolution":{"observed_at":"2026-08-14T11:25:33.431173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.423659Z","title":"Atime-andmessage-optimaldistributed algorithm for minimum spanning trees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.423659Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:8abbd41a55d0248c7a0a9fa0fd1ec2121179b204b1a53d44c5e4709b2104174e","observation_id":"c9908ff4-1ad3-4efc-9885-34aa87124457","resolution":{"observed_at":"2026-08-14T11:25:33.423659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.438881Z","title":"Newhashfunctionsandtheiruseinauthenticationandsetequality","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.438881Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:f1530f15a5c0107eb495dd5b7014595ea4557ce042ff88a2ddeed40d43ae485e","observation_id":"b74b08af-8ef6-4466-a276-c49db5e65987","resolution":{"observed_at":"2026-08-14T11:25:33.438881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.435237Z","title":"In Proceedings of the 43th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 363–372, 2011.doi:10.1145/1993636.1993686","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.435237Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:1b0d69a0e118ccfc04c92177f690af6a5440e11cbf3c44e8902ee6c7efadb2c1","observation_id":"4c30ef31-743a-4c67-bf82-40a8bc0b3921","resolution":{"observed_at":"2026-08-14T11:25:33.435237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.349676Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.349676Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:5980d3a99faf0ac5d02cbfbe60a980d7d1824dfafb78b885a90ccd66ffc7c553","observation_id":"e791d084-0ef3-4ea0-8d72-081bbbb82c31","resolution":{"observed_at":"2026-08-14T11:25:33.349676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.disc.2018.33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:25:33.535002Z","title":null,"venue":null,"work_id":"7d9d36ad-ebc5-4a12-a49f-f7348d8b93e1","year":2018},"citing_paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:33.382781Z"},"links":{"citing_paper":"/paper/1908.09473"},"observation_digest":"sha256:eb4a365742f3d63126f9d8935c092c79426aa8dd21435383efc591bc964228c8","observation_id":"53448055-efaf-48ac-9bf0-d26857a82d6a","resolution":{"observed_at":"2026-08-14T11:25:33.539279Z","resolver_source":"doi","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"}}],"paper":{"arxiv_id":"1908.09473","last_updated":"2019-08-26T05:11:24Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T02:22:37.450053Z","submitted_at":"2019-08-26T05:11:24Z","title":"Low-Congestion Shortcut and Graph Parameters"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":3,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":13,"verified_fuzzy":4},"total_outbound_references":33},"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 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.09473."}