{"as_of":"2026-08-08T06:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:594e144f81245c7e8d93abd21061a9deff516fe787c98d9aaddb9d494609f195","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:34:41.414078Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"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/2507.03151/citation-record","integrity":"/paper/2507.03151/integrity","json":"/paper/2507.03151/citation-record.json","paper":"/paper/2507.03151"},"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-06T20:34:47.502949Z","title":"Lower bounds for local search by quantum arguments","venue":null,"work_id":"51d29a2b-544a-4b87-9f04-ed51a132f0f7","year":2004},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.280889Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:854ed9c18611d86af00e6fe22e0afa7bf0a4d6fc293840675406a89d2a5e58d0","observation_id":"5735dce2-434c-488f-a31d-5c172c430fab","resolution":{"observed_at":"2026-08-06T20:34:47.661119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:47.195349Z","title":null,"venue":null,"work_id":"f1ed3d2f-d7c9-4792-bd05-f93e88e6fa99","year":2019},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.368693Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:0b4d62547519dcd818e4786737b335e5d40402096a5e818bf96bb34d2a1a951c","observation_id":"12e75160-2b5f-4164-b10b-a18d7004dfc4","resolution":{"observed_at":"2026-08-06T20:34:47.289939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:47.051399Z","title":"Learning a hidden matching","venue":null,"work_id":"31e60673-ba59-4e3c-ab24-b75f1c4a9472","year":2004},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.466583Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:523f71fe1e0b1567b212da6ac730301e1540fbb6b0c4ffd56a98603f2dea253a","observation_id":"0836c9b4-4e75-48fc-bca0-c3d4bc127c8c","resolution":{"observed_at":"2026-08-06T20:34:47.107744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.908355Z","title":"Learning a hidden graph using o(logn) queries per edge","venue":null,"work_id":"2eb52747-b4e2-46cb-b081-6a66d73be11d","year":2008},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.539510Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:434eeceff88c0d6a736ec403f37803fe14db3d8d6ea02c683c31b6af86b29737","observation_id":"7570b845-eb45-4537-941c-8259fcc49c7b","resolution":{"observed_at":"2026-08-06T20:34:46.969416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.736132Z","title":"Quantum algorithms for matrix scaling and matrix balancing","venue":null,"work_id":"2a72f219-b9a4-437e-b003-81cbf92cd33b","year":2021},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.644753Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:ac8ae59957c3175d6b9d65ee18ad14131dbd764400e7020af801beb06e56d57d","observation_id":"04c2073f-cdc9-465d-9d9f-d00591073eec","resolution":{"observed_at":"2026-08-06T20:34:46.807889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.552092Z","title":"Combinatorial search","venue":null,"work_id":"ee3dc3c3-8ec3-4c5d-b765-024e85949739","year":1988},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.712623Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:937d28ceb334d9f94f278c0e7ddd03a78113d2b9a90dfbb5149613e6a52f804c","observation_id":"39310afa-83c1-431f-9b01-b55af8bd62ee","resolution":{"observed_at":"2026-08-06T20:34:46.628596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.372840Z","title":"All classical adversary methods are equivalent for total functions","venue":null,"work_id":"ac8a4afc-f5dd-4a6b-9764-1125b2333f2f","year":2021},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.823826Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:141053f9b7bc82e4a5150ad46177853369aa1a1373355dc35e7219b20006ddab","observation_id":"ad7b90e1-6411-4cc8-8add-1c2e4806170a","resolution":{"observed_at":"2026-08-06T20:34:46.457418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.219488Z","title":"Quantum lower bounds by quantum arguments","venue":null,"work_id":"79d995b5-caef-4530-8f2a-ef31f798f49c","year":2002},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.912645Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:1a7fb3e5c438a7abda15cf5619f58d1c33f9580e729b267205b00c7bc78ad8ba","observation_id":"fac40ab5-744a-4881-ac24-7c27dce2ccc0","resolution":{"observed_at":"2026-08-06T20:34:46.276451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:46.069912Z","title":"Tight bounds on quantum searching","venue":null,"work_id":"c58b86c0-72b1-48df-ab8c-ef054a2523e6","year":1998},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:39.976060Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:ac4f5312d54a229559329c89f750e3b854f1e64d312d61d4edc0cbad8cb4a31f","observation_id":"2575bee7-3684-4232-9d0c-99f032d394eb","resolution":{"observed_at":"2026-08-06T20:34:46.124910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:45.888781Z","title":"Network discovery and verification","venue":null,"work_id":"c83259ef-330e-4cf9-9140-f5f7872c383b","year":2006},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.037382Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:3d7f544e24edfe2554e4f87327c858a841d0ffb23d41a187052610120813d717","observation_id":"da203460-83b3-4845-939a-bfddd37e3a63","resolution":{"observed_at":"2026-08-06T20:34:45.968997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-04T10:42:38.289722Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":"2306.05979","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-06T20:34:42.037125Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","venue":"cs.DS","work_id":"70899b42-39a4-4cad-b62f-572c4eaa9216","year":2023},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.083523Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:3c51d75682424be7d7cea0464e7451c78bc3f0ad9ff5dd686492a95ffa01ec3b","observation_id":"516cef24-3337-4fdd-8876-ea33865def3b","resolution":{"observed_at":"2026-08-06T20:34:42.100188Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:45.709847Z","title":"Combinatorial search on graphs motivated by bioinformatics applications: A brief survey","venue":null,"work_id":"4074460d-89a5-46df-8ece-60f1c5c78331","year":2005},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.147591Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:c1025730966a4fd2411940c5a0b3c1bcfbe050ad6e20e0ecb1ce530097bd9773","observation_id":"838f39d3-45ba-4d7e-ae94-1f9b86c9b303","resolution":{"observed_at":"2026-08-06T20:34:45.774518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:40.199019Z","title":"Complexity measures and decision tree complexity: a survey","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.199019Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:54b91368664ab299544e05f87746d865fd8a126398fd9a26b8b2ddafff3a4716","observation_id":"b1c9cb50-8190-4c17-97f6-b15ce793ec62","resolution":{"observed_at":"2026-08-06T20:34:40.199019Z","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-06T20:34:45.503552Z","title":"Optimal query complexity bounds for finding graphs","venue":null,"work_id":"b5994002-ebdd-4fa6-a882-351e3ccb3448","year":2010},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.256064Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:5bd75a92febfc81e994420ff50d3b8f14b7134a0dded2bcf756d1ff92dd03015","observation_id":"40b3144c-f341-48dc-8243-a9eb0dc6b7fc","resolution":{"observed_at":"2026-08-06T20:34:45.592168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:40.323843Z","title":"Introduction to algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.323843Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:2da617647f50f93abc097c0cf1d76286adba0d48662069f5b0132f70f7de5dd9","observation_id":"85435b31-06c8-4be1-8150-b07c57312ba8","resolution":{"observed_at":"2026-08-06T20:34:40.323843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.04601","last_updated":"2024-07-15T14:08:45Z","snapshot_observed_at":"2026-07-06T14:16:00.994096Z","submitted_at":"2022-11-08T22:52:12Z","title":"On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting","version":4},"cited_work":{"arxiv_id":"2211.04601","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.04601","snapshot_observed_at":"2026-08-06T20:34:41.806071Z","title":"On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting","venue":"cs.DS","work_id":"90d607aa-03c3-4735-8bab-4d9e476b348c","year":2022},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.384954Z"},"links":{"cited_paper":"/paper/2211.04601","citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:8b00ab7a2d2d12e104b43db78f183202d517a12ca99252bc4371d44aedfc5d8f","observation_id":"b145bd7a-76d3-4f23-9191-1cb3c32f6987","resolution":{"observed_at":"2026-08-06T20:34:41.912705Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:45.301937Z","title":"An algorithm for bichromatic sorting with polylog competitive ratio","venue":null,"work_id":"0ac090aa-4be8-457e-9c57-9b7bc194277d","year":2024},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.456004Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:e7ac62bfc923721f469684ded8f7993fdd97055f62cea0ef4ff19889f74e1c2e","observation_id":"60cb693a-661d-4c91-9c12-5845b4e5ff47","resolution":{"observed_at":"2026-08-06T20:34:45.385264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:45.133367Z","title":"On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting","venue":null,"work_id":"b04f698b-a0a0-4a5d-aa2a-8e0ded932fb6","year":2024},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.514951Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:97811c8d12b505e5ea0a6d151cc0214eaf62cf4f7316dfc62e303948bcbe1364","observation_id":"ec91bd5d-a5bf-4217-90b9-130908e62791","resolution":{"observed_at":"2026-08-06T20:34:45.208060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.926600Z","title":"Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs","venue":null,"work_id":"b5da9b5b-29ee-479e-9c2e-acc36a1c43d3","year":1997},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.572740Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:5e616c0657ef3afa77018856c8e07bdc79fc72b89e5c99c9de1e83c8355e7a45","observation_id":"7393e857-cddc-4a2a-bb44-a033a4dbf719","resolution":{"observed_at":"2026-08-06T20:34:45.007899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.778910Z","title":"Optimal reconstruction of graphs under the additive model","venue":null,"work_id":"75f4dc8b-a943-4b79-b10b-e3db1f7b9810","year":2000},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.635698Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:1c1fb196885db5720ff2fd8414ddea5641eb32e60c2c99e9d75ca6b8434aaeed","observation_id":"c6d375b4-ccdf-419a-836c-733235611d9d","resolution":{"observed_at":"2026-08-06T20:34:44.842502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.601442Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":"0b82855e-ed2b-4789-9e73-2f54cc0c7070","year":1996},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.696632Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:80df74c9e77d236da464bbac888f769139c2da867ecf21218b6c23c24fcfb089","observation_id":"7b1b1229-a51e-4614-8d44-195f9b709487","resolution":{"observed_at":"2026-08-06T20:34:44.683309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.425396Z","title":"Quantum complexities of ordered searching, sorting, and element distinctness","venue":null,"work_id":"bfccad4a-2035-49a0-b34f-fa650a702803","year":2002},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.741240Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:185e431e674859c1ef5cde0cc95ae9eccb38b05e5076b2e6f3b19e8e1b2d465c","observation_id":"a60e1c24-6f2f-499f-a490-9a792ab7aa7c","resolution":{"observed_at":"2026-08-06T20:34:44.504070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.284925Z","title":"Randomized communication and implicit graph representations","venue":null,"work_id":"41aed0db-4fef-4940-b1a2-cd2c60a155ac","year":2022},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.797891Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:664d572ab11ff6d2f97d99bb2b1a2dfe7712c73b3f45c4e27a9e3046ce8228e7","observation_id":"73db35aa-871d-444f-8fbf-65253b606db5","resolution":{"observed_at":"2026-08-06T20:34:44.347323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:44.138166Z","title":"Matching nuts and bolts in o(n log n) time","venue":null,"work_id":"e93f27b1-4e77-4a7c-9cf1-335782b3e942","year":1998},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.839542Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:99b9a39a3b277b2bf2b496df6c8b45dfc51bd376f1470d4327ea33fe9d020ee1","observation_id":"a397ac70-da80-422c-8dca-b06d51d44095","resolution":{"observed_at":"2026-08-06T20:34:44.195736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:43.937002Z","title":"Near-linear query complexity for graph inference","venue":null,"work_id":"5752ba39-16cc-4e3d-94cc-6b7758952cdb","year":2015},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.894991Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:45a7fa1cb9095323df01c5b6588038571868bc2c3735f8d268e641a385d6975e","observation_id":"343a9875-8ed9-424f-ae5d-b3845c761ed5","resolution":{"observed_at":"2026-08-06T20:34:44.042135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:43.766317Z","title":"Graph reconstruction via MIS queries","venue":null,"work_id":"cf2c8892-d56f-472a-8f94-be3fb6f86529","year":2025},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.944241Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:71450a14e872b9645ca13adfbcb574b257b129cc9ce111a3909589c0b3952179","observation_id":"192a1503-e41e-4205-9917-625a11604b2d","resolution":{"observed_at":"2026-08-06T20:34:43.842678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18318","last_updated":"2024-07-29T20:13:20Z","snapshot_observed_at":"2026-07-06T18:06:44.995721Z","submitted_at":"2024-04-28T21:04:46Z","title":"Reconstructing random graphs from distance queries","version":2},"cited_work":{"arxiv_id":"2404.18318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.18318","snapshot_observed_at":"2026-08-06T20:34:41.579460Z","title":"Reconstructing random graphs from distance queries","venue":"math.CO","work_id":"88b6025e-48cd-437f-aa0e-d6c24b36c621","year":2024},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.990096Z"},"links":{"cited_paper":"/paper/2404.18318","citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:bc31f697e396a49ebf41cf1202a03d281485cbb6f30ac9b7f44f7b92c6174151","observation_id":"e817088c-e51b-4e1e-ae0b-b666ff4631a8","resolution":{"observed_at":"2026-08-06T20:34:41.652505Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:43.620493Z","title":"Quantum algorithms for learning a hidden graph","venue":null,"work_id":"b90142cb-eafb-4b36-8df6-ab1937110ee7","year":2022},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.030818Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:2cc64e931af521692742bf99e23500b2dd364aaafd6ff7ac408a75fc9002c64c","observation_id":"54b39095-d930-4ec0-86da-103e2efb0c23","resolution":{"observed_at":"2026-08-06T20:34:43.697911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:43.308549Z","title":"Graph reconstruction via distance oracles","venue":null,"work_id":"bdf8d92b-55f6-4573-9afb-6fd532ad970b","year":2013},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.090736Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:15679118803e466ee2a7e752e2ee4928e1b57279430d0fcb09b75e508b1381e0","observation_id":"f099d793-3cac-4200-9449-a1beba35cd46","resolution":{"observed_at":"2026-08-06T20:34:43.521984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:42.979431Z","title":"A simple algorithm for graph reconstruction","venue":null,"work_id":"e7072b94-ac45-4318-908a-ccfb534ef688","year":2023},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.133277Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:1d8be3363abdf160c2466024a28a8a4abd641b2fd78c89c93cb0f6017a0942c2","observation_id":"94fcb958-a75e-4449-b881-04a13af67d65","resolution":{"observed_at":"2026-08-06T20:34:43.141470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:42.671451Z","title":"Quantum computation and quantum information , volume 2","venue":null,"work_id":"84e84a5f-df22-46c3-8971-80658e44c037","year":2001},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.192376Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:c25a665824356afee3978ffcd3c0f0fb37ba8d1c1d39c40951471c2f8b03acd7","observation_id":"2a7c1260-bb09-4baa-aa56-3bb2add630a1","resolution":{"observed_at":"2026-08-06T20:34:42.805497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:42.442347Z","title":null,"venue":null,"work_id":"779d6022-85e1-4875-9066-cfe8cc62d481","year":1992},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.247495Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:4e6814f8d08cf694e377fa2934a9274787f0921839fc1797162bb53db7183415","observation_id":"3a66916e-5282-4f1b-bb87-744b24c7b5d5","resolution":{"observed_at":"2026-08-06T20:34:42.537020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:42.344863Z","title":"Reconstruction and verification of chordal graphs with a distance oracle","venue":null,"work_id":"8c236cdd-0782-4ad0-8f26-a458f1150b4e","year":2021},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.323399Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:d1bbac275e4e5ad291b6a3d51f66261b2c3c7a892dd728510c7c5218d7093f68","observation_id":"bacc4dea-308c-4ab7-87a0-3a0618a8f7a5","resolution":{"observed_at":"2026-08-06T20:34:42.414235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-06T20:34:42.184870Z","title":"Probabilistic computations: Toward a unified measure of complexity","venue":null,"work_id":"89d988e2-feab-49ec-91dc-a2b84442f59f","year":1977},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:41.414078Z"},"links":{"citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:b43f0d7c772e835ca12559039c348e6a33c540bba013a57bfdc4af689c810382","observation_id":"c5b5d860-56ba-4985-8a43-16c238b12a22","resolution":{"observed_at":"2026-08-06T20:34:42.254034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":34},"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 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2507.03151."}