Pith. sign in

Paper Citation Record · LEDGER

Learning Partitions with Optimal Query and Round Complexities

As of 21 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-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

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.523033Z digest=sha256:b26fa89e9191da02cf5e8fa0efcf45d3b0140f4dee56a68125ad0f8588fe8a42

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.529453Z digest=sha256:663e843fed3313ce32a93eaf8c5dc528930e34d4fa00ae55303b0f98980be0a4

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.534957Z digest=sha256:79de3c4daae70fe660485269f5a3c1c32cf81eec0a84d834460197072e9f4b72

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.540736Z digest=sha256:39d99ed79001cc0b650aa3153e925e98c66fe8f4fed205e824876ccf07845705

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.546199Z digest=sha256:a8c8c4837546de1f5fde6a8ae544993ca9b984f085e6ea7a0517d3eafebd859d

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.551500Z digest=sha256:33d883b3ed01146d4801a680e37be604e22cbdce6fd5d0f046f5bb5515ece43c

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.557362Z digest=sha256:95b6d6caf88b0d6314323aa0ddcdb200c0a224ec981818500f25b3738ad757f7

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.562513Z digest=sha256:44fb391cd770f90b9084fc85a3c3845f880ed6970d860b7df0f80eb9a2ce02fd

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.

source=arxiv_source observed=2026-08-15T23:23:48.567948Z digest=sha256:93d66d48a501863a0019e39d00fd79a1a46bb0cc944cea56ae65115ce42b0a9c

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.573626Z digest=sha256:93eae2d1a3e4946ba2ef9d13f0b68ee477ca08194133e4a9508d394f662d53cd

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.578767Z digest=sha256:43c1874e0e49d452b9f23b07e704fe635cd3b5a21feaaadabe1f0b50f5dda83d

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.584543Z digest=sha256:3629eaabb45dc29932c14702a564573adf3c0e8a3f798904defdf26db3d3f2a5

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.589985Z digest=sha256:cfa3b046d1b44d5b6c9a1ffa1f71c90f7efde93af462fdc5be1d13bb25e82624

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.595181Z digest=sha256:04a7ed8fbc99ce6f0f044801ad9ef11e9ae06b1b82c9387e7559c51d67601e09

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.600553Z digest=sha256:89ea38be43b4646a264a0c1c611c317f269edb6707773999be9854882ddd2c26

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.605775Z digest=sha256:ff809ca0aa778823aa3df72eb78b24474700838227d0b4f9d3e931b962be3414

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.611051Z digest=sha256:34723996c1cffcf19429e0ddc20f43d49f6fe887db5247d5ae093610575f8641

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.616493Z digest=sha256:0c27dd2061319e2efd3a0f213157e109250c3773dfe6ef141bd39f43a1db40bc

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.621989Z digest=sha256:80a0a6ba0ad28885164d1102ce7c33c626ec7aad737a5072dd40226bd67df0f0

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.627327Z digest=sha256:59dcd72d1e4483c021795b72dd03de1886bec3d3af39223b105694fa6f7fd0cd

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.632738Z digest=sha256:3e15046b57de971f3c10f2aeae3250137c7e6f2f73aa532c2c1458105826a452

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.638004Z digest=sha256:a2d28d6eeca65d6c266b2361dcc790e22b9d429127429b83960b6a90b86d4041

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.643269Z digest=sha256:2df045ca44434ec072b94964c9bf2f9ba1dd1f840ef97c5b5917a9ec551a76c7

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.648493Z digest=sha256:b7c0955e72a6dd1ccfb8b5efd30af39a3445738632a273ecff5067e7e6dfd3a1

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.653526Z digest=sha256:47917c0e69317d361cd74593bba63be08d0d4a566d8a50d2b942768f2cee95eb

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.658513Z digest=sha256:ed32da674162f1ae645ed3d31a2259a3327bd196110971169d5c20edc5595b2e

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.663787Z digest=sha256:3d910017f7e036ee1704a67ebc6da26f718bc03fcf92e7b84367219cb7d842f7

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.669467Z digest=sha256:04e2ebdfdd64717f3c8dfef826e2b633146c787fa4c522bb4aef3721edf81a14

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.674535Z digest=sha256:db2881df16894587c9c2e7bc477660cbe1e979dd237b59c985368839e3ded8fd

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.680201Z digest=sha256:8397787497641baccf932590ee14a58b32dbdc0d0789562b0f326d733855280e

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.

source=arxiv_source observed=2026-08-15T23:23:48.685583Z digest=sha256:e58ddf4a7575885951cdcdfb8ae036445333e154ee1864cf4d253516503e6eb9

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.

source=arxiv_source observed=2026-08-15T23:23:48.690796Z digest=sha256:efcb475c4dde73c9bbc916457505326917d8c87f56c88e334267fd4868fb5340

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.695840Z digest=sha256:f9e8b0642a6b356199cb63688e6faab7ac5b28625533d3038f47f9954c56cb67

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.701051Z digest=sha256:f922bfb88fa7f2832e3937b13c9d2d21873ddb8bc10757475a387607f5f2635c

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.706112Z digest=sha256:93cf7797380b019c1dd7e48adf33ffd2e3c28acf7b54c95c56db7bac1c965f29

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.712551Z digest=sha256:cda1f8dbdf318d45f1cc1256f0a8aef5388137e9903b7ec646a5add92257ea2e

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.717954Z digest=sha256:443132898be57f373e0f2a26173d7e90b2862d288a3db02f56af1aed071bd5fa

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.723371Z digest=sha256:5bf863f9945a1abccd4840a08ff878dbc0549f80ed623ae1758453164d87a80f

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.729176Z digest=sha256:83df7e2537056aca2da1f59acced980969939ca1120297db6e0a2f2558760166

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.734384Z digest=sha256:4b1d21430981e32f83e01c40d77fed49b125926cc20f78117e8a8fc45719e804

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.739874Z digest=sha256:86d41c1964e35f6dd7962d085e700a2d0f54b978de0211e3d511a9930b41c142

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.745134Z digest=sha256:ab5c5c9f8beafc34030c53c406fb2f7ad0a148c1a1d22459045f6f83dad6bf02

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.750285Z digest=sha256:20d28c336bea52273a3c1fa89b2b1a90526f6cc0a036a86ae84a49101dfc0d07

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.

source=arxiv_source observed=2026-08-15T23:23:48.756027Z digest=sha256:09ae83a7187939c2ba1a568966ff6ed02440704c305e49001dd6e6502de9dec2

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.761520Z digest=sha256:5131c59c3d90d1cd5c02b3f80103e53652269fff76fd88049230cc3dedcd9a52

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.

source=arxiv_source observed=2026-08-15T23:23:48.767631Z digest=sha256:e212c570ce3128190989d919992847ab5e8587087db65406999a06fa96fd9fa2

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.773364Z digest=sha256:74615bc81090b42d9e472ca7a0520fba9b580cfa05b4223c5af92e8a6ba252fe

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.778043Z digest=sha256:4ba8c8e0d5dc11ea1770af6da67db8182d89a98c9298a10148dea10802674533

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.782712Z digest=sha256:907b2152db3e22f4b3f57cccae7949ae940eff5b640f419abf31126da5744fc6

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.

source=arxiv_source observed=2026-08-15T23:23:48.787540Z digest=sha256:4b31a60a38a1de11c8937ee0d56c1773be87cafce2a97cc828f2ea393d4577a0

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-15T23:23:48.792213Z digest=sha256:035d560355f43a8cae2f8aae67a736402f4c14b3523b474a933d2feae94f8bbf

Pith citing papers

No inbound Pith citation observations are available.