{"as_of":"2026-08-16T13:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e03a904d26b0f3759fe8d92eda88a82b61bafc2ed81d71b1fe047fe6b347f404","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:26:05.887587Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"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.03473/citation-record","integrity":"/paper/1908.03473/integrity","json":"/paper/1908.03473/citation-record.json","paper":"/paper/1908.03473"},"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-14T14:26:06.175964Z","title":"Cattaneo, P","venue":null,"work_id":"6de2351b-b33a-4352-a05e-d57cd1b3405a","year":2010},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.803978Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:86940cf007483204af89672ad5560f818753d8c939da71e2aec655bc515e36da","observation_id":"59fa2c29-5980-4e61-a3b0-ec625dacd4e2","resolution":{"observed_at":"2026-08-14T14:26:06.180545Z","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-14T14:26:06.163406Z","title":"Chin and D","venue":null,"work_id":"d67d6c0c-bce9-4f86-a463-0fb9bd78ed2b","year":1978},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.808946Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:8f41b8a76b222f58cba5313c84b92a52807f6c518ecf27def59639c7bb04de48","observation_id":"e8250751-f6d1-49de-a3b7-69248d5c17cd","resolution":{"observed_at":"2026-08-14T14:26:06.167596Z","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-14T14:26:06.150943Z","title":null,"venue":null,"work_id":"5512e937-3b2b-4682-bd76-0f007707a525","year":2009},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.813226Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:f8be6bd4c725ff010f66e2df9139584e177c6e8563544d0fd888e6b621432afa","observation_id":"ae7e555d-fc71-4370-be24-ba1df8409efa","resolution":{"observed_at":"2026-08-14T14:26:06.154909Z","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-14T14:26:06.138296Z","title":"Das and M.C","venue":null,"work_id":"d30bb486-ca4e-4e8e-a815-87914fce568d","year":2001},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.817342Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:0e552b505ec2f23ccc142d60bd8e0b69fcc8c90f74309529ba3657dc86ccf9f9","observation_id":"a8d5bf3c-42c9-4d41-a37a-eb0adfbdc9e2","resolution":{"observed_at":"2026-08-14T14:26:06.142367Z","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-14T14:26:06.125106Z","title":"Frederickson","venue":null,"work_id":"61ac0256-ca8c-40fa-b4f8-e12dee6aeda5","year":1985},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.821639Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:1241e922e2430cc48ee4f22800b040b4664f86c0c348110f9fd65edaacf788eb","observation_id":"51d7d69c-3510-40f5-b0f9-c162b1d64c55","resolution":{"observed_at":"2026-08-14T14:26:06.129424Z","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-14T14:26:06.112301Z","title":"Gabow and R.E","venue":null,"work_id":"ab1a3104-6fae-45de-83b3-5b9f959ac349","year":1983},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.825154Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:9dc54e9226ee6726708fe30cf3edbfe016f95a911bdc7ceb71b1654901ab3482","observation_id":"21487b38-8b2d-4f8d-9657-7b594e78cea1","resolution":{"observed_at":"2026-08-14T14:26:06.116486Z","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-14T14:26:06.100839Z","title":"Gabow and R.E","venue":null,"work_id":"7b1575ee-8341-46ea-9676-59413aa97c37","year":1985},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.829342Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:23346c5deaf4e1c275589c69f9e78a67c3b336c5a7228a656865f6af35ce222b","observation_id":"cc268f6b-2073-4a11-b5cc-53d46058721f","resolution":{"observed_at":"2026-08-14T14:26:06.104368Z","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-14T14:26:06.087836Z","title":"Henzinger and V","venue":null,"work_id":"fbb997a8-667b-4de2-90f7-a18d6431c9df","year":1997},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.833083Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:fba19237bba3e976efae200782e9741eb25ae771f44c73d219e7da640cbd154d","observation_id":"65bb9238-273e-4941-bb35-6a0f7267e77c","resolution":{"observed_at":"2026-08-14T14:26:06.092115Z","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-14T14:26:06.073569Z","title":null,"venue":null,"work_id":"015a0761-0a0b-4ceb-812d-ec15c25baa95","year":2001},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.836444Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:e72f40defbff01b8cbf8729d227d8d4f599f60244d62b86076ac85ea3b7ffb65","observation_id":"dd991f6f-c28a-45df-9ccb-f41819119ecf","resolution":{"observed_at":"2026-08-14T14:26:06.078719Z","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-14T14:26:06.060074Z","title":"Hsu, R.-H","venue":null,"work_id":"8396d0c1-3eac-429f-8339-0c48988bc504","year":1991},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.840394Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:10723ef783046109b505387e491a317fcd3ff8f56f2aa5536ec5c2a790f65f0b","observation_id":"c68dff55-b4fb-4936-8a86-8ea1f0913a2d","resolution":{"observed_at":"2026-08-14T14:26:06.064818Z","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-14T14:26:06.046007Z","title":"Iwano and N","venue":null,"work_id":"bfa65f76-b83c-47bf-bfd6-cd7362ec2c26","year":1993},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.844497Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:9f8ba318e33e91baa3a447e67e35f4743ddc41611df13287279343444b451e2e","observation_id":"8a25e402-1f09-4a4c-947f-d7fb373dd142","resolution":{"observed_at":"2026-08-14T14:26:06.050953Z","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-14T14:26:06.033574Z","title":"Karger, P.N","venue":null,"work_id":"123c700f-662a-4c8f-a809-f37b48574d6b","year":1995},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.848562Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:8fadec5d132d43db65bdd203be1057cc520a0b388d17442e71288edbe176d765","observation_id":"f058f841-77b9-4751-aa2a-0c98bb5f6e2a","resolution":{"observed_at":"2026-08-14T14:26:06.037612Z","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-14T14:26:06.022078Z","title":"Katajainen and J.L","venue":null,"work_id":"09674379-36a6-4e67-8fc0-3bafc345e4dd","year":1994},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.853044Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:3bc501bed2af98ce8ca9b6815f16d78a68ca65ce2351fd87b3484b4f726aeeb6","observation_id":"7edaad9f-d3fb-4cd8-b8a7-40932aed9a15","resolution":{"observed_at":"2026-08-14T14:26:06.025756Z","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-14T14:26:06.010041Z","title":"Kooshesh and R.R","venue":null,"work_id":"ef775bfb-131c-4ee3-9208-1b98f283ab36","year":1996},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.857614Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:a58a5adfb6af4e6d37542d768fa0bd01f6ee1fef743e45d3700c21c06a27abc0","observation_id":"72138d4b-d412-4240-9d9c-5bcff6fa0bd3","resolution":{"observed_at":"2026-08-14T14:26:06.013877Z","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-14T14:26:05.996787Z","title":"Kruskal, Jr","venue":null,"work_id":"74794a5c-4cc8-4855-bc84-90dfef03d0fb","year":1956},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.862635Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:85c84274bab203576dee681e9ed8d44f23e716d3c2484c60644094312266f764","observation_id":"6ef4ad12-0b40-4676-86cf-1b1a2fbff6a3","resolution":{"observed_at":"2026-08-14T14:26:06.000960Z","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-14T14:26:05.982107Z","title":null,"venue":null,"work_id":"1bac4520-5f4d-46c7-9268-81d8a17dc820","year":2005},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.866932Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:d1d0053aaec8224ba312a312479c68ae420d354c0991dda5ed92391108f99805","observation_id":"da530f1b-12dd-4148-9851-232682dc9981","resolution":{"observed_at":"2026-08-14T14:26:05.986710Z","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-14T14:26:05.968422Z","title":null,"venue":null,"work_id":"507513ac-f0ec-4338-a973-43d62ce949fe","year":2015},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.870871Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:b37da29ba9895d7145a7ff9ebf74fbfdf065f7d68224ef42b50d86d20b30bd52","observation_id":"05a19247-6fd3-4927-b736-b04cc185ab78","resolution":{"observed_at":"2026-08-14T14:26:05.972593Z","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-14T14:26:05.954978Z","title":"Spira and A","venue":null,"work_id":"1df63121-a847-4f0a-82d1-95de4fbd2e83","year":1975},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.874978Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:0e242c8efd117cb829320920cd90b2b77b1eb8fcba52845059a56c954756686d","observation_id":"78e6c9c0-c3ca-4678-b6ca-2c13a4f38139","resolution":{"observed_at":"2026-08-14T14:26:05.959217Z","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-14T14:26:05.941651Z","title":"Suraweera, P","venue":null,"work_id":"747ad1d8-b1b3-44ba-bce6-13ddc096bde9","year":1995},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.878885Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:68dd481f6866473185e45ec6869dc0a4623fec88f0567c4a75f31873d326ef89","observation_id":"8a5faf74-0df8-4a74-b1ec-8d2490328578","resolution":{"observed_at":"2026-08-14T14:26:05.945265Z","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-14T14:26:05.929667Z","title":null,"venue":null,"work_id":"030d6463-4ea8-4d37-8c89-eec1d37baf8d","year":1974},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.883748Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:95867211f3d7dc8bbe421c83a2eddab7e4f8304b0a820399efd989009557e9c6","observation_id":"60f648bc-5bcc-4b6f-9e0e-90169882b494","resolution":{"observed_at":"2026-08-14T14:26:05.933225Z","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-14T14:26:05.913880Z","title":null,"venue":null,"work_id":"1c5a67d2-7b51-4062-acac-71a79868402d","year":1979},"citing_paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:05.887587Z"},"links":{"citing_paper":"/paper/1908.03473"},"observation_digest":"sha256:cf3cc73de39ae0c3a9518beb04e1dda7d42f58a9e027d18978c2631b8f34e37c","observation_id":"05bf9cbb-5b3d-4128-a086-b0041db4cdf2","resolution":{"observed_at":"2026-08-14T14:26:05.919783Z","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"}}],"paper":{"arxiv_id":"1908.03473","last_updated":"2022-12-27T16:56:54Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:25:35.080747Z","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":21},"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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.03473."}