Paper Citation Record · LEDGER

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs

As of 7 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2506.08405.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.08405 v1

Coverage vector

measured 53 of 53 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T05:29:34.844309Z

measured 54 of 54 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T22:45:04.577369Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

53 of 53 outbound references displayed

verified exact1
verified fuzzy48
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b7f2732f-65b5-4bfe-99ae-0e6d3b9678d7 · outbound

This paper cites Learning a hidden subgraph.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning a hidden subgraph

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.780703Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 9a33bb08-4a6f-4c87-b2aa-92ff61e501c2 · outbound

This paper cites an unresolved cited work.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:29:35.765117Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3dfb3967-bf6d-4787-8c4d-e0e47aee2c23 · outbound

This paper cites Learning a hidden matching.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning a hidden matching

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.748065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5142f172-8656-4634-a88c-c631884fd3a4 · outbound

This paper cites Learning a hidden graph using O(log n) queries per edge.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning a hidden graph using O(log n) queries per edge

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.731682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dad32f75-17e1-436e-a2e0-eed50d1cd987 · outbound

This paper cites Graph connectivity and single element recovery via linear and OR queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Graph connectivity and single element recovery via linear and OR queries

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.716007Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 34789df3-e07e-46d1-bb9d-86f2540b5f63 · outbound

This paper cites Cut query algorithms with star contraction.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Cut query algorithms with star contraction

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.698894Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2e3ed162-a3d4-449c-a6e6-2a99428dd742 · outbound

This paper cites Clustering with same-cluster queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Clustering with same-cluster queries

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.681796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation b12858ba-b8b0-43c9-af63-fc054416dbdc · outbound

This paper cites On the query complexity of connectivity with global queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs On the query complexity of connectivity with global queries

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T05:29:34.608425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8bbb0633-1a8e-4b46-96f3-ec3fbae205b9 · outbound

This paper cites Deterministic edge connectivity and max flow using subquadratic cut queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Deterministic edge connectivity and max flow using subquadratic cut queries

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.664312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d46bbfc5-26b3-47cc-b451-d8e4c8a55d74 · outbound

This paper cites Clustering with interactive feedback.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Clustering with interactive feedback

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.647625Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2126f4a2-d490-4aee-a214-ff79db9ea1af · outbound

This paper cites Exact recovery of mangled clusters with same-cluster queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Exact recovery of mangled clusters with same-cluster queries

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.631612Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 638146f9-4626-45ca-bee8-6133c05a8c7a · outbound

This paper cites Near-optimal column-based matrix reconstruction.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Near-optimal column-based matrix reconstruction

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.614156Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ff2f1f00-4e38-496e-a323-65b8d213cdda · outbound

This paper cites Shankar Ram.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Shankar Ram

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.596456Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 92c392a3-edc2-4bfb-9f67-ee0d6d8431ab · outbound

This paper cites Estimating the number of species: a review.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Estimating the number of species: a review

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T05:29:34.641285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c24af9a-74e8-4676-afd0-7cca55b53131 · outbound

This paper cites Optimal distance query reconstruction for graphs without long induced cycles.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimal distance query reconstruction for graphs without long induced cycles

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T05:29:34.645998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9baa50de-5c01-4d26-bec0-b5bf1ee357cb · outbound

This paper cites Clustering with non-adaptive subset queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Clustering with non-adaptive subset queries

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.568742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5bc1c688-9bd7-4469-8c67-7d3f33b0a141 · outbound

This paper cites Bshouty and Hanna Mazzawi.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Bshouty and Hanna Mazzawi

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.552141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 09d30aa3-611b-486b-9996-4da250ba77f1 · outbound

This paper cites Bshouty and Hanna Mazzawi.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Bshouty and Hanna Mazzawi

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.535781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 64b7b2f0-70f5-4811-8891-20f4b53727ee · outbound

This paper cites Bshouty and Hanna Mazzawi.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Bshouty and Hanna Mazzawi

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.517248Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e21ed951-c66c-471d-9060-1e7643a5b013 · outbound

This paper cites Nearly optimal communication and query complexity of bipartite matching.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Nearly optimal communication and query complexity of bipartite matching

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.501051Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e4c2053b-0b50-4fbb-bd29-80526db618a4 · outbound

This paper cites Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.483498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ae92c06e-f946-4a2b-a8b1-85a6bb7fd99e · outbound

This paper cites Separating words and trace reconstruction.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Separating words and trace reconstruction

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.465938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 220d3a17-9ad8-4c6f-b40b-f51dd041d171 · outbound

This paper cites Polynomial time optimal query algorithms for finding graphs with arbitrary real weights.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Polynomial time optimal query algorithms for finding graphs with arbitrary real weights

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.447724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ebef7014-c734-4364-8525-f717da0ef203 · outbound

This paper cites Optimal query complexity bounds for finding graphs.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimal query complexity bounds for finding graphs

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.429202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dfdd8d53-0f7a-4f6f-ac7f-bed43ea74acf · outbound

This paper cites A query algorithm for learning a spanning forest in weighted undirected graphs.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs A query algorithm for learning a spanning forest in weighted undirected graphs

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.412472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 52bd5099-fcd2-4f03-ae3b-ff60360080e6 · outbound

This paper cites Learning partitions using rank queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning partitions using rank queries

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.394264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3abe0831-cd56-4861-9d37-d788870db49a · outbound

This paper cites Optimal algorithms for learning partitions with faulty oracles.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimal algorithms for learning partitions with faulty oracles

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.375673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fcdaad5f-24b3-4847-9e15-84a682e4d71f · outbound

This paper cites Clustering with queries under semi-random noise.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Clustering with queries under semi-random noise

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.358732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e028d3ca-11b0-41ea-9bab-9598512344d7 · outbound

This paper cites Network discovery and verification with distance queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Network discovery and verification with distance queries

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.340459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 31ebe850-e28b-432e-88e1-99c24ad2fd43 · outbound

This paper cites Estimation of the number of connected components in a graph by using a sampled subgraph.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Estimation of the number of connected components in a graph by using a sampled subgraph

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.323455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 42f910a3-ec83-46a2-a509-4e74553b6c5b · outbound

This paper cites Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.305288Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a13d3921-d59a-4613-a0c1-6a5ad6cb1772 · outbound

This paper cites Optimal reconstruction of graphs under the additive model.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimal reconstruction of graphs under the additive model

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.287140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dc2545fa-9da4-4cfb-ac72-6135467cb7b9 · outbound

This paper cites MST in log-star rounds of congested clique.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs MST in log-star rounds of congested clique

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.266062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a102f77d-fac9-4416-a63b-ac8e1aaf2666 · outbound

This paper cites On the power of additive combinatorial search model.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs On the power of additive combinatorial search model

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.248859Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8e8e1aa9-5af9-4c1f-bfda-3bd6415a623f · outbound

This paper cites Matchings, matroids and submodular functions.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Matchings, matroids and submodular functions

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.231880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8c7a18ca-ff40-4a0b-b000-3354c58450df · outbound

This paper cites Same-cluster querying for overlapping clusters.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Same-cluster querying for overlapping clusters

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.215173Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 16987816-6651-404e-9a4e-7bc1ffb96b6d · outbound

This paper cites Subpolynomial trace reconstruction for random strings and arbitrary deletion probability.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Subpolynomial trace reconstruction for random strings and arbitrary deletion probability

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.197878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fdbbabc3-1b8f-4f73-a8f4-15e3abc03271 · outbound

This paper cites Reconstructing cactus graphs from shortest path information - (extended abstract).

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Reconstructing cactus graphs from shortest path information - (extended abstract)

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.181646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5187aa90-6d51-4bf7-bb24-5f35a91ab048 · outbound

This paper cites Implicit routing and shortest path information (extended abstract).

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Implicit routing and shortest path information (extended abstract)

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.165099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8804f210-3d32-4a8b-a2be-d6478dc86f73 · outbound

This paper cites Near-linear query complexity for graph inference.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Near-linear query complexity for graph inference

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.148524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation de9f8234-bbe1-4e7a-8460-a07846d109b7 · outbound

This paper cites Graph reconstruction and verification.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Graph reconstruction and verification

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.131453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e81f99be-6801-45d8-8e3d-846b358ebccf · outbound

This paper cites Graph reconstruction via MIS queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Graph reconstruction via MIS queries

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.115155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 10a5a9a1-dc1e-4179-b0c4-65d748bc1d05 · outbound

This paper cites Learning spanning forests optimally in weighted undirected graphs with CUT queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning spanning forests optimally in weighted undirected graphs with CUT queries

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.098741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8af7909e-1783-4e9f-9f3c-5274b6a0a7bc · outbound

This paper cites Tight query complexity bounds for learning graph partitions.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Tight query complexity bounds for learning graph partitions

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.081889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation cbf173b2-3f13-431d-b9e4-76e26f75ab5e · outbound

This paper cites Optimally reconstructing weighted graphs using queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimally reconstructing weighted graphs using queries

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.065034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 83c4d69c-df8a-40ce-a184-15fb422c4770 · outbound

This paper cites Clustering with noisy queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Clustering with noisy queries

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.048233Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e011c643-f158-4307-aaba-30d6096538e0 · outbound

This paper cites Query complexity of clustering with side information.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Query complexity of clustering with side information

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.031717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f8d5387a-acfd-4592-a9d6-fe8f8fc2c35e · outbound

This paper cites A theoretical analysis of first heuristics of crowdsourced entity resolution.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs A theoretical analysis of first heuristics of crowdsourced entity resolution

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:35.012295Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2bab7895-e125-4991-8f8e-94c19857a465 · outbound

This paper cites Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries

Reference 49

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:29:34.890293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 809dc0cb-927b-42a9-8511-3a876ae6c87c · outbound

This paper cites Graph reconstruction via distance oracles.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Graph reconstruction via distance oracles

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:34.990938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c8acc404-18b7-4496-a99c-cb25f2858a22 · outbound

This paper cites A simple algorithm for graph reconstruction.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs A simple algorithm for graph reconstruction

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:34.974757Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 36b8910e-f8ea-46e7-974a-7d6020219a02 · outbound

This paper cites Learning and verifying graphs using queries with a focus on edge counting.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Learning and verifying graphs using queries with a focus on edge counting

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:34.958227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ae82d4da-48d4-403f-a59f-ba4ed0b2ef10 · outbound

This paper cites Correlation clustering with same-cluster queries bounded by optimal cost.

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Correlation clustering with same-cluster queries bounded by optimal cost

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:29:34.941496Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

Observation f08c3db4-02f8-463f-b55d-fba92e1c8aae · inbound

Experimental Assortments for Choice Estimation and Nest Identification cites this paper.

Experimental Assortments for Choice Estimation and Nest Identification Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T22:45:04.577369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.