Paper Citation Record · LEDGER

Complexity of learning matchings and half graphs via edge queries

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2507.03151 v1

Coverage vector

measured 34 of 34 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T20:34:41.414078Z

measured 34 of 34 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

34 of 34 outbound references displayed

verified exact2
verified fuzzy27
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5735dce2-434c-488f-a31d-5c172c430fab · outbound

This paper cites Lower bounds for local search by quantum arguments.

Complexity of learning matchings and half graphs via edge queries Lower bounds for local search by quantum arguments

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:47.661119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 12e75160-2b5f-4164-b10b-a18d7004dfc4 · outbound

This paper cites an unresolved cited work.

Complexity of learning matchings and half graphs via edge queries Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-06T20:34:47.289939Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0836c9b4-4e75-48fc-bca0-c3d4bc127c8c · outbound

This paper cites Learning a hidden matching.

Complexity of learning matchings and half graphs via edge queries Learning a hidden matching

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:47.107744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 7570b845-eb45-4537-941c-8259fcc49c7b · outbound

This paper cites Learning a hidden graph using o(logn) queries per edge.

Complexity of learning matchings and half graphs via edge queries Learning a hidden graph using o(logn) queries per edge

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.969416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 04c2073f-cdc9-465d-9d9f-d00591073eec · outbound

This paper cites Quantum algorithms for matrix scaling and matrix balancing.

Complexity of learning matchings and half graphs via edge queries Quantum algorithms for matrix scaling and matrix balancing

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.807889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 39310afa-83c1-431f-9b01-b55af8bd62ee · outbound

This paper cites Combinatorial search.

Complexity of learning matchings and half graphs via edge queries Combinatorial search

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.628596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ad7b90e1-6411-4cc8-8add-1c2e4806170a · outbound

This paper cites All classical adversary methods are equivalent for total functions.

Complexity of learning matchings and half graphs via edge queries All classical adversary methods are equivalent for total functions

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.457418Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fac40ab5-744a-4881-ac24-7c27dce2ccc0 · outbound

This paper cites Quantum lower bounds by quantum arguments.

Complexity of learning matchings and half graphs via edge queries Quantum lower bounds by quantum arguments

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.276451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2575bee7-3684-4232-9d0c-99f032d394eb · outbound

This paper cites Tight bounds on quantum searching.

Complexity of learning matchings and half graphs via edge queries Tight bounds on quantum searching

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:46.124910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation da203460-83b3-4845-939a-bfddd37e3a63 · outbound

This paper cites Network discovery and verification.

Complexity of learning matchings and half graphs via edge queries Network discovery and verification

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.968997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 516cef24-3337-4fdd-8876-ea33865def3b · outbound

This paper cites Optimal distance query reconstruction for graphs without long induced cycles.

Complexity of learning matchings and half graphs via edge queries Optimal distance query reconstruction for graphs without long induced cycles

Reference 11

Resolution: verified exact; local_arxiv, observed 2026-08-06T20:34:42.100188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 838f39d3-45ba-4d7e-ae94-1f9b86c9b303 · outbound

This paper cites Combinatorial search on graphs motivated by bioinformatics applications: A brief survey.

Complexity of learning matchings and half graphs via edge queries Combinatorial search on graphs motivated by bioinformatics applications: A brief survey

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.774518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation b1c9cb50-8190-4c17-97f6-b15ce793ec62 · outbound

This paper cites Complexity measures and decision tree complexity: a survey.

Complexity of learning matchings and half graphs via edge queries Complexity measures and decision tree complexity: a survey

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-06T20:34:40.199019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40b3144c-f341-48dc-8243-a9eb0dc6b7fc · outbound

This paper cites Optimal query complexity bounds for finding graphs.

Complexity of learning matchings and half graphs via edge queries Optimal query complexity bounds for finding graphs

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.592168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 85435b31-06c8-4be1-8150-b07c57312ba8 · outbound

This paper cites Introduction to algorithms.

Complexity of learning matchings and half graphs via edge queries Introduction to algorithms

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-06T20:34:40.323843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b145bd7a-76d3-4f23-9191-1cb3c32f6987 · outbound

This paper cites On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting.

Complexity of learning matchings and half graphs via edge queries On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting

Reference 16

Resolution: metadata mismatch; local_arxiv, observed 2026-08-06T20:34:41.912705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 60cb693a-661d-4c91-9c12-5845b4e5ff47 · outbound

This paper cites An algorithm for bichromatic sorting with polylog competitive ratio.

Complexity of learning matchings and half graphs via edge queries An algorithm for bichromatic sorting with polylog competitive ratio

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.385264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ec91bd5d-a5bf-4217-90b9-130908e62791 · outbound

This paper cites On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting.

Complexity of learning matchings and half graphs via edge queries On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.208060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 7393e857-cddc-4a2a-bb44-a033a4dbf719 · outbound

This paper cites Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs.

Complexity of learning matchings and half graphs via edge queries Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:45.007899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c6d375b4-ccdf-419a-836c-733235611d9d · outbound

This paper cites Optimal reconstruction of graphs under the additive model.

Complexity of learning matchings and half graphs via edge queries Optimal reconstruction of graphs under the additive model

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.842502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 7b1b1229-a51e-4614-8d44-195f9b709487 · outbound

This paper cites A fast quantum mechanical algorithm for database search.

Complexity of learning matchings and half graphs via edge queries A fast quantum mechanical algorithm for database search

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.683309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a60e1c24-6f2f-499f-a490-9a792ab7aa7c · outbound

This paper cites Quantum complexities of ordered searching, sorting, and element distinctness.

Complexity of learning matchings and half graphs via edge queries Quantum complexities of ordered searching, sorting, and element distinctness

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.504070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 73db35aa-871d-444f-8fbf-65253b606db5 · outbound

This paper cites Randomized communication and implicit graph representations.

Complexity of learning matchings and half graphs via edge queries Randomized communication and implicit graph representations

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.347323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a397ac70-da80-422c-8dca-b06d51d44095 · outbound

This paper cites Matching nuts and bolts in o(n log n) time.

Complexity of learning matchings and half graphs via edge queries Matching nuts and bolts in o(n log n) time

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.195736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 343a9875-8ed9-424f-ae5d-b3845c761ed5 · outbound

This paper cites Near-linear query complexity for graph inference.

Complexity of learning matchings and half graphs via edge queries Near-linear query complexity for graph inference

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:44.042135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 192a1503-e41e-4205-9917-625a11604b2d · outbound

This paper cites Graph reconstruction via MIS queries.

Complexity of learning matchings and half graphs via edge queries Graph reconstruction via MIS queries

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:43.842678Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation e817088c-e51b-4e1e-ae0b-b666ff4631a8 · outbound

This paper cites Reconstructing random graphs from distance queries.

Complexity of learning matchings and half graphs via edge queries Reconstructing random graphs from distance queries

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-06T20:34:41.652505Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 54b39095-d930-4ec0-86da-103e2efb0c23 · outbound

This paper cites Quantum algorithms for learning a hidden graph.

Complexity of learning matchings and half graphs via edge queries Quantum algorithms for learning a hidden graph

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:43.697911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f099d793-3cac-4200-9449-a1beba35cd46 · outbound

This paper cites Graph reconstruction via distance oracles.

Complexity of learning matchings and half graphs via edge queries Graph reconstruction via distance oracles

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:43.521984Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 94fcb958-a75e-4449-b881-04a13af67d65 · outbound

This paper cites A simple algorithm for graph reconstruction.

Complexity of learning matchings and half graphs via edge queries A simple algorithm for graph reconstruction

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:43.141470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2a7c1260-bb09-4baa-aa56-3bb2add630a1 · outbound

This paper cites Quantum computation and quantum information , volume 2.

Complexity of learning matchings and half graphs via edge queries Quantum computation and quantum information , volume 2

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:42.805497Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3a66916e-5282-4f1b-bb87-744b24c7b5d5 · outbound

This paper cites an unresolved cited work.

Complexity of learning matchings and half graphs via edge queries Unresolved cited work

Reference 32

Resolution: unresolved; raw_fallback, observed 2026-08-06T20:34:42.537020Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation bacc4dea-308c-4ab7-87a0-3a0618a8f7a5 · outbound

This paper cites Reconstruction and verification of chordal graphs with a distance oracle.

Complexity of learning matchings and half graphs via edge queries Reconstruction and verification of chordal graphs with a distance oracle

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:42.414235Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c5b5d860-56ba-4985-8a43-16c238b12a22 · outbound

This paper cites Probabilistic computations: Toward a unified measure of complexity.

Complexity of learning matchings and half graphs via edge queries Probabilistic computations: Toward a unified measure of complexity

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T20:34:42.254034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.