{"as_of":"2026-08-16T07:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56562ee907d2b209d1ac09549ab89ec486c089e3958702a4ccfa334a1fdb5883","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:23:00.955164Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"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.05700/citation-record","integrity":"/paper/1908.05700/integrity","json":"/paper/1908.05700/citation-record.json","paper":"/paper/1908.05700"},"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-14T13:23:01.187896Z","title":"When algorithms for maxi mal independent set and maximal matching run in sublinear time","venue":null,"work_id":"093da4c7-b8da-482e-98a0-a76c72851eba","year":2019},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.896282Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:9a3ec1412e2a347acffa5c4f99a5e935dd4bbd62512caf66c21284cce09926a4","observation_id":"81b98632-7705-4c1c-b6fb-51514faf2eb5","resolution":{"observed_at":"2026-08-14T13:23:01.192567Z","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-14T13:23:01.173749Z","title":"Deterministic dist ributed vertex coloring in polylogarithmic time","venue":null,"work_id":"d642d22d-bd13-4ca5-93bf-15f910dcb5e7","year":2011},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.901282Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:c1c27cdae56ec8f357f684adc97c45b931f02b83e7474855f114014309a59fc0","observation_id":"9ad14968-734c-43ff-b6d0-845254b1a9f7","resolution":{"observed_at":"2026-08-14T13:23:01.178473Z","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-14T13:23:01.159676Z","title":"Det erministic distributed (delta+ o (delta))- edge-coloring, and vertex-coloring of graphs with bounded diversity","venue":null,"work_id":"c73f6c7a-43c2-4818-9c1c-9e4d4be41e43","year":2017},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.905680Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:1b717e4145372c97b3ee1bc0da696185f42788d62700b931b71730ca9f3df581","observation_id":"a994945b-5339-4d78-b1a3-4c61f7701d3c","resolution":{"observed_at":"2026-08-14T13:23:01.164123Z","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-14T13:23:01.145398Z","title":"Distributed symmet ry breaking in graphs with bounded diversity","venue":null,"work_id":"5039237e-79e8-4fac-b201-1916f0f52c66","year":2018},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.910140Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:3c7751bdc41d710c90bfac15b0b79461d2e47af46853a2df46bea9cd2290c698","observation_id":"e964702c-db86-4165-b2f1-fbc9768b6466","resolution":{"observed_at":"2026-08-14T13:23:01.150094Z","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":{"arxiv_id":"1902.08819","last_updated":"2019-08-14T19:28:40Z","snapshot_observed_at":"2026-08-16T05:29:54.431105Z","submitted_at":"2019-02-23T17:45:17Z","title":"Fast Distributed Backup Placement in Sparse and Dense Networks","version":2},"cited_work":{"arxiv_id":"1902.08819","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.08819","snapshot_observed_at":"2026-08-14T13:23:01.012551Z","title":"Fast Distributed Backup Placement in Sparse and Dense Networks","venue":"cs.DC","work_id":"b382aa47-e29b-4293-95f0-8bca162a4afc","year":2019},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.914508Z"},"links":{"cited_paper":"/paper/1902.08819","citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:3d796ea3ec9daaffe85b87cca3d4cf4e72552f964078499c040a9f2490051289","observation_id":"67207c85-649d-49cb-acc0-247942ba879a","resolution":{"observed_at":"2026-08-14T13:23:01.017663Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:23:01.130973Z","title":"Dijkstra","venue":null,"work_id":"438e2c11-e628-45a7-ab2c-2104497a49e6","year":1974},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.919439Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:d43aca3ebb2038793759782fa448a11d8a64c7bc27aa6cf3abb7f05c940bac17","observation_id":"1f65806a-0946-4636-b7f4-368508992205","resolution":{"observed_at":"2026-08-14T13:23:01.135911Z","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-14T13:23:01.116835Z","title":"A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs","venue":null,"work_id":"a521bb1b-d35d-4595-998e-03fde7e2398a","year":2007},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.924591Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:642a5f3d2e9cab3308efbfef30843888b93048c10a50854e403608ea9c4f1c4c","observation_id":"e0c4eda4-5cc7-44ec-84bb-00c52c6c2dfb","resolution":{"observed_at":"2026-08-14T13:23:01.121248Z","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-14T13:23:01.102928Z","title":"Distributed backup placement in networks","venue":null,"work_id":"a6f37759-77d8-4132-939a-fd39ac72a56a","year":2015},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.928853Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:12a4fb3a05159d3ead544f684512ec6da427a4ba0f61bc8c694b75fc308f8c8e","observation_id":"4bc0ffe0-5140-42ab-899b-05f911209c96","resolution":{"observed_at":"2026-08-14T13:23:01.107453Z","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":{"arxiv_id":"1907.03797","last_updated":"2019-07-08T18:22:43Z","snapshot_observed_at":"2026-08-03T20:29:44.734203Z","submitted_at":"2019-07-08T18:22:43Z","title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","version":1},"cited_work":{"arxiv_id":"1907.03797","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.03797","snapshot_observed_at":"2026-08-14T13:23:00.989569Z","title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","venue":"cs.DS","work_id":"6468de01-0f81-47bf-bf2d-af467643ab32","year":2019},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.933229Z"},"links":{"cited_paper":"/paper/1907.03797","citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:147db6d45beebd699a0da792bbdcf8b6e92414d3aefba3cf64d95ac0df3a4b6a","observation_id":"d2be57e6-ae97-4732-b14f-771e38fc8137","resolution":{"observed_at":"2026-08-14T13:23:00.996041Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:23:01.087957Z","title":"Sel f-stabilization and byzantine tolerance for maximal matching","venue":null,"work_id":"229268fd-92dc-485f-bc93-ee0056d2d4aa","year":2018},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.937831Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:8b21c76a553d792ebafeb1b841baa497c9d67ec447c3903255764d98519fc01a","observation_id":"48f4a693-a3db-4675-90a8-1fdc92846817","resolution":{"observed_at":"2026-08-14T13:23:01.092712Z","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-14T13:23:01.072019Z","title":"Distribut ed fault-tolerant backup-placement in overloaded wireless sensor networks","venue":null,"work_id":"19c66dae-d828-47c9-af10-17eeac45bc65","year":2018},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.942296Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:0ba8cac095c5485d5b529792467a5a165bbfe6657b558bf347ca4bd4de6837ab","observation_id":"aa4cfbce-a1bc-4549-897a-e254449f9b53","resolution":{"observed_at":"2026-08-14T13:23:01.077222Z","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-14T13:23:01.057416Z","title":"Some simple dist ributed algorithms for sparse networks","venue":null,"work_id":"7f947089-fa32-4146-9b55-c0302a883eb5","year":2001},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.946622Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:1f6b79634e9b1abe2de91fde451b9a76f2263c4e0dd26caa87dabd1214a51052","observation_id":"ea11d08f-4097-4a2a-89f7-8bd633f7be1a","resolution":{"observed_at":"2026-08-14T13:23:01.062296Z","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-14T13:23:01.042583Z","title":"A log-star d istributed maximal independent set al- gorithm for growth-bounded graphs","venue":null,"work_id":"a3611bfb-36cc-47db-9b31-acdee633d760","year":2008},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.950893Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:bd524ba09e61e67f88bb96e5c59fb6b01d026e90b6f339e4811187c7e3b91c2a","observation_id":"47eadb98-008b-4d1d-b2d1-ca7af140c407","resolution":{"observed_at":"2026-08-14T13:23:01.047369Z","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-14T13:23:01.028055Z","title":"Coloring un structured wireless multi-hop networks","venue":null,"work_id":"e168d0ab-a831-4d72-b009-8080fa6251e0","year":2009},"citing_paper":{"arxiv_id":"1908.05700","last_updated":"2019-08-15T18:31:16Z","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:23:00.955164Z"},"links":{"citing_paper":"/paper/1908.05700"},"observation_digest":"sha256:7b28bd76643c9a9e8ef643c287fe54f967d8e9055765c9d115f4b2afba757ec2","observation_id":"a46e7077-3cdd-42ae-93cf-ce1fa0747188","resolution":{"observed_at":"2026-08-14T13:23:01.032859Z","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.05700","last_updated":"2019-08-15T18:31:16Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T04:46:12.720632Z","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":14},"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 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.05700."}