Paper Citation Record · LEDGER

Learning Partitions with Optimal Query and Round Complexities

As of 20 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2505.05009.

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

pith.paper-citation-record.v1
2505.05009 v1

Coverage vector

measured 51 of 51 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:23:48.792213Z

measured 51 of 51 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

51 of 51 outbound references displayed

verified exact1
verified fuzzy44
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e8ffbe74-857e-4ee9-8f93-1c4a831258a0 · outbound

This paper cites Learning a hidden subgraph.

Learning Partitions with Optimal Query and Round Complexities Learning a hidden subgraph

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.625586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 361bb86d-edf3-4b3c-b835-661d8e79e0fe · outbound

This paper cites On learning graphs with edge-detecting queries.

Learning Partitions with Optimal Query and Round Complexities On learning graphs with edge-detecting queries

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.609693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 90fb2514-5ddf-43f7-bf24-7b2dbe8b8ba7 · outbound

This paper cites Community detection and stochastic block models: recent developments.

Learning Partitions with Optimal Query and Round Complexities Community detection and stochastic block models: recent developments

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.594319Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e88b238a-6b6a-4873-82ca-df8c0ce8a2ec · outbound

This paper cites Learning a hidden matching.

Learning Partitions with Optimal Query and Round Complexities Learning a hidden matching

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.578746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7bba7be8-ba63-40b7-b958-cf6aeee2eac8 · outbound

This paper cites Aggregating inconsistent information: R anking and clustering.

Learning Partitions with Optimal Query and Round Complexities Aggregating inconsistent information: R anking and clustering

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.563049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation cd9fe462-14a1-476d-9d19-e22312af4c3a · outbound

This paper cites Cut query algorithms with star contraction.

Learning Partitions with Optimal Query and Round Complexities Cut query algorithms with star contraction

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.545886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 03f399b4-c868-4555-a92f-839f9ae1921e · outbound

This paper cites Combinatorial search.

Learning Partitions with Optimal Query and Round Complexities Combinatorial search

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.530577Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ab48172b-97e4-474b-9876-742d5c5d465a · outbound

This paper cites Clustering with same-cluster queries.

Learning Partitions with Optimal Query and Round Complexities Clustering with same-cluster queries

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.514909Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 8459ad07-2c91-41aa-bee4-3d25b9e21270 · outbound

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

Learning Partitions with Optimal Query and Round Complexities On the query complexity of connectivity with global queries

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.567948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96e75b8c-4b63-45e8-a9d7-6da420c4ab12 · outbound

This paper cites Correlation clustering.

Learning Partitions with Optimal Query and Round Complexities Correlation clustering

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.499200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5d68eea6-5977-49db-870d-6495229f3e95 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Exact recovery of mangled clusters with same-cluster queries

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.483471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a333c7df-b331-4e0d-bf0f-ba5eda164a2a · outbound

This paper cites Clustering with non-adaptive subset queries.

Learning Partitions with Optimal Query and Round Complexities Clustering with non-adaptive subset queries

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.467597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation fba78c78-1238-4562-a879-17593dceb548 · outbound

This paper cites Bshouty and Hanna Mazzawi.

Learning Partitions with Optimal Query and Round Complexities Bshouty and Hanna Mazzawi

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.451458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 748447aa-c71b-42bb-918d-fa42f121f38d · outbound

This paper cites Bshouty and Hanna Mazzawi.

Learning Partitions with Optimal Query and Round Complexities Bshouty and Hanna Mazzawi

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.435441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 16aca219-c410-4253-a710-2affb17d7cb1 · outbound

This paper cites Understanding the cluster lp for correlation clustering.

Learning Partitions with Optimal Query and Round Complexities Understanding the cluster lp for correlation clustering

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.419293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 111e6da2-8f56-4275-a2df-6f8aaebff996 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Polynomial time optimal query algorithms for finding graphs with arbitrary real weights

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.403388Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d4f191b5-3cc3-4dab-bd82-73d18fc7295c · outbound

This paper cites Optimal query complexity bounds for finding graphs.

Learning Partitions with Optimal Query and Round Complexities Optimal query complexity bounds for finding graphs

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.388008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c7ddd26f-1586-4575-b37a-195852898cbd · outbound

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

Learning Partitions with Optimal Query and Round Complexities A query algorithm for learning a spanning forest in weighted undirected graphs

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.370857Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 0c108625-8dd3-4a7c-aded-febb4d66d6ee · outbound

This paper cites Learning partitions using rank queries.

Learning Partitions with Optimal Query and Round Complexities Learning partitions using rank queries

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.354583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c6c40b46-5f10-462c-bfcf-7c7c5f907c4a · outbound

This paper cites Determination of a subset from certain combinatorial properties.

Learning Partitions with Optimal Query and Round Complexities Determination of a subset from certain combinatorial properties

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.338572Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 0643b1fe-4297-4c81-a6da-c772655f34ec · outbound

This paper cites Near optimal LP rounding algorithm for correlation clustering on complete and complete k -partite graphs.

Learning Partitions with Optimal Query and Round Complexities Near optimal LP rounding algorithm for correlation clustering on complete and complete k -partite graphs

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.322892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f5a802ba-4239-4fca-b303-6882b3c103b4 · outbound

This paper cites Combinatorial group testing and its applications.

Learning Partitions with Optimal Query and Round Complexities Combinatorial group testing and its applications

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.307086Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f468b707-4f79-4543-ab43-6a0e39be2d30 · outbound

This paper cites Combinatorial group testing and its applications , volume 12.

Learning Partitions with Optimal Query and Round Complexities Combinatorial group testing and its applications , volume 12

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.290960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b40ce55b-2eff-44ab-a3ba-1f5a6a5cbee4 · outbound

This paper cites Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy.

Learning Partitions with Optimal Query and Round Complexities Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.274547Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 9f086997-df02-44b2-b5ce-8b788038fbfa · outbound

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

Learning Partitions with Optimal Query and Round Complexities Optimal algorithms for learning partitions with faulty oracles

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.256484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f9b319ec-a99a-4fc9-8530-e9a060d95839 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Clustering with queries under semi-random noise

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.238335Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b5591f80-e825-4db9-a424-896be765840d · outbound

This paper cites Crowddb: Query processing with the vldb crowd.

Learning Partitions with Optimal Query and Round Complexities Crowddb: Query processing with the vldb crowd

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.222607Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7f71ed9e-4913-4146-9141-f525283f59bf · outbound

This paper cites Franklin, Donald Kossmann, Tim Kraska, Sukriti Ramesh, and Reynold Xin.

Learning Partitions with Optimal Query and Round Complexities Franklin, Donald Kossmann, Tim Kraska, Sukriti Ramesh, and Reynold Xin

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.206231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1a188726-e23e-4d89-a91d-d1305ce5a8c1 · outbound

This paper cites Probabilistic group testing with a linear number of tests.

Learning Partitions with Optimal Query and Round Complexities Probabilistic group testing with a linear number of tests

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.190437Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 763d258a-91cf-4500-b076-4e3086049d09 · outbound

This paper cites Towards active learning on graphs: An error bound minimization approach.

Learning Partitions with Optimal Query and Round Complexities Towards active learning on graphs: An error bound minimization approach

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.172491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ece33b1e-8ecd-4f19-ba31-fcdbb37a7112 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Optimal reconstruction of graphs under the additive model

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.685583Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64f04ac3-7452-4aec-b232-9b08ab035f04 · outbound

This paper cites Same-cluster querying for overlapping clusters.

Learning Partitions with Optimal Query and Round Complexities Same-cluster querying for overlapping clusters

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.690796Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e242a3e-a265-466f-bfc8-0dd8f9188e45 · outbound

This paper cites Hwang and V.

Learning Partitions with Optimal Query and Round Complexities Hwang and V

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.136501Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d77e2bc7-bbba-4e62-b0cb-295d3c46cc71 · outbound

This paper cites Active learning with simple questions.

Learning Partitions with Optimal Query and Round Complexities Active learning with simple questions

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.120914Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b703e055-21f1-4ed0-adf0-a982a474c818 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Learning spanning forests optimally in weighted undirected graphs with CUT queries

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.105067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 70be7175-e878-45d5-80c9-bfa8eb7fbf0e · outbound

This paper cites Predicting positive and negative links in online social networks.

Learning Partitions with Optimal Query and Round Complexities Predicting positive and negative links in online social networks

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.089265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation fcff7896-0d97-4170-9884-eb8b6226f811 · outbound

This paper cites On a combinatorial problem in number theory.

Learning Partitions with Optimal Query and Round Complexities On a combinatorial problem in number theory

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.073714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c73f82dd-1bf1-461f-8585-3b089f481937 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Tight query complexity bounds for learning graph partitions

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.057453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ad97a1b9-9ec7-4af2-9c68-238ca503295f · outbound

This paper cites Nonadaptive group testing with random set of defectives.

Learning Partitions with Optimal Query and Round Complexities Nonadaptive group testing with random set of defectives

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.040349Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a45c7690-4552-485a-bb9d-7cacd8259025 · outbound

This paper cites Semisupervised clustering, and-queries and locally encodable source coding.

Learning Partitions with Optimal Query and Round Complexities Semisupervised clustering, and-queries and locally encodable source coding

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.024766Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 6d4ef8c8-d42c-488f-9707-223da70c081a · outbound

This paper cites Recovering unbalanced communities in the stochastic block model with application to clustering with a faulty oracle.

Learning Partitions with Optimal Query and Round Complexities Recovering unbalanced communities in the stochastic block model with application to clustering with a faulty oracle

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:49.009118Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation fd2dc04c-4d71-47db-97d0-0b9b7617605d · outbound

This paper cites Clustering with noisy queries.

Learning Partitions with Optimal Query and Round Complexities Clustering with noisy queries

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.993155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 065e3364-d6a7-4af3-9901-60e5217b212d · outbound

This paper cites Query complexity of clustering with side information.

Learning Partitions with Optimal Query and Round Complexities Query complexity of clustering with side information

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.977026Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation da7b190c-9612-428a-b772-053ca130fdd0 · outbound

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

Learning Partitions with Optimal Query and Round Complexities A theoretical analysis of first heuristics of crowdsourced entity resolution

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.756027Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dce149eb-e65b-46c5-b228-cbdb4dd9bb4b · outbound

This paper cites Active Learning for Crowd-Sourced Databases.

Learning Partitions with Optimal Query and Round Complexities Active Learning for Crowd-Sourced Databases

Reference 45

Resolution: verified exact; local_arxiv, observed 2026-08-15T23:23:48.855952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4ba290a1-6647-4e4b-8efa-53734f16e372 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.767631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e7b5d4c-9beb-44e0-a5a1-836679768697 · outbound

This paper cites Explicit non-adaptive combinatorial group testing schemes.

Learning Partitions with Optimal Query and Round Complexities Explicit non-adaptive combinatorial group testing schemes

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.950588Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 241ee5c2-75f8-4a88-ad1f-d707b78bddce · outbound

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

Learning Partitions with Optimal Query and Round Complexities Learning and verifying graphs using queries with a focus on edge counting

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.933903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation aec1cbc3-21d8-4048-bfe9-73758ec83bb4 · outbound

This paper cites Computing exact minimum cuts without knowing the graph.

Learning Partitions with Optimal Query and Round Complexities Computing exact minimum cuts without knowing the graph

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.918145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation fa12403d-a1e9-455e-b786-104bb2069773 · outbound

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

Learning Partitions with Optimal Query and Round Complexities Correlation clustering with same-cluster queries bounded by optimal cost

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-15T23:23:48.787540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f3edc5b-99e5-4e4e-b1c5-a477dea209ff · outbound

This paper cites Franklin, and Jianhua Feng.

Learning Partitions with Optimal Query and Round Complexities Franklin, and Jianhua Feng

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:23:48.891115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

No inbound Pith citation observations are available.