{"as_of":"2026-08-08T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a97ce87aa25a41fa6e2ec00fde0465addb9208cb7dbe01992d6e20cca2bd3ce","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-08T06:32:00.761636+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-06T23:37:00.548015Z","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:3ac345ffe134763210f6bc1645c4e05b94a7704bbb7d5b298d28f48593009e39","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-06T23:37:00.548015Z","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:825cdc45b778de3ac30cce8819d4b6c77b763f88c39ebfc6310bf16b390e3a9c","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-06T23:37:00.548015Z","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:884586fb3b1d19ef28f7fd0f27e95059d06e948ff3098abbf3e75c5c8934a7e4","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-06T23:37:00.548015Z","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:e605669a051ea33ef8c75d1a56bc831e4cce9dc8c7187f8c1759c67c44b2641e","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-06T23:37:00.548015Z","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:9b7265b813d819b79a36c8d689cc23753975b371258ea2cf56ccfb1a715a0e27","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-06T23:37:00.548015Z","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:30352f5eb27e4720797f6385435f092c84cf09144149da023619284c548182c6","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-06T23:37:00.548015Z","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:1c2c329b3c9496de9bd20b8f78f2cd16517771f4c0499d49761e88a3d56e41e0","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-06T23:37:00.548015Z","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:7542db92aa29d538d4ee092ee05973335cbc075dc8a13fe3c28acb96b8462cf9","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-06T23:37:00.548015Z","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:a0679a04f7a3935420c2914e16d976b0daef51547a1af9913467014f18cb07bf","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-06T23:37:00.548015Z","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:ce69c238c3cf06c7775f2d862d840b620a2c30f2535d2b05259655a950d8311a","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-06T23:37:00.548015Z","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:338eebb5ab30c91bf4aaee612777349ed7b0deb90460f5cd05628858dd92cab4","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-06T23:37:00.548015Z","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:627135c0a4efff82044ad4668442a3b48cf42ea172a44189b6cfe14a9d64e5b4","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-03T08:15:15.167213Z","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-06T23:37:00.548015Z","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:a13df48e85f8411b6555432400e2eeeb6a78e3ca4b04b570dfb8c918b97ae54a","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-06T23:37:00.548015Z","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:ffea0c1262dc2c7c736b292f330b633969b7f59e7ce5702a45100d496a9b2e1d","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-06T23:37:00.548015Z","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:6a9319016abd43ca600d3dd029cda92e7709239e8f67b44de54f5a6c8285b769","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-06T23:37:00.548015Z","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:873599f805108be44c5b0d621a55a8bd3d047a6b8826d0476d4b09958833e29f","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-06T23:37:00.548015Z","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:fd651587143ba4ae68a587ac8c024b7f010a200b96205ac9f3e177db518e23dd","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-06T23:37:00.548015Z","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:64b9c008702f1c0f0cb6e2768ff7e597747872f3e09f68f1604b0a652b888339","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-06T23:37:00.548015Z","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:cc54f6573b97837f3a8a90923163983d1099a195f139c574d9ac60556ff0f14d","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-06T23:37:00.548015Z","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:ab1857dbddefe7f797ee6c1f225f0d62cc44579cc3ff1e1080bade74e579037f","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-06T23:37:00.548015Z","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:5bbc49da9160be13eb3556d25cf5f2d0237333a820a539f7985d9baf2270d91a","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-06T23:37:00.548015Z","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:cdefad8deeffc9766e3894645147870291fe8e111fa8ff8f8985441a8aba5713","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-06T23:37:00.548015Z","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:9fa3575b607d2707fe1841c6f3475b1d5d805ff5a8c4d75b3e6732c181f873e8","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-07-06T05:09:08.360468Z","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-06T23:37:00.548015Z","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:834700a12ccf207ff76392126dbecb4e16f93805640a7043ca0665c13a000546","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-06T23:37:00.548015Z","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:37c4ad1459caa533f68f8b4cca57153e6d2e8fff71703ef0733d809a8f65a9fc","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-06T23:37:00.548015Z","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:69ed12181dfdf4d8e78532a1cbe392a608b9fb3064153645359a4320a38a67a0","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-06T23:37:00.548015Z","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:a9848eb7efd7af57978bbbe4cda0eacb042e905d344ffd3a84bb7b8a2a60a55e","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-06T23:37:00.548015Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2608.02176."}