{"as_of":"2026-08-08T05:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cb9c6ee81177bff42002af0e7d4e7ee8420a5f2ea404c8991e2247c6566e9a7","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:29:34.844309Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:45:04.577369Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.08405","snapshot_observed_at":"2026-08-02T22:45:04.577369Z","title":"https://arxiv.org/abs/2506.08405 Jose Blanchet, Guillermo Gallego, and Vineet Goyal","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16137","last_updated":"2026-06-20T12:00:41Z","snapshot_observed_at":"2026-08-07T07:47:11.779990Z","submitted_at":"2026-02-18T02:01:31Z","title":"Experimental Assortments for Choice Estimation and Nest Identification","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T22:45:04.577369Z"},"links":{"cited_paper":"/paper/2506.08405","citing_paper":"/paper/2602.16137"},"observation_digest":"sha256:33d45600d533c7b138b136bfc8b6b80d7ef725a0c43aa0335c74c8930108820d","observation_id":"f08c3db4-02f8-463f-b55d-fba92e1c8aae","resolution":{"observed_at":"2026-08-02T22:45:04.577369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.08405/citation-record","integrity":"/paper/2506.08405/integrity","json":"/paper/2506.08405/citation-record.json","paper":"/paper/2506.08405"},"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-07T05:29:35.775548Z","title":"Learning a hidden subgraph","venue":null,"work_id":"6ad1df40-8ad4-4653-b489-340eea6475f3","year":2005},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.568990Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7153d4b6d5a447b479246bc479605ff94e240c2a99ed84afff63b2c25bf68047","observation_id":"b7f2732f-65b5-4bfe-99ae-0e6d3b9678d7","resolution":{"observed_at":"2026-08-07T05:29:35.780703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.759058Z","title":null,"venue":null,"work_id":"51f0ccbd-212f-42f3-959c-3444aa4d211c","year":2019},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.574730Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:ea5768610b70f83295e835c83a7168cf05d72bdf337cbaffe42024fc2244f3a5","observation_id":"9a33bb08-4a6f-4c87-b2aa-92ff61e501c2","resolution":{"observed_at":"2026-08-07T05:29:35.765117Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.743362Z","title":"Learning a hidden matching","venue":null,"work_id":"d2b0c773-5f60-4120-a0bf-96df1339bc01","year":2004},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.579774Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7afea8f2cf2fe2844968a3a70974b427665dbe4b92270abf658275f4c917d3da","observation_id":"3dfb3967-bf6d-4787-8c4d-e0e47aee2c23","resolution":{"observed_at":"2026-08-07T05:29:35.748065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.726697Z","title":"Learning a hidden graph using O(log n) queries per edge","venue":null,"work_id":"1f0abb09-a808-437f-8fc6-bad23e10e30e","year":2008},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.586250Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:a671555e203d24448333c25bd47a069ba523e463865bcda771dcbdc57dde483f","observation_id":"5142f172-8656-4634-a88c-c631884fd3a4","resolution":{"observed_at":"2026-08-07T05:29:35.731682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.710718Z","title":"Graph connectivity and single element recovery via linear and OR queries","venue":null,"work_id":"35d6a125-ff0e-42f2-ab33-e3c49f3a1293","year":2021},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.591381Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:6652fa96988e8d6f0d8610aa1831683e25c851fc227534b36659d8ed74f19453","observation_id":"dad32f75-17e1-436e-a2e0-eed50d1cd987","resolution":{"observed_at":"2026-08-07T05:29:35.716007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.693554Z","title":"Cut query algorithms with star contraction","venue":null,"work_id":"f40197df-87d0-4b28-8940-24c4b6057eea","year":2022},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.596533Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:3901b86caef72a6f517759d9d82f95d73cea07701fcee24f025691ff11bbfda4","observation_id":"34789df3-e07e-46d1-bb9d-86f2540b5f63","resolution":{"observed_at":"2026-08-07T05:29:35.698894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.676289Z","title":"Clustering with same-cluster queries","venue":null,"work_id":"4a6c0d8d-c5b1-43de-9e5c-af7381eac29a","year":2016},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.603221Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:da4eaee5f22b3724a30a095d2354b47dbadd11d47b6209962b60012130b0d17b","observation_id":"2e3ed162-a3d4-449c-a6e6-2a99428dd742","resolution":{"observed_at":"2026-08-07T05:29:35.681796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-05T18:39:32.015180Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-08-07T05:29:34.608425Z","title":"On the query complexity of connectivity with global queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.608425Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:6ee8fbb73a470b063b7893d89996da4043d58239726e27283e688a138efd22c8","observation_id":"b12858ba-b8b0-43c9-af63-fc054416dbdc","resolution":{"observed_at":"2026-08-07T05:29:34.608425Z","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-07T05:29:35.659042Z","title":"Deterministic edge connectivity and max flow using subquadratic cut queries","venue":null,"work_id":"a32949e0-c489-422d-a89c-490809972bc8","year":2025},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.614313Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b8ffbc117e2439c5ee3564d69edf3d2ba77a974d47813c3a5c33f68861f8b57a","observation_id":"8bbb0633-1a8e-4b46-96f3-ec3fbae205b9","resolution":{"observed_at":"2026-08-07T05:29:35.664312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.642637Z","title":"Clustering with interactive feedback","venue":null,"work_id":"da148487-e85c-4882-9992-bbe01ce20178","year":2008},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.619534Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:2f3cb6a45bc07bc7113b602955319221a96f7d441189ca639171150b39dba9ab","observation_id":"d46bbfc5-26b3-47cc-b451-d8e4c8a55d74","resolution":{"observed_at":"2026-08-07T05:29:35.647625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.626317Z","title":"Exact recovery of mangled clusters with same-cluster queries","venue":null,"work_id":"466cd16c-77e2-42e9-898f-9383f640a778","year":2020},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.624585Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b96ba999166353810c50211a65859b966e6cb3e0b5f33de658656b62606abb6e","observation_id":"2126f4a2-d490-4aee-a214-ff79db9ea1af","resolution":{"observed_at":"2026-08-07T05:29:35.631612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.608267Z","title":"Near-optimal column-based matrix reconstruction","venue":null,"work_id":"c81dab3b-5467-40ee-b1af-1a51ac659274","year":2014},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.630360Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b5a8b3a961d3514569c054d2138198be5460dcce0a2c64c31f9f2d65153ac3c4","observation_id":"638146f9-4626-45ca-bee8-6133c05a8c7a","resolution":{"observed_at":"2026-08-07T05:29:35.614156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.591365Z","title":"Shankar Ram","venue":null,"work_id":"472f3f81-0d54-41c8-b9df-0a88e94d6ba5","year":2006},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.635344Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b1eef5b83c19e9faa3ed54ef6406bdb8e2d3dec60ba60c021fff22efbf7f76c2","observation_id":"ff2f1f00-4e38-496e-a323-65b8d213cdda","resolution":{"observed_at":"2026-08-07T05:29:35.596456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:34.641285Z","title":"Estimating the number of species: a review","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.641285Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:c99ea573663c39200eab0d6b7339abd370827a514774bcd6d9e6fa458ae4c1d8","observation_id":"92c392a3-edc2-4bfb-9f67-ee0d6d8431ab","resolution":{"observed_at":"2026-08-07T05:29:34.641285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-04T10:42:38.289722Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-07T05:29:34.645998Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.645998Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7deb32f3fcbd557b0869ce034e4f698c3b9e150574ec3debab2fb160094f75df","observation_id":"3c24af9a-74e8-4676-afd0-7cca55b53131","resolution":{"observed_at":"2026-08-07T05:29:34.645998Z","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-07T05:29:35.563800Z","title":"Clustering with non-adaptive subset queries","venue":null,"work_id":"c5451a21-5e7d-43cd-a72e-35de0073777e","year":2024},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.651709Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b56df1d617028056f24f7ffcadeb637eea0282e0cc269ea06aad0bce665dcfbe","observation_id":"9baa50de-5c01-4d26-bec0-b5bf1ee357cb","resolution":{"observed_at":"2026-08-07T05:29:35.568742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.547069Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":"1995acae-12a9-4c59-b2b4-99e200e1b313","year":2011},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.656595Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:e9c2fc023e6a2f5312de30bb6fb11ae405096543e0febd2c858b8a5c999ed212","observation_id":"5bc1c688-9bd7-4469-8c67-7d3f33b0a141","resolution":{"observed_at":"2026-08-07T05:29:35.552141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.529257Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":"f96bc3e7-1202-465d-bc45-9399d1c3f87c","year":2012},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.661636Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:49a3231c62e2f07907210f06c1f0f858ca5e75bb38f43dbbb2d121fbcbff7815","observation_id":"09d30aa3-611b-486b-9996-4da250ba77f1","resolution":{"observed_at":"2026-08-07T05:29:35.535781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.511869Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":"1c98bcb7-0860-41c8-87a2-f9c774317404","year":2015},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.667379Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:0541fdbf5b926d36c7f26bf3a5558deacbe32fe94f45aa6441536d885b2ace51","observation_id":"64b7b2f0-70f5-4811-8891-20f4b53727ee","resolution":{"observed_at":"2026-08-07T05:29:35.517248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.495509Z","title":"Nearly optimal communication and query complexity of bipartite matching","venue":null,"work_id":"7ae27072-24f3-4bf6-885d-fe4ef76c6b21","year":2022},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.672515Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:9fdef5893fab7c5925a48a0a90ade4ff58d317c8158ae300b0dec4e09df4d00e","observation_id":"e21ed951-c66c-471d-9060-1e7643a5b013","resolution":{"observed_at":"2026-08-07T05:29:35.501051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.477741Z","title":"Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu","venue":null,"work_id":"0fc0be08-90e7-419d-b20e-e33564f95d4b","year":2015},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.677716Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:3ea12388494f3647cb963c53611adcc03269b8a661fd607ce3a2d0ea9cda48bf","observation_id":"e4c2053b-0b50-4fbb-bd29-80526db618a4","resolution":{"observed_at":"2026-08-07T05:29:35.483498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.458937Z","title":"Separating words and trace reconstruction","venue":null,"work_id":"619bd0d0-880e-4cfa-b655-a1b1853f85f8","year":2021},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.683903Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:f425abd995d49ebe51b21d7d0a727b3014fa572e57a3209c9680038b4c2a720c","observation_id":"ae92c06e-f946-4a2b-a8b1-85a6bb7fd99e","resolution":{"observed_at":"2026-08-07T05:29:35.465938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.441441Z","title":"Polynomial time optimal query algorithms for finding graphs with arbitrary real weights","venue":null,"work_id":"0818baca-b8d9-40db-88f8-d95d4ae21986","year":2013},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.689300Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:8c953854e158a082a09e84ff69b1e434d1f4c1548c5cee7b545ea16fffff2180","observation_id":"220d3a17-9ad8-4c6f-b40b-f51dd041d171","resolution":{"observed_at":"2026-08-07T05:29:35.447724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.423444Z","title":"Optimal query complexity bounds for finding graphs","venue":null,"work_id":"1bafd7a9-3c39-4c70-a03f-30f0120a4393","year":2010},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.694028Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:e6182190f1af907b522f579c27bb3b46d44fe138da5b6ed7b391c0bee6f22a31","observation_id":"ebef7014-c734-4364-8525-f717da0ef203","resolution":{"observed_at":"2026-08-07T05:29:35.429202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.405523Z","title":"A query algorithm for learning a spanning forest in weighted undirected graphs","venue":null,"work_id":"2b20b68f-35ee-41d0-8861-1496361c5699","year":2023},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.699071Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b4cdc6477985bf9d9b1f571022f5ddb01fcabd6ce6fbe9b33525ee87dc31b78a","observation_id":"dfdd8d53-0f7a-4f6f-ac7f-bed43ea74acf","resolution":{"observed_at":"2026-08-07T05:29:35.412472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.388693Z","title":"Learning partitions using rank queries","venue":null,"work_id":"a80ec6df-8a0e-4eed-830d-5a265ab29f2d","year":2024},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.703774Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:8f65dcf4cbded513dc5b5b3a6425809ea280d6dc967fc191cf134107e72f6db7","observation_id":"52bd5099-fcd2-4f03-ae3b-ff60360080e6","resolution":{"observed_at":"2026-08-07T05:29:35.394264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.370225Z","title":"Optimal algorithms for learning partitions with faulty oracles","venue":null,"work_id":"4be2ca15-bb16-4dcd-8155-ab9c289de385","year":2024},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.708292Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:eeb8fd9f7fa4872cac6664e2e3d47594b94a0ed9e6dbfa6e47b5fe52f485b70e","observation_id":"3abe0831-cd56-4861-9d37-d788870db49a","resolution":{"observed_at":"2026-08-07T05:29:35.375673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.352845Z","title":"Clustering with queries under semi-random noise","venue":null,"work_id":"e25fb641-9e4c-4fff-bfc6-45a943f5edc8","year":2022},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.714132Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:462835f1ec6f0707ff2c7d818cf78048f5253831a993ef52528b45809671116a","observation_id":"fcdaad5f-24b3-4847-9e15-84a682e4d71f","resolution":{"observed_at":"2026-08-07T05:29:35.358732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.335244Z","title":"Network discovery and verification with distance queries","venue":null,"work_id":"1a520826-89c8-4c72-a449-bb3afecbbfe6","year":2006},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.719505Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:820be8d1c6b050a07c1a0877a4f9106b9039ff0655f0800f7a53569e2d9a65f4","observation_id":"e028d3ca-11b0-41ea-9bab-9598512344d7","resolution":{"observed_at":"2026-08-07T05:29:35.340459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.316796Z","title":"Estimation of the number of connected components in a graph by using a sampled subgraph","venue":null,"work_id":"7b9c4a97-b779-446d-b6c5-75e40b8b4838","year":1978},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.725122Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:b10c1d89ab88fe7d2daf9e1e02a219dc3626eff213632ef00868810491a9a931","observation_id":"31ebe850-e28b-432e-88e1-99c24ad2fd43","resolution":{"observed_at":"2026-08-07T05:29:35.323455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.299076Z","title":"Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping","venue":null,"work_id":"88756458-0d75-4454-a294-9f03fe735d8f","year":1998},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.730180Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:3aa8128c41298520b685fade286943db87d81126bacf06fa3d93fd758e30eff0","observation_id":"42f910a3-ec83-46a2-a509-4e74553b6c5b","resolution":{"observed_at":"2026-08-07T05:29:35.305288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.280143Z","title":"Optimal reconstruction of graphs under the additive model","venue":null,"work_id":"9839d29b-f047-4d33-9ba4-f8cf32092bce","year":2000},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.735146Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:a5ed07fd2446c3994a78af622bffffeccb3453698f69bd13066e6e937d01fcb6","observation_id":"a13d3921-d59a-4613-a0c1-6a5ad6cb1772","resolution":{"observed_at":"2026-08-07T05:29:35.287140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.260012Z","title":"MST in log-star rounds of congested clique","venue":null,"work_id":"0870c964-8411-48af-b41c-aa25660a43ac","year":2016},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.740095Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:a7091c6bbb6d155e21e356d6c7e931429b9b8c30d5e4f8735647fdb4c9a0faa9","observation_id":"dc2545fa-9da4-4cfb-ac72-6135467cb7b9","resolution":{"observed_at":"2026-08-07T05:29:35.266062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.243287Z","title":"On the power of additive combinatorial search model","venue":null,"work_id":"33bc93fb-e41a-447d-aa4f-485b7b4ec15d","year":1998},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.744853Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7d052156e1386d2253204bb1ff1dd53287e2d05b548c0366d07041d8d2c3b0ce","observation_id":"a102f77d-fac9-4416-a63b-ac8e1aaf2666","resolution":{"observed_at":"2026-08-07T05:29:35.248859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.225956Z","title":"Matchings, matroids and submodular functions","venue":null,"work_id":"eb1778bc-1fa0-4957-be9f-827b52473b6b","year":2008},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.749779Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:cc516871d474c83addbb5bdce3eb8c21c6bed07526d093c52bff57db6a0f0ac7","observation_id":"8e8e1aa9-5af9-4c1f-bfda-3bd6415a623f","resolution":{"observed_at":"2026-08-07T05:29:35.231880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.209289Z","title":"Same-cluster querying for overlapping clusters","venue":null,"work_id":"7d985255-7692-4a37-8d93-27d6d9933af0","year":2019},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.754776Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7bdc44a36089394e5af0ae68d4976750dfdb15392b9c346aea2c779588eb8506","observation_id":"8c7a18ca-ff40-4a0b-b000-3354c58450df","resolution":{"observed_at":"2026-08-07T05:29:35.215173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.192707Z","title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","venue":null,"work_id":"6d34c6d3-8541-4fc6-b09c-866f94caa041","year":2018},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.760225Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:8c9819d6b10a05aee7455a9f0d5d005032cba45d50199f3bc357d6a3bad0499a","observation_id":"16987816-6651-404e-9a4e-7bc1ffb96b6d","resolution":{"observed_at":"2026-08-07T05:29:35.197878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.176083Z","title":"Reconstructing cactus graphs from shortest path information - (extended abstract)","venue":null,"work_id":"6cf2b31c-987b-412b-8a26-c21637c7abc3","year":2016},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.765329Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:c0958f90399f7dc42b58c4408445e4e3f6c0f91b7576c63f7a11eaf0b203adb8","observation_id":"fdbbabc3-1b8f-4f73-a8f4-15e3abc03271","resolution":{"observed_at":"2026-08-07T05:29:35.181646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.159843Z","title":"Implicit routing and shortest path information (extended abstract)","venue":null,"work_id":"32401881-852b-4f03-bb60-87047d31a86a","year":1995},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.769881Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:afcab0ac59cd5be1cda062703ae3993c64a0e6eb60febd6ab2b215b31a40b0e6","observation_id":"5187aa90-6d51-4bf7-bb24-5f35a91ab048","resolution":{"observed_at":"2026-08-07T05:29:35.165099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.142893Z","title":"Near-linear query complexity for graph inference","venue":null,"work_id":"8ce5f090-83f8-4697-abcf-06aab2b3ebec","year":2015},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.774761Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:c176d603649161d79d2a3cb604e1e70d9546c39fd8e1f3db083dc97bf4076616","observation_id":"8804f210-3d32-4a8b-a2be-d6478dc86f73","resolution":{"observed_at":"2026-08-07T05:29:35.148524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.126069Z","title":"Graph reconstruction and verification","venue":null,"work_id":"aa4ca95b-e903-44d8-a648-4ef980f79bed","year":2018},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.780322Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:a48061b75092a4bd08c4e41e7b9758efe18772b0883f15a80e8134731c1fcc02","observation_id":"de9f8234-bbe1-4e7a-8460-a07846d109b7","resolution":{"observed_at":"2026-08-07T05:29:35.131453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.109720Z","title":"Graph reconstruction via MIS queries","venue":null,"work_id":"10296f76-2ee3-4edf-af4c-e8b1afc5cdc3","year":2025},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.784903Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:7153afd41b05a36a9a167ad7e400f68abd79a2ca658a4b2087b30a85e42eb48a","observation_id":"e81f99be-6801-45d8-8e3d-846b358ebccf","resolution":{"observed_at":"2026-08-07T05:29:35.115155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.093936Z","title":"Learning spanning forests optimally in weighted undirected graphs with CUT queries","venue":null,"work_id":"35f23b25-40bb-4aa3-b95b-4f02eba07ef4","year":2024},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.790578Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:8a07eff880fdb35b498cad635486152a5d041c68623f32dbd7d2b8aa6fcd8c8c","observation_id":"10a5a9a1-dc1e-4179-b0c4-65d748bc1d05","resolution":{"observed_at":"2026-08-07T05:29:35.098741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.076850Z","title":"Tight query complexity bounds for learning graph partitions","venue":null,"work_id":"fa0e5487-dc48-4df0-b349-6d2bbd8ca554","year":2022},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.796383Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:085b81c759e7b9b9f80fc2c83d7f96bf1deac8972e6d15c882dbd250bf4ad7e2","observation_id":"8af7909e-1783-4e9f-9f3c-5274b6a0a7bc","resolution":{"observed_at":"2026-08-07T05:29:35.081889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.059934Z","title":"Optimally reconstructing weighted graphs using queries","venue":null,"work_id":"c7cee173-ec17-448b-8f13-0076959a8a70","year":2010},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.801454Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:c43527a54acd3bcaef1ea3b5cfedcec509c12b49d659caac0ab7a2cfc1e42f92","observation_id":"cbf173b2-3f13-431d-b9e4-76e26f75ab5e","resolution":{"observed_at":"2026-08-07T05:29:35.065034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.043151Z","title":"Clustering with noisy queries","venue":null,"work_id":"1c8d049f-19e1-4ecd-8b03-ed442dec05a1","year":2017},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.806659Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:85779a98f5ef94638f2b02e08e68e8059b68310f480a4ffc9e40b9b1ae07ad28","observation_id":"83c4d69c-df8a-40ce-a184-15fb422c4770","resolution":{"observed_at":"2026-08-07T05:29:35.048233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.025798Z","title":"Query complexity of clustering with side information","venue":null,"work_id":"37511a80-75c2-47bc-8955-1ac495458796","year":2017},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.812135Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:3fe36b080ad937881933aaf9bf98f798bdf812f371d40288358a0e8ae6caeb43","observation_id":"e011c643-f158-4307-aaba-30d6096538e0","resolution":{"observed_at":"2026-08-07T05:29:35.031717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:35.002182Z","title":"A theoretical analysis of first heuristics of crowdsourced entity resolution","venue":null,"work_id":"e16edfe9-172a-420f-8b02-605fd29ce4ce","year":2017},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.817247Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:8dee37b8f7a3ac5af979da304ef15be1c5bdc52a1f8c59c1351fc86c13232516","observation_id":"f8d5387a-acfd-4592-a9d6-fe8f8fc2c35e","resolution":{"observed_at":"2026-08-07T05:29:35.012295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.00750","last_updated":"2016-10-04T17:23:11Z","snapshot_observed_at":"2026-07-06T05:09:08.360468Z","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","version":2},"cited_work":{"arxiv_id":"1609.00750","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.00750","snapshot_observed_at":"2026-08-07T05:29:34.882872Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","venue":"cs.DS","work_id":"3c5a9205-4648-4f83-a3ad-7cb93e6718f9","year":2016},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.822187Z"},"links":{"cited_paper":"/paper/1609.00750","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:75976920f255e86abc9836381c9123f52f21938d4a6420a5d28e1a81f25c60dc","observation_id":"2bab7895-e125-4991-8f8e-94c19857a465","resolution":{"observed_at":"2026-08-07T05:29:34.890293Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:34.985749Z","title":"Graph reconstruction via distance oracles","venue":null,"work_id":"f8745b54-8fa3-4b39-a0eb-a970eb45771e","year":2013},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.828342Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:ebe02cf7ada68b312e8aa39414756cc7a0d05d9ff4b17de9797b5b0c2ae8680a","observation_id":"809dc0cb-927b-42a9-8511-3a876ae6c87c","resolution":{"observed_at":"2026-08-07T05:29:34.990938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:34.969443Z","title":"A simple algorithm for graph reconstruction","venue":null,"work_id":"41d1fce3-d37a-4887-8aad-ce3bcef3794c","year":2023},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.834277Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:49551574965932f43995279b8aa86c692d5737ec4571246a4e5678a7a1ce8e3d","observation_id":"c8acc404-18b7-4496-a99c-cb25f2858a22","resolution":{"observed_at":"2026-08-07T05:29:34.974757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:34.953041Z","title":"Learning and verifying graphs using queries with a focus on edge counting","venue":null,"work_id":"6e4ea49f-7a52-4414-8fb1-677096f1aff9","year":2007},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.839454Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:32dc5ac790090d71a70c3ccec82ff850bf13afbd58041dc7da07d0549891d178","observation_id":"36b8910e-f8ea-46e7-974a-7d6020219a02","resolution":{"observed_at":"2026-08-07T05:29:34.958227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:29:34.935630Z","title":"Correlation clustering with same-cluster queries bounded by optimal cost","venue":null,"work_id":"6702b702-232b-4af6-99af-ccd387fc988c","year":2019},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.844309Z"},"links":{"citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:3db8bc2ef4349f02746f7933471b8e565cbb78aee8b553bfc9ee7cd2b806d286","observation_id":"ae82d4da-48d4-403f-a59f-ba4ed0b2ef10","resolution":{"observed_at":"2026-08-07T05:29:34.941496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T05:09:37.522239Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":53},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2506.08405."}