{"as_of":"2026-08-17T15:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15e3138d6c9bb463d2a39ce26058840e8c8134aa1290e3876931e537d3c0bce1","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:23:48.792213Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.05009/citation-record","integrity":"/paper/2505.05009/integrity","json":"/paper/2505.05009/citation-record.json","paper":"/paper/2505.05009"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.620720Z","title":"Learning a hidden subgraph","venue":null,"work_id":"44851df8-d503-4269-8f47-b33d296caad5","year":2005},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.523033Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:14196f12450bf98a630eb76f9fd5371780f67f90dd8071f14cbb42d8dab01160","observation_id":"e8ffbe74-857e-4ee9-8f93-1c4a831258a0","resolution":{"observed_at":"2026-08-15T23:23:49.625586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.604853Z","title":"On learning graphs with edge-detecting queries","venue":null,"work_id":"157a6b71-e245-4a27-9b36-8cf3cff5be9b","year":2019},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.529453Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:fa3bd11bf82dd98299ea19d1db3e5d76d11a4be047a5017737f07f505a8d6c5b","observation_id":"361bb86d-edf3-4b3c-b835-661d8e79e0fe","resolution":{"observed_at":"2026-08-15T23:23:49.609693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.589138Z","title":"Community detection and stochastic block models: recent developments","venue":null,"work_id":"045fca90-a656-4a69-a609-cf5da34992b6","year":2018},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.534957Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:3eb601a0bbae768cf8fca1da7938e699c2b8c7a387e39b9954d075ee96d42a63","observation_id":"90fb2514-5ddf-43f7-bf24-7b2dbe8b8ba7","resolution":{"observed_at":"2026-08-15T23:23:49.594319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.573791Z","title":"Learning a hidden matching","venue":null,"work_id":"219e3f9f-1d70-4f27-999c-f6022bad0f3a","year":2004},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.540736Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:be129f90cacdbf7230df8548bbb5f9aaf737e382c2dc1a7ffc28d52a8b0b68bf","observation_id":"e88b238a-6b6a-4873-82ca-df8c0ce8a2ec","resolution":{"observed_at":"2026-08-15T23:23:49.578746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.557203Z","title":"Aggregating inconsistent information: R anking and clustering","venue":null,"work_id":"995bb8c2-2826-41c9-9ee7-446c66c52beb","year":2008},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.546199Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:e36f6c3a8ac15a1d272a37551869098b29824721bc5d32e6c8dc5461864caa94","observation_id":"7bba7be8-ba63-40b7-b958-cf6aeee2eac8","resolution":{"observed_at":"2026-08-15T23:23:49.563049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.541049Z","title":"Cut query algorithms with star contraction","venue":null,"work_id":"23b4fa82-0ca7-4ed8-8f10-bd871a1bc806","year":2022},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.551500Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:35dbcf514c6b67e78c65c14656dad7003d64a164ea740d8e74d3e5a950339246","observation_id":"cd9fe462-14a1-476d-9d19-e22312af4c3a","resolution":{"observed_at":"2026-08-15T23:23:49.545886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.525813Z","title":"Combinatorial search","venue":null,"work_id":"923e30d9-c051-4535-b3c3-952ee6a46d3a","year":1988},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.557362Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:04968e34890b781e3b8fd9d189463a2fcbd41ba8cc8882ca407bad8e7c7679e1","observation_id":"03f399b4-c868-4555-a92f-839f9ae1921e","resolution":{"observed_at":"2026-08-15T23:23:49.530577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.509964Z","title":"Clustering with same-cluster queries","venue":null,"work_id":"f8788c55-1f04-4e51-a4d0-3e646798a3d5","year":2016},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.562513Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:98b94cf310f44c49f2d45980cd6cd8ca450f7a10bc732765af3625498843754d","observation_id":"ab48172b-97e4-474b-9876-742d5c5d465a","resolution":{"observed_at":"2026-08-15T23:23:49.514909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-16T17:58:44.818131Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-08-15T23:23:48.567948Z","title":"On the query complexity of connectivity with global queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.567948Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:c86a46620f20b09eed7c69029f76caddee8156ab1993314bf943ab7c19d6c9d3","observation_id":"8459ad07-2c91-41aa-bee4-3d25b9e21270","resolution":{"observed_at":"2026-08-15T23:23:48.567948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.494206Z","title":"Correlation clustering","venue":null,"work_id":"ae4c4a84-02f9-4b46-a6b7-4e2fcb0a71c6","year":2004},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.573626Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b4c83c015b821962d4dfbc10556738afed33af024d634333b91d431e4c3472e7","observation_id":"96e75b8c-4b63-45e8-a9d7-6da420c4ab12","resolution":{"observed_at":"2026-08-15T23:23:49.499200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.478737Z","title":"Exact recovery of mangled clusters with same-cluster queries","venue":null,"work_id":"fa6958ba-bbf1-4bb9-b349-9cd6b9f7cd20","year":2020},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.578767Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:58762e9df77e778dc25595f4d72d1832b489c83c496022bc2b1909c8d1353350","observation_id":"5d68eea6-5977-49db-870d-6495229f3e95","resolution":{"observed_at":"2026-08-15T23:23:49.483471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.462425Z","title":"Clustering with non-adaptive subset queries","venue":null,"work_id":"ec97986b-9502-487e-80c4-c47aa59a959f","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.584543Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:ae0162eb48b9701f5605c86ac9a1a3186033662e1d55af0abd8588822ebfd816","observation_id":"a333c7df-b331-4e0d-bf0f-ba5eda164a2a","resolution":{"observed_at":"2026-08-15T23:23:49.467597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.446236Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":"017f142a-3c4c-4844-b9b8-5c87b5577f3a","year":2011},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.589985Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:6f7556e620c47e618bec40faa77d1ee96e538c44a14cac7b2ad4ec638ef25b17","observation_id":"fba78c78-1238-4562-a879-17593dceb548","resolution":{"observed_at":"2026-08-15T23:23:49.451458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.430481Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":"7f515847-18ed-4d27-a5be-3d20f9bc566c","year":2011},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.595181Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:85eebeb48e2701befa9bd7f7e6c9d15f7fee2de873f7578e0476ae9680f3a66d","observation_id":"748447aa-c71b-42bb-918d-fa42f121f38d","resolution":{"observed_at":"2026-08-15T23:23:49.435441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.414350Z","title":"Understanding the cluster lp for correlation clustering","venue":null,"work_id":"d4bea5de-b5a5-4163-ab1a-fecc90203edf","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.600553Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:5ef389d9e9d1a0544bdd4d52bff09110986c26cb6b616b82b6b7c354a16b7ccc","observation_id":"16aca219-c410-4253-a710-2affb17d7cb1","resolution":{"observed_at":"2026-08-15T23:23:49.419293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.398329Z","title":"Polynomial time optimal query algorithms for finding graphs with arbitrary real weights","venue":null,"work_id":"561563f6-682e-4701-821a-db9aaaaffcc0","year":2013},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.605775Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:5e8b975f55f445b4ec5b0e91cfc464e87833ebe2aa21bb64b3bb1b1d81d50277","observation_id":"111e6da2-8f56-4275-a2df-6f8aaebff996","resolution":{"observed_at":"2026-08-15T23:23:49.403388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.382514Z","title":"Optimal query complexity bounds for finding graphs","venue":null,"work_id":"e14c626c-73b5-4c1b-a077-feb272f15614","year":2008},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.611051Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:29a267be95fb420afd714fe7b7990cf8a43d8795f714490944a7208d9c030434","observation_id":"d4f191b5-3cc3-4dab-bd82-73d18fc7295c","resolution":{"observed_at":"2026-08-15T23:23:49.388008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.365637Z","title":"A query algorithm for learning a spanning forest in weighted undirected graphs","venue":null,"work_id":"ce07db74-e424-4f44-9913-a8acddae6c58","year":2023},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.616493Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:ebd7a4a0f9371a3327fa9e95ebc210ce13d6378ab76d82005891d7fc5694ae97","observation_id":"c7ddd26f-1586-4575-b37a-195852898cbd","resolution":{"observed_at":"2026-08-15T23:23:49.370857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.349538Z","title":"Learning partitions using rank queries","venue":null,"work_id":"43560882-2ccd-4964-965e-b39010777a66","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.621989Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b4bdbfcba8a25390c203ed95c014f430cc7d11ee88e0f389ceff892a078da6a6","observation_id":"0c108625-8dd3-4a7c-aded-febb4d66d6ee","resolution":{"observed_at":"2026-08-15T23:23:49.354583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.333165Z","title":"Determination of a subset from certain combinatorial properties","venue":null,"work_id":"7324424c-9bba-4b3b-beec-c3b25db6737e","year":1966},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.627327Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:5a557a5daf28b275b1fd6c7520c8bf118c18cc4e4efac99256cd1caf1519671e","observation_id":"c6c40b46-5f10-462c-bfcf-7c7c5f907c4a","resolution":{"observed_at":"2026-08-15T23:23:49.338572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.317581Z","title":"Near optimal LP rounding algorithm for correlation clustering on complete and complete k -partite graphs","venue":null,"work_id":"31a4542f-acdc-4e79-a68c-bdeb6afab7da","year":2015},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.632738Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:3584c85fce603faddcd0677c49102f48ffa3731e4a8c7d672c9a0dcf00b2e935","observation_id":"0643b1fe-4297-4c81-a6da-c772655f34ec","resolution":{"observed_at":"2026-08-15T23:23:49.322892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.302083Z","title":"Combinatorial group testing and its applications","venue":null,"work_id":"e3457ea5-a5a0-4e15-9d5f-cb56eefc5db5","year":2000},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.638004Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:10ecdd794050bfbaae1f48b220319088da5d94e50b5ad33266d1e5fb6ce4762e","observation_id":"f5a802ba-4239-4fca-b303-6882b3c103b4","resolution":{"observed_at":"2026-08-15T23:23:49.307086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.286043Z","title":"Combinatorial group testing and its applications , volume 12","venue":null,"work_id":"d0780324-ce26-4a6e-aede-b0789feb99fc","year":2000},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.643269Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:7ec94187a18ac9c2920f05618fd70a8f84e5e23b59c594b61911c5d85575f744","observation_id":"f468b707-4f79-4543-ab43-6a0e39be2d30","resolution":{"observed_at":"2026-08-15T23:23:49.290960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.268181Z","title":"Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy","venue":null,"work_id":"836e5b23-5d34-43ac-b802-9df78a4d7189","year":2014},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.648493Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:9dbebe67a02d4b77c381f7ddf669cb3252d7d07cb8b7214b719b1b98e6484834","observation_id":"b40ce55b-2eff-44ab-a3ba-1f5a6a5cbee4","resolution":{"observed_at":"2026-08-15T23:23:49.274547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.250559Z","title":"Optimal algorithms for learning partitions with faulty oracles","venue":null,"work_id":"4fb91410-5f38-4527-b0ae-5fc05bb6edb1","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.653526Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:f884ebebea748896a14e47d4ae7a8a8f4ad5a264cc79d02b2dc7b92989f1d641","observation_id":"9f086997-df02-44b2-b5ce-8b788038fbfa","resolution":{"observed_at":"2026-08-15T23:23:49.256484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.233360Z","title":"Clustering with queries under semi-random noise","venue":null,"work_id":"8d79355c-2033-4ee1-a4e7-2afd01cf5864","year":2022},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.658513Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b37236985e2632bafc56c3b42d83c39329f1e6a3abb89b0e45c0654d0fc5c6a9","observation_id":"f9b319ec-a99a-4fc9-8530-e9a060d95839","resolution":{"observed_at":"2026-08-15T23:23:49.238335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.217521Z","title":"Crowddb: Query processing with the vldb crowd","venue":null,"work_id":"c00cd517-d7d8-4522-b0cb-002bdb18a2ad","year":2011},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.663787Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:9b756d4e0fe69d33252214a5787a3718c0f458cb7fa634667b4e16dd3fe6bb1c","observation_id":"b5591f80-e825-4db9-a424-896be765840d","resolution":{"observed_at":"2026-08-15T23:23:49.222607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.201402Z","title":"Franklin, Donald Kossmann, Tim Kraska, Sukriti Ramesh, and Reynold Xin","venue":null,"work_id":"9cb1a20f-2ac3-48fc-86dd-490f4e52c1e8","year":2011},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.669467Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:8fef8a72ea675715895c0f37eca7d5df49fca745b0dbe015b29cae3c5a5d0047","observation_id":"7f71ed9e-4913-4146-9141-f525283f59bf","resolution":{"observed_at":"2026-08-15T23:23:49.206231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.184622Z","title":"Probabilistic group testing with a linear number of tests","venue":null,"work_id":"2802407e-d599-4d8e-95cd-8216bcef8040","year":2021},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.674535Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b8ef3cbd0efa87439a02c6eccadfce50a891a624923a3acf0746ac366ce92821","observation_id":"1a188726-e23e-4d89-a91d-d1305ce5a8c1","resolution":{"observed_at":"2026-08-15T23:23:49.190437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.167014Z","title":"Towards active learning on graphs: An error bound minimization approach","venue":null,"work_id":"7a200f5f-b5aa-497f-81d2-624959751822","year":2012},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.680201Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:908497da3119eb5b0c3f00621a4eaa4445b4bca8a607bf81e9e18afc9210f9a4","observation_id":"763d258a-91cf-4500-b076-4e3086049d09","resolution":{"observed_at":"2026-08-15T23:23:49.172491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.685583Z","title":"Optimal reconstruction of graphs under the additive model","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.685583Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:3431f696ac305448b4cca11ef78d9a57febb323cc6a04818ce7f3f500cec0505","observation_id":"ece33b1e-8ecd-4f19-ba31-fcdbb37a7112","resolution":{"observed_at":"2026-08-15T23:23:48.685583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.690796Z","title":"Same-cluster querying for overlapping clusters","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.690796Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b1389d8be1f0fdb87e241a31cc7aa0fceb45f5f55d46e8a6aab5f333f734a6fb","observation_id":"64f04ac3-7452-4aec-b232-9b08ab035f04","resolution":{"observed_at":"2026-08-15T23:23:48.690796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.131683Z","title":"Hwang and V","venue":null,"work_id":"45337d79-4e00-4e33-a89e-181e8ccd315f","year":1987},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.695840Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b969297ea7a4e829750b843157188912c031de733d6f3832d716b249fc546d7b","observation_id":"1e242a3e-a265-466f-bfc8-0dd8f9188e45","resolution":{"observed_at":"2026-08-15T23:23:49.136501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.115870Z","title":"Active learning with simple questions","venue":null,"work_id":"d11a4fc7-98be-43b6-a140-37fd22203214","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.701051Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:0bd49ee2b38023f4a408b63994793d93e5d611b78cfb010880bfe460b033daf5","observation_id":"d77e2bc7-bbba-4e62-b0cb-295d3c46cc71","resolution":{"observed_at":"2026-08-15T23:23:49.120914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.099924Z","title":"Learning spanning forests optimally in weighted undirected graphs with CUT queries","venue":null,"work_id":"73ecb5c4-a262-4fe3-ba84-a80a976f79ee","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.706112Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:9324affd5b1c33693770d17b01d6555d36bda0db320d4a5a950cea16ee55dc3f","observation_id":"b703e055-21f1-4ed0-adf0-a982a474c818","resolution":{"observed_at":"2026-08-15T23:23:49.105067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.084449Z","title":"Predicting positive and negative links in online social networks","venue":null,"work_id":"f797ee48-845a-468b-b5da-764b6ed1b28b","year":2010},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.712551Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:8b923d254a044067bb125dc790ba285d2545c949bacd9f196f42885cc16fa376","observation_id":"70be7175-e878-45d5-80c9-bfa8eb7fbf0e","resolution":{"observed_at":"2026-08-15T23:23:49.089265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.068537Z","title":"On a combinatorial problem in number theory","venue":null,"work_id":"54cfaaa3-a7f4-422c-8894-294581a6841c","year":1965},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.717954Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b05961b76e0e4a919aeeb89d0251917dad4788b2b0aae4d4214fd0ec9dd6a09d","observation_id":"fcff7896-0d97-4170-9884-eb8b6226f811","resolution":{"observed_at":"2026-08-15T23:23:49.073714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.051985Z","title":"Tight query complexity bounds for learning graph partitions","venue":null,"work_id":"e31e8b2b-4b82-49c9-b9d1-5d23d09a2afc","year":2022},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.723371Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:ed3d36741b1a7600bc749d39af4ef0112d9d601322139eaf8a6574d9cf39a92f","observation_id":"c73f82dd-1bf1-461f-8585-3b089f481937","resolution":{"observed_at":"2026-08-15T23:23:49.057453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.035390Z","title":"Nonadaptive group testing with random set of defectives","venue":null,"work_id":"78310717-0cc5-4ad3-96c6-4e69a03e4ddf","year":2016},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.729176Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:2feeccf23ac68c4b35e74d0c3c7b35df4d55d2adef8fca3e94155e03bad8e389","observation_id":"ad97a1b9-9ec7-4af2-9c68-238ca503295f","resolution":{"observed_at":"2026-08-15T23:23:49.040349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.019698Z","title":"Semisupervised clustering, and-queries and locally encodable source coding","venue":null,"work_id":"e7583b72-68f7-43c7-8c2a-fd2dd5ea64c3","year":2017},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.734384Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:68b4585edc2870f2309bf786191136a59dd38ab6fb467ecf5de657724b44a09c","observation_id":"a45c7690-4552-485a-bb9d-7cacd8259025","resolution":{"observed_at":"2026-08-15T23:23:49.024766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:49.003961Z","title":"Recovering unbalanced communities in the stochastic block model with application to clustering with a faulty oracle","venue":null,"work_id":"6da475c1-9b4f-4aae-a289-4defc749ef54","year":2024},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.739874Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:49507e54b751d5d5add7935ced7fff0fd9cbc0c91b2531c298c54c6f3c5dbd7a","observation_id":"6d4ef8c8-d42c-488f-9707-223da70c081a","resolution":{"observed_at":"2026-08-15T23:23:49.009118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.988168Z","title":"Clustering with noisy queries","venue":null,"work_id":"10ca96a5-94fb-49f4-9961-9923d9b6295b","year":2017},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.745134Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:06608c50f11dbeb39f6d4eb4649bf08dee77ca5449df4565a87b3efcffdb9dca","observation_id":"fd2dc04c-4d71-47db-97d0-0b9b7617605d","resolution":{"observed_at":"2026-08-15T23:23:48.993155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.972177Z","title":"Query complexity of clustering with side information","venue":null,"work_id":"029ff3b2-41e5-4123-984b-205ea9c0022e","year":2017},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.750285Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:b87fe0cc40dfe987ed404b217debd22abbc9a71e64784b70d9dc9e554a160251","observation_id":"065e3364-d6a7-4af3-9901-60e5217b212d","resolution":{"observed_at":"2026-08-15T23:23:48.977026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.756027Z","title":"A theoretical analysis of first heuristics of crowdsourced entity resolution","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.756027Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:68d733ab538c55a71c7684eb155446450c93b55626405e7ebde4a22a81e8ecd4","observation_id":"da7b190c-9612-428a-b772-053ca130fdd0","resolution":{"observed_at":"2026-08-15T23:23:48.756027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.3686","last_updated":"2014-12-20T08:56:15Z","snapshot_observed_at":"2026-08-15T00:46:29.850452Z","submitted_at":"2012-09-17T15:21:06Z","title":"Active Learning for Crowd-Sourced Databases","version":4},"cited_work":{"arxiv_id":"1209.3686","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.3686","snapshot_observed_at":"2026-08-15T23:23:48.848559Z","title":"Active Learning for Crowd-Sourced Databases","venue":"cs.LG","work_id":"98cbabe0-b1e5-45cd-b567-d71c61fa21b7","year":2012},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.761520Z"},"links":{"cited_paper":"/paper/1209.3686","citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:2697dcae57bc52bd0e414a5c3a55fc0217e800680e3a8a318222cd0b89900d6b","observation_id":"dce149eb-e65b-46c5-b228-cbdb4dd9bb4b","resolution":{"observed_at":"2026-08-15T23:23:48.855952Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.00750","last_updated":"2016-10-04T17:23:11Z","snapshot_observed_at":"2026-08-14T21:41:32.758371Z","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.00750","snapshot_observed_at":"2026-08-15T23:23:48.767631Z","title":"Predicting signed edges with o(n^ 1+o(1) n) queries","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.767631Z"},"links":{"cited_paper":"/paper/1609.00750","citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:4774af089bdca70e5460601d3694a18a18ad10631d7b8fa97cbd32f591fa5276","observation_id":"4ba290a1-6647-4e4b-8efa-53734f16e372","resolution":{"observed_at":"2026-08-15T23:23:48.767631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.944891Z","title":"Explicit non-adaptive combinatorial group testing schemes","venue":null,"work_id":"69732924-6bcf-41f9-822c-da861ff0058a","year":2008},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.773364Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:1a48a0620bbdc2a4ff7163deb170d8f46b96951115833ae4e6a8babd0592216a","observation_id":"8e7b5d4c-9beb-44e0-a5a1-836679768697","resolution":{"observed_at":"2026-08-15T23:23:48.950588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.929056Z","title":"Learning and verifying graphs using queries with a focus on edge counting","venue":null,"work_id":"50453a41-dd94-416b-b3e7-e55be44cd476","year":2007},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.778043Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:616205fff40a33c8e41d22e5943db308329017bb47b5a8e7fcf5339cfb18f88f","observation_id":"241ee5c2-75f8-4a88-ad1f-d707b78bddce","resolution":{"observed_at":"2026-08-15T23:23:48.933903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.913260Z","title":"Computing exact minimum cuts without knowing the graph","venue":null,"work_id":"79ed7515-305a-4781-b093-5782fabfd72f","year":2018},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.782712Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:673ac26770305521a65b506cbc72a17ef69cd55fb5d078bfc0fd7bd79e583e82","observation_id":"aec1cbc3-21d8-4048-bfe9-73758ec83bb4","resolution":{"observed_at":"2026-08-15T23:23:48.918145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.787540Z","title":"Correlation clustering with same-cluster queries bounded by optimal cost","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.787540Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:e6e1f4aa40d70ab878d4bbce6d15b68113efc2bf36b0335a249f09b14909fd2f","observation_id":"fa12403d-a1e9-455e-b786-104bb2069773","resolution":{"observed_at":"2026-08-15T23:23:48.787540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:48.885917Z","title":"Franklin, and Jianhua Feng","venue":null,"work_id":"22794b76-df84-41dc-b8b0-3a3fb0b0307b","year":2012},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.792213Z"},"links":{"citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:8d3e371ad081bb9f8794bee6754f801ae3777e4f13afd9f105a727c4407e82df","observation_id":"5f3edc5b-99e5-4e4e-b1c5-a477dea209ff","resolution":{"observed_at":"2026-08-15T23:23:48.891115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T23:13:35.312445Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2505.05009."}