{"as_of":"2026-08-16T17:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61d42d6b12254ffb83c94afb2da73283c00f347bc0650bc67c2e61f5760ddd96","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:42:07.531862Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"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.03022/citation-record","integrity":"/paper/1908.03022/integrity","json":"/paper/1908.03022/citation-record.json","paper":"/paper/1908.03022"},"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:42:07.826252Z","title":"Explicit construction of exponential sized families of k-independent sets","venue":null,"work_id":"2283bcf0-b231-47e6-b62d-330217af9633","year":1986},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.441698Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:bbdef73812c2d37472483186156197b5f7c657e714d51a42295dda22402bad1c","observation_id":"b5dc6d9c-ad52-4950-8187-3c53801f2002","resolution":{"observed_at":"2026-08-14T14:42:07.829380Z","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:42:07.817783Z","title":"Deterministic combinatorial replacement paths and distance sensitivity oracles","venue":null,"work_id":"8a1572be-56ed-4f9b-beec-fdc1b79d4cc6","year":2019},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.445324Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:5da32eb300cc2e3d69d713751a00f25af9779122ac0cc71bdc83d483df98e9ce","observation_id":"c80936f5-8bff-4dbe-9a74-ffe2e0853831","resolution":{"observed_at":"2026-08-14T14:42:07.820873Z","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:42:07.808414Z","title":"Fast distributed approximation for TAP and 2-edge-connectivity","venue":null,"work_id":"a5b55118-9743-4652-ad41-deaf22cca0e3","year":2017},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.448530Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:32cd00df0bd7a893424871b95f7e8bcf3f25380fe03f58de9836b71ac9d6c1e9","observation_id":"4b9963a3-1dde-40f4-ad39-b9c599774d4b","resolution":{"observed_at":"2026-08-14T14:42:07.811495Z","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:42:07.799729Z","title":"Fault tolerant spanners for general graphs","venue":null,"work_id":"115bacb4-8517-4b1a-8808-10380d8063fb","year":2010},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.451567Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:ba53b282db82d3e0bd810bd585a25238059ddf0adb0e52f505cfa3f60a096376","observation_id":"7229e383-a566-4095-b938-8f47fb9fea94","resolution":{"observed_at":"2026-08-14T14:42:07.802671Z","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:42:07.790469Z","title":"Distributed edge connectivity in sublinear time","venue":null,"work_id":"3bd776ea-0e6d-4573-a0e2-fa7aa8c839f0","year":2019},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.454940Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:12d13d52a74ee0244ffb075424f9462c2e92558c6f459fc920e188aaa1807f6b","observation_id":"90cdde63-1286-478d-b621-4b7bded33bcf","resolution":{"observed_at":"2026-08-14T14:42:07.793946Z","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:42:07.781403Z","title":"Fault-tolerant spanners: better and simpler","venue":null,"work_id":"1feba701-edcd-4e2c-83fd-2e0652ef5ad1","year":2011},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.457886Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:89d896944987a7e94b8de371ea64264b833a5a24b57ffb1f4a8e005bd6eff8a0","observation_id":"d715aa03-d5d4-479c-a96c-0fe8f974f714","resolution":{"observed_at":"2026-08-14T14:42:07.784361Z","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:42:07.772255Z","title":"Distributed approximation of minimum k-edge-connected spanning subgraphs","venue":null,"work_id":"330154ca-2132-4986-8c05-2b2f063ecdf3","year":2018},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.461049Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:ed69478aaad780596f9fa2042bf42079656e9eb1282a3955a32ff9ac185199ce","observation_id":"15f16a2d-a944-4b79-89bf-d2297acbd0b5","resolution":{"observed_at":"2026-08-14T14:42:07.775455Z","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:42:07.763129Z","title":"On mixed connectivity certificates","venue":null,"work_id":"781e690b-4c53-4097-9c5f-57c6d64ccceb","year":1998},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.463812Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:c758f3b2226a343c00ee07932add6a2ac8bf9f8a81a384e106991fa8351e4dad","observation_id":"2ca3b0bd-345b-4391-9c47-d428d8849931","resolution":{"observed_at":"2026-08-14T14:42:07.766314Z","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:42:07.754133Z","title":"Constructing o (n log n) size monotone formulae for the k-th elementary symmetric polynomial of n boolean variables","venue":null,"work_id":"7efd7f21-e61d-4f74-909c-e3dced796018","year":1984},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.466534Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:06fe176e44954377ee1f9723bfc248a79a55b6f814de8db10e88add0e76b0aa9","observation_id":"0927518e-9918-440e-acba-564a560c43cb","resolution":{"observed_at":"2026-08-14T14:42:07.757414Z","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:42:07.744926Z","title":"Improved Distributed Algorithms for Fundamental Graph Problems","venue":null,"work_id":"939dfa39-6583-49da-8292-ee127e091e6f","year":2017},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.469376Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:9da4d89196275d0efe3b894ae3fd437e2273a57d0cc7c6522de929ea274a18a5","observation_id":"e615098d-a2b4-4a1f-8a8b-38cf136f251a","resolution":{"observed_at":"2026-08-14T14:42:07.748123Z","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:42:07.736026Z","title":"Distributed minimum cut approximation","venue":null,"work_id":"0dd93506-fec4-4aad-ad3a-d3bf368c3b1f","year":2013},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.472282Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:2df25e895c55caabc6f6395e031b086e9c94934a18c698c725c589e59c36ff64","observation_id":"8fff1102-f3cd-48fd-8814-195ec47874f0","resolution":{"observed_at":"2026-08-14T14:42:07.739065Z","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":"1305.5520","last_updated":"2013-11-20T19:16:07Z","snapshot_observed_at":"2026-08-15T00:16:48.829530Z","submitted_at":"2013-05-23T19:13:15Z","title":"Distributed Minimum Cut Approximation","version":2},"cited_work":{"arxiv_id":"1305.5520","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.5520","snapshot_observed_at":"2026-08-14T14:42:07.579912Z","title":"Distributed Minimum Cut Approximation","venue":"cs.DS","work_id":"a0dc2a67-18fc-40b2-a007-788460420747","year":2013},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.475071Z"},"links":{"cited_paper":"/paper/1305.5520","citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:c6af8a2c4ae504fd5d8135b08c9061adefc3d0acfbfb9e30e193b5a190156e23","observation_id":"bee75c45-7933-45b2-995e-451b9b2cd137","resolution":{"observed_at":"2026-08-14T14:42:07.583306Z","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-14T14:42:07.726647Z","title":"Derandomizing distributed algorithms with small messages: Spanners and dominating set","venue":null,"work_id":"753b98b4-7252-4c86-9f90-ad032fd22d1c","year":2018},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.478407Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:03cfe73136bed328cfceeff5b51566c8d83f3f5191f59ac9fe23d435f880c085","observation_id":"afee7bec-28ba-4fe6-9fec-b06a97fc454a","resolution":{"observed_at":"2026-08-14T14:42:07.730150Z","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:42:07.717193Z","title":"Random sampling in cut, flow, and network design problems","venue":null,"work_id":"e5da8b94-7f2f-4bbd-937d-77686b3b5ff8","year":1999},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.481341Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:dcabeb8945eb5627842869d5a8cce7249a53a744aa5874784e961ce04d787d7f","observation_id":"ee29e86b-0a18-4a99-8db2-a9d4a559debc","resolution":{"observed_at":"2026-08-14T14:42:07.720863Z","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:42:07.707653Z","title":"Efficient algorithms for constructing fault-tolerant geometric spanners","venue":null,"work_id":"efe70e05-321f-410f-8278-b11d81f6f624","year":1998},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.484179Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:0e9bb71db44716ab9489c8fbe3a546cbf82860a2c0b15f2f3055f42319f51730","observation_id":"e7eaeb4b-8e59-4df2-8efb-4cc2a8730a69","resolution":{"observed_at":"2026-08-14T14:42:07.711219Z","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:42:07.698617Z","title":"A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph","venue":null,"work_id":"99d6b43c-21b3-4ef8-8ca9-fbed7a0bc5cb","year":1992},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.487164Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:773842b4480b8997b79d5e72d9b7f24ff4c822eb12f81ff86c9c87737d6d9446","observation_id":"799c5689-4a70-4738-9504-549002357ab5","resolution":{"observed_at":"2026-08-14T14:42:07.701990Z","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:42:07.689366Z","title":"Almost-tight distributed minimum cut algorithms","venue":null,"work_id":"003c1726-1d0d-4c60-abad-35f1f3f92c0d","year":2014},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.490127Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:4f288f5192369c90df10a0aa3f22a52bfb8096cad2cdb1185a56446aad387638","observation_id":"bab6feb2-3d73-4712-9d56-646ceb50ea34","resolution":{"observed_at":"2026-08-14T14:42:07.692585Z","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:42:07.680118Z","title":"Low congestion cycle covers and their applications","venue":null,"work_id":"de3159c5-713f-457b-9f69-b4fa576101bd","year":2019},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.493181Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:2aa4570b7d709fc673f4cac7f7c1fa8f64f61bf556b84653e252b1e197d17b14","observation_id":"8e89e017-7913-4612-937c-223f39c13b2f","resolution":{"observed_at":"2026-08-14T14:42:07.683564Z","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:42:07.670940Z","title":"Optimal short cycle decomposition in almost linear time","venue":null,"work_id":"92c33d3e-256d-448a-954e-05ca55d1a101","year":2019},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.496261Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:abbdc2eba56483b9ada5daed15c7324d93b1e082689dc293788e51aac77b8759","observation_id":"e4a24864-c442-4884-9501-9bcd7db58c4c","resolution":{"observed_at":"2026-08-14T14:42:07.674287Z","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-14T14:42:07.499247Z","title":"Distributed Computing: A Locality-sensitive Approach","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.499247Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:6d9feba11c4038f8f97fa3d8489b4aef0f3b4e84d97917548ba4c083c80d0901","observation_id":"9b256475-c797-48a4-a951-cb75076b9df3","resolution":{"observed_at":"2026-08-14T14:42:07.499247Z","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/s00446-009-0091-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:42:07.556515Z","title":"Distributed algorithms for ultrasparse spanners and linear size skeletons","venue":null,"work_id":"751ddaa6-bc43-4532-934d-72f94838428c","year":2010},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.501980Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:96c7ad4d388a63d5dfc89f0571c5278a716a365f66f4fff57e42e09718bbe9c0","observation_id":"07e21ebd-ab7c-4d96-9a6f-1305d755f0cb","resolution":{"observed_at":"2026-08-14T14:42:07.562238Z","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-14T14:42:07.656006Z","title":"Fast computation of small cuts via cycle space sampling","venue":null,"work_id":"13d30b9f-d70f-4ac4-946a-38be32f07ce1","year":2011},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.505046Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:3710fc9116a8fd07da21ebe2c1b61f9d4574ae21015adb226032e00d533c4b1b","observation_id":"2926e4f1-53e7-40e5-883c-d3c4f046c7f3","resolution":{"observed_at":"2026-08-14T14:42:07.659489Z","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.10937","last_updated":"2020-05-10T18:24:18Z","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10937","snapshot_observed_at":"2026-08-14T14:42:07.507886Z","title":"Polylogarithmic-time deterministic network decomposition and distributed derandomization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.507886Z"},"links":{"cited_paper":"/paper/1907.10937","citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:036b3caa8cf55945d29788f14054209ea07ac10ed430235b5f64af6509d64d94","observation_id":"15f43d1a-d12a-4ae9-9a3e-a61395e8de52","resolution":{"observed_at":"2026-08-14T14:42:07.507886Z","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-14T14:42:07.646945Z","title":"Distributed verification and hardness of distributed approximation","venue":null,"work_id":"57db47be-3d75-4ef7-911c-e03900644505","year":2012},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.511006Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:685d589ce1fefa96d29d3e81b8012f25e0cfeefe0d66cf5724133bbe23230eee","observation_id":"c2cc0a8d-e04d-48df-8273-5be9642a49bf","resolution":{"observed_at":"2026-08-14T14:42:07.650334Z","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:42:07.638289Z","title":"Sub-linear distributed algorithms for sparse certificates and biconnected components","venue":null,"work_id":"c4fed2db-d8df-4cd4-9121-3ac0da0cc4a6","year":1997},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.513726Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:1fd7f4db606766b20a6ca81a9751d29578e7e3c58fcf6096e3ba2d4dd102d24c","observation_id":"c4747885-148b-44bb-a439-07737cdd20ba","resolution":{"observed_at":"2026-08-14T14:42:07.641382Z","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-14T14:42:07.516373Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.516373Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:4b6d667d2823fbcf58430563c45f72caecad74d027b2129fa534dc5c87ecc6c7","observation_id":"eec93fd5-62e7-428a-92ab-c6449b31cc88","resolution":{"observed_at":"2026-08-14T14:42:07.516373Z","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-14T14:42:07.628687Z","title":"Complex networks: small-world, scale-free and beyond","venue":null,"work_id":"8d41004e-ec6c-42d8-9246-04c31a99467b","year":2003},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.520319Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:95234aaef635bf07e48d69773ab9f98900e3a656ebe781ccddf80c4f12ddee07","observation_id":"c826d954-1cb2-458b-8efa-810ab331a5a7","resolution":{"observed_at":"2026-08-14T14:42:07.632045Z","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:42:07.618984Z","title":"Replacement paths and distance sensitivity oracles via fast matrix multiplication","venue":null,"work_id":"61ffaf0f-eef2-4bc3-a0e4-b118c89eb11d","year":2013},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.523034Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:886646829d975f2ae43b557bb91ed28a322d483439698feb56cf7e391752428e","observation_id":"a0bec9b1-01e0-4361-b025-d531107b3936","resolution":{"observed_at":"2026-08-14T14:42:07.622212Z","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:42:07.608768Z","title":"Improved Distributed Algorithms for Fundamental Graph Problems","venue":null,"work_id":"cfc411c0-1e9e-4333-9cdf-e4b8185c51d1","year":2017},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.526200Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:3e51e3e7203db744c88a6e9aa43987f0eef4a86b2c9f5c4a10a9d057cbd603d4","observation_id":"78d66a6e-158a-400c-bbd9-5d49ec41ab8f","resolution":{"observed_at":"2026-08-14T14:42:07.612396Z","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:42:07.599234Z","title":"Distributed algorithms for ultrasparse spanners and linear size skeletons","venue":null,"work_id":"9d5753a7-c345-43b9-bd32-092fae82f34f","year":2010},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.529094Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:8ec7e6c8caf0cbe47f2eb909d324132cf4bf105b6c91a5e685722a4d01ecd9bc","observation_id":"3bf42732-764f-41af-bca5-527ced11e618","resolution":{"observed_at":"2026-08-14T14:42:07.602575Z","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:42:07.589677Z","title":null,"venue":null,"work_id":"c6ac377e-c4e5-40e1-8295-8f9dd8151389","year":2012},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.531862Z"},"links":{"citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:a40247b80dfb455297812198d72a43af914e7c11981a2f391b22ab4a660924f3","observation_id":"90be929d-0afa-4599-9a18-ebd5e51559a4","resolution":{"observed_at":"2026-08-14T14:42:07.592912Z","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.03022","last_updated":"2020-08-03T13:53:51Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":25},"total_outbound_references":31},"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 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.03022."}