{"as_of":"2026-08-20T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7655d49b5141ad28b1dd802ddd98e7a8b25e53b34308021a21d0f7ea961171be","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:24:28.011344Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2608.02176/citation-record","integrity":"/paper/2608.02176/integrity","json":"/paper/2608.02176/citation-record.json","paper":"/paper/2608.02176"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:24:24.445148Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.445148Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:f90aea8e6819e7858ccbf5184e85c99a2332aa67363dc8f0ba45f12f00d435d1","observation_id":"9a73877b-eea5-4443-b0cd-451a41468593","resolution":{"observed_at":"2026-08-04T13:24:24.445148Z","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-04T13:24:24.523217Z","title":"Learning a hidden matching.SIAM Journal on Computing (SICOMP), 33(2):487–501, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.523217Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:8c7c4cff27404e8ea96dbe59a186ff401d5199b9c53a50a9077378cc83095ae4","observation_id":"9dcfee6e-812e-464a-8037-ada754bf5d7d","resolution":{"observed_at":"2026-08-04T13:24:24.523217Z","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-04T13:24:24.593213Z","title":"Learning a hidden hypergraph.Journal of Machine Learning Research (JMLR), 7(79):2215–2236, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.593213Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:e545576c491c9e744641e291e4cfb8b808d20b33d92fc55905711187745bca3c","observation_id":"78a26e9e-c8bf-4d5c-ae80-c25c999bb29c","resolution":{"observed_at":"2026-08-04T13:24:24.593213Z","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-04T13:24:24.731794Z","title":"Learning a hidden graph usingo(logn) queries per edge","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.731794Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:382d12746e899e0acb2767dfb5d049aa0a605c30167bc30d7f081fed3bafa0a3","observation_id":"b300740e-03dc-4e29-b074-c0ee43f9965c","resolution":{"observed_at":"2026-08-04T13:24:24.731794Z","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-04T13:24:24.882734Z","title":"Clustering with same-cluster queries","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.882734Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:25f28cccbe707c6195df2a445969e6cd825d737f98c88dc609591662f58635cb","observation_id":"089e755c-6a61-469b-b2eb-2b4263c4a727","resolution":{"observed_at":"2026-08-04T13:24:24.882734Z","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-04T13:24:24.970450Z","title":"Non-adaptive learning of random hypergraphs with queries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:24.970450Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:5e19b3292041613a89db206053f5cbd8a459ac070b35f026ce43f69f767b265e","observation_id":"ee24d7c9-44ea-423d-ad4b-550a7269257c","resolution":{"observed_at":"2026-08-04T13:24:24.970450Z","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-04T13:24:25.063689Z","title":"Learning low degree hypergraphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.063689Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:d9636f543e0ad34b14c0cec0c3642a6876f3be1b4894331d624e86544514e14e","observation_id":"86cac200-27ac-4055-ba8b-8249ffa9b891","resolution":{"observed_at":"2026-08-04T13:24:25.063689Z","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-04T13:24:25.146742Z","title":"Clustering with non-adaptive subset queries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.146742Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:2316bee4a867a445dddbbe9f5fc156c452b1e6334fe8951fc7cf0eb3047d3bca","observation_id":"da75b7f1-87eb-4c88-8f93-4101c19f51da","resolution":{"observed_at":"2026-08-04T13:24:25.146742Z","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-04T13:24:25.271420Z","title":"Learning partitions with optimal query and round complexities","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.271420Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:9d3d20a3303fb83213a98ed526b02e5329b49318626da55a254c3071881b765e","observation_id":"6adb119d-711b-4722-beb3-526256694c9f","resolution":{"observed_at":"2026-08-04T13:24:25.271420Z","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-04T13:24:25.447147Z","title":"Exact recovery of mangled clusters with same-cluster queries","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.447147Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:28afd30fa72e7fc56ab494f4c1a5c4187c061b464fe5faa47ae1ed2dbb1ba787","observation_id":"9cc88703-c16e-4872-a4df-94919e60151f","resolution":{"observed_at":"2026-08-04T13:24:25.447147Z","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-04T13:24:25.611558Z","title":"Bshouty and Hanna Mazzawi","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.611558Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:0e8c1637f7eacca478acf31eb5a213e0d221ab3639012fcbd574fee11a330382","observation_id":"73a6dc69-e46f-4f40-b5c6-30743afb5b39","resolution":{"observed_at":"2026-08-04T13:24:25.611558Z","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-04T13:24:25.759134Z","title":"Learning partitions using rank queries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.759134Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:e7d4bf031f5be4fe625ea4f69998449b29d25ae8c1e21a525bda0d28062ad916","observation_id":"23d6cbc2-c7fa-40ff-92af-d746e5b699fc","resolution":{"observed_at":"2026-08-04T13:24:25.759134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.01216","last_updated":"2026-07-01T17:54:03Z","snapshot_observed_at":"2026-08-14T10:13:56.606954Z","submitted_at":"2026-07-01T17:54:03Z","title":"Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.01216","snapshot_observed_at":"2026-08-04T13:24:25.916838Z","title":"Query complexity of hypergraph connectivity and learnability using CUT oracles","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:25.916838Z"},"links":{"cited_paper":"/paper/2607.01216","citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:5d2dbae0777042adc239bb000ee26b605f57650b194cfd94470c7998a3ee1f4c","observation_id":"01a92096-9361-4a9c-b727-d1193eaa4f10","resolution":{"observed_at":"2026-08-04T13:24:25.916838Z","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-04T13:24:26.070038Z","title":"Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.070038Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:d50fbc0743b07d042bafaa03b2d04e1b2fa24dd45d3172f6e8efcba54db0ecb5","observation_id":"bcee73a2-1a6b-4cdb-a9ff-6aec2446b8f7","resolution":{"observed_at":"2026-08-04T13:24:26.070038Z","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-04T13:24:26.202481Z","title":"Clustering with queries under semi- random noise","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.202481Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:fc557def27cbbecf38844ae6c8ccbaa5615302e490697037e6f5cf6af8ca3937","observation_id":"d4188a8a-485a-448d-95ff-db75048dde0d","resolution":{"observed_at":"2026-08-04T13:24:26.202481Z","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-04T13:24:26.333376Z","title":"Optimal algo- rithms for learning partitions with faulty oracles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.333376Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:f1db90abd1fa6bd9dc120fb2a3c6bcb556b339bba3c6e5989fa364031153b052","observation_id":"b92c9b88-3f2e-4a60-9805-fa6267b06c7f","resolution":{"observed_at":"2026-08-04T13:24:26.333376Z","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-04T13:24:26.500370Z","title":"Optimal reconstruction of graphs under the addi- tive model.Algorithmica, 28(1):104–124, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.500370Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:540701d235eca58a8c47853cdf82b93075360f0ea5cd8e587e62ffcdb4084429","observation_id":"408a3846-dc81-4657-8c96-f9f7d47c996c","resolution":{"observed_at":"2026-08-04T13:24:26.500370Z","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-04T13:24:26.640538Z","title":"Same-cluster query- ing for overlapping clusters","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.640538Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:c0c0d526ce1bb23d4a576a15e38fa76f140f14edce0e57fe02ee17b7f2a0c8f7","observation_id":"699ad8a8-b262-4f3b-b4ca-153cb87f781a","resolution":{"observed_at":"2026-08-04T13:24:26.640538Z","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-04T13:24:26.816988Z","title":"Tight query complexity bounds for learning graph partitions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:26.816988Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:b1fb5be1fe6b44f1bd83c1f9fb30ac293614434650da990b68ed179561a2524e","observation_id":"fc758aff-8d05-48a2-94e0-7f500de57706","resolution":{"observed_at":"2026-08-04T13:24:26.816988Z","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-04T13:24:27.003315Z","title":"Clustering with noisy queries","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.003315Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:5744703bfeb3f9a46993ab90c14e5dc57e6d94c99a1e78ff06bb0790e6ade3c1","observation_id":"165e34c6-070a-48b0-8342-5f794d0b255f","resolution":{"observed_at":"2026-08-04T13:24:27.003315Z","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-04T13:24:27.159751Z","title":"Query complexity of clustering with side information","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.159751Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:7847ecdad719161932cdc3245f8f984f995897e0c473be8a0c62d42514f6105e","observation_id":"391a8907-727e-46dd-89b7-4186774271c8","resolution":{"observed_at":"2026-08-04T13:24:27.159751Z","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-04T13:24:27.283080Z","title":"A theoretical analysis of first heuristics of crowdsourced entity resolution","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.283080Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:28ff16a30fa6879f631b41a3354d1cba5d8f580cb2b0f5f9349743b99de4a977","observation_id":"126fea4f-361a-4d5b-aec7-5e1162c780af","resolution":{"observed_at":"2026-08-04T13:24:27.283080Z","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-04T13:24:27.401539Z","title":"Optimally reconstructing weighted graphs using queries","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.401539Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:7b8f14f0fec56794312a5bfa6539896d7c261c83d5720f75993f60a69ac9b674","observation_id":"1d491eed-1e0f-4530-8c16-a726e474cebb","resolution":{"observed_at":"2026-08-04T13:24:27.401539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-04T13:24:27.562527Z","title":"Tsourakakis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.562527Z"},"links":{"cited_paper":"/paper/1609.00750","citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:df068fe0d49ed6f5bf5dcf9e4af9a417df85060042f2aa466d753c6c8925c2b9","observation_id":"ee6505ab-7fcf-4cd4-b6ad-a12430861a7d","resolution":{"observed_at":"2026-08-04T13:24:27.562527Z","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-04T13:24:27.680869Z","title":"Learning and verifying graphs using queries with a focus on edge counting","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.680869Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:de68796a493f3d4c3e270748f31d6195e9ec6614c148802e28d8b48e62914519","observation_id":"f54cec6f-b7e9-427b-b111-4615d14efade","resolution":{"observed_at":"2026-08-04T13:24:27.680869Z","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-04T13:24:27.864242Z","title":"Franklin, and Jianhua Feng","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.864242Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:96f14dc3a013a837f4e2363721b4b8eaac51c35e5e85d95538d4a3b210a58d2c","observation_id":"27de4a23-2251-47c6-be57-0c2a1dbc6f34","resolution":{"observed_at":"2026-08-04T13:24:27.864242Z","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-04T13:24:28.011344Z","title":"Question selection for crowd entity resolution.Proceedings, Very Large Databases (VLDB), 6(6):349–360, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:28.011344Z"},"links":{"citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:54fbeec656924f0743ef2dc4853d676506c368bdfc8ab30ab918ba4c46288ae2","observation_id":"54466fa5-ecf3-412d-9028-dfbc69078c5d","resolution":{"observed_at":"2026-08-04T13:24:28.011344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T12:27:58.118928Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":27},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2608.02176."}