Paper Citation Record · LEDGER

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds

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

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

pith.paper-citation-record.v1
2608.02176 v1

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T13:24:28.011344Z

measured 27 of 27 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+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

27 of 27 outbound references displayed

verified exact0
verified fuzzy0
unresolved27
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9a73877b-eea5-4443-b0cd-451a41468593 · outbound

This paper cites an unresolved cited work.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.445148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dcfee6e-812e-464a-8037-ada754bf5d7d · outbound

This paper cites Learning a hidden matching.SIAM Journal on Computing (SICOMP), 33(2):487–501, 2004.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning a hidden matching.SIAM Journal on Computing (SICOMP), 33(2):487–501, 2004

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.523217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78a26e9e-c8bf-4d5c-ae80-c25c999bb29c · outbound

This paper cites Learning a hidden hypergraph.Journal of Machine Learning Research (JMLR), 7(79):2215–2236, 2006.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning a hidden hypergraph.Journal of Machine Learning Research (JMLR), 7(79):2215–2236, 2006

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.593213Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b300740e-03dc-4e29-b074-c0ee43f9965c · outbound

This paper cites Learning a hidden graph usingo(logn) queries per edge.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning a hidden graph usingo(logn) queries per edge

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.731794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 089e755c-6a61-469b-b2eb-2b4263c4a727 · outbound

This paper cites Clustering with same-cluster queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Clustering with same-cluster queries

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.882734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee24d7c9-44ea-423d-ad4b-550a7269257c · outbound

This paper cites Non-adaptive learning of random hypergraphs with queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Non-adaptive learning of random hypergraphs with queries

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:24.970450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86cac200-27ac-4055-ba8b-8249ffa9b891 · outbound

This paper cites Learning low degree hypergraphs.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning low degree hypergraphs

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.063689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da75b7f1-87eb-4c88-8f93-4101c19f51da · outbound

This paper cites Clustering with non-adaptive subset queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Clustering with non-adaptive subset queries

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.146742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6adb119d-711b-4722-beb3-526256694c9f · outbound

This paper cites Learning partitions with optimal query and round complexities.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning partitions with optimal query and round complexities

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.271420Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cc88703-c16e-4872-a4df-94919e60151f · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Exact recovery of mangled clusters with same-cluster queries

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.447147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73a6dc69-e46f-4f40-b5c6-30743afb5b39 · outbound

This paper cites Bshouty and Hanna Mazzawi.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Bshouty and Hanna Mazzawi

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.611558Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23d6cbc2-c7fa-40ff-92af-d746e5b699fc · outbound

This paper cites Learning partitions using rank queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning partitions using rank queries

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.759134Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01a92096-9361-4a9c-b727-d1193eaa4f10 · outbound

This paper cites Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.916838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcee73a2-1a6b-4cdb-a9ff-6aec2446b8f7 · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.070038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4188a8a-485a-448d-95ff-db75048dde0d · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Clustering with queries under semi- random noise

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.202481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b92c9b88-3f2e-4a60-9805-fa6267b06c7f · outbound

This paper cites Optimal algo- rithms for learning partitions with faulty oracles.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Optimal algo- rithms for learning partitions with faulty oracles

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.333376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 408a3846-dc81-4657-8c96-f9f7d47c996c · outbound

This paper cites Optimal reconstruction of graphs under the addi- tive model.Algorithmica, 28(1):104–124, 2000.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Optimal reconstruction of graphs under the addi- tive model.Algorithmica, 28(1):104–124, 2000

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.500370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 699ad8a8-b262-4f3b-b4ca-153cb87f781a · outbound

This paper cites Same-cluster query- ing for overlapping clusters.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Same-cluster query- ing for overlapping clusters

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.640538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc758aff-8d05-48a2-94e0-7f500de57706 · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Tight query complexity bounds for learning graph partitions

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:26.816988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 165e34c6-070a-48b0-8342-5f794d0b255f · outbound

This paper cites Clustering with noisy queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Clustering with noisy queries

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.003315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 391a8907-727e-46dd-89b7-4186774271c8 · outbound

This paper cites Query complexity of clustering with side information.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Query complexity of clustering with side information

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.159751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 126fea4f-361a-4d5b-aec7-5e1162c780af · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds A theoretical analysis of first heuristics of crowdsourced entity resolution

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.283080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d491eed-1e0f-4530-8c16-a726e474cebb · outbound

This paper cites Optimally reconstructing weighted graphs using queries.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Optimally reconstructing weighted graphs using queries

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.401539Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee6505ab-7fcf-4cd4-b6ad-a12430861a7d · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.562527Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f54cec6f-b7e9-427b-b111-4615d14efade · outbound

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

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Learning and verifying graphs using queries with a focus on edge counting

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.680869Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27de4a23-2251-47c6-be57-0c2a1dbc6f34 · outbound

This paper cites Franklin, and Jianhua Feng.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Franklin, and Jianhua Feng

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:27.864242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54466fa5-ecf3-412d-9028-dfbc69078c5d · outbound

This paper cites Question selection for crowd entity resolution.Proceedings, Very Large Databases (VLDB), 6(6):349–360, 2013.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Question selection for crowd entity resolution.Proceedings, Very Large Databases (VLDB), 6(6):349–360, 2013

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:28.011344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.