Paper Citation Record · LEDGER

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles

As of 8 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2607.01216.

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

pith.paper-citation-record.v1
2607.01216 v1

Coverage vector

measured 34 of 34 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-02T04:00:51.707120Z

measured 35 of 35 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 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T13:24:25.916838Z

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 exact1
verified fuzzy33
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e65e5550-9b5d-4bcc-a443-c780229f8e00 · outbound

This paper cites Deterministic edge connectivity and max flow using subquadratic cut queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Deterministic edge connectivity and max flow using subquadratic cut queries

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.787043Z

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 c608ea05-1891-407c-9bca-df25dcb88855 · outbound

This paper cites Learning a hidden hypergraph.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Learning a hidden hypergraph

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.779577Z

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 9756d955-b3ed-4793-99b3-be3fd96be209 · outbound

This paper cites Cut query algorithms with star contraction.Proc., IEEE Conference on the Foundations of Computer Science (FOCS), pages 507–518, 2022.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Cut query algorithms with star contraction.Proc., IEEE Conference on the Foundations of Computer Science (FOCS), pages 507–518, 2022

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.790021Z

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 e0759fc9-01c4-41be-bb09-edeb2e9752e7 · outbound

This paper cites Graph connectivity and single element recovery via linear and or queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Graph connectivity and single element recovery via linear and or queries

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.770859Z

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 50ca7307-287e-4379-addf-40dbf8908582 · outbound

This paper cites On the query complexity of connectivity with global queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles On the query complexity of connectivity with global queries

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-07-02T04:06:34.634273Z

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 2d89f3d4-daca-4eea-bf65-f1e2a5f26a08 · outbound

This paper cites Improved lower bounds for submodular function minimization.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Improved lower bounds for submodular function minimization

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.789447Z

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 abd78e7f-6cd0-4d27-96cf-c61e205a6f7d · outbound

This paper cites A query algorithm for learning a spanning forest in weighted undirected graphs.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles A query algorithm for learning a spanning forest in weighted undirected graphs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.731976Z

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 62498316-aab8-460b-b3ce-058d5f8ec1cc · outbound

This paper cites Learning partitions using rank queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Learning partitions using rank queries

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.768476Z

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 31f791b8-ae0e-48d3-a1c9-5c9b2cd0ba75 · outbound

This paper cites Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.773281Z

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 9bd0f184-836f-48e6-896b-883951d636d4 · outbound

This paper cites Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.776006Z

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 ec3d1d0a-b172-4abb-9312-f9492d792283 · outbound

This paper cites Near-linear size hypergraph cut sparsifiers.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Near-linear size hypergraph cut sparsifiers

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.793554Z

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 a30ba41e-4c7c-4796-b69d-2c89ebb74eab · outbound

This paper cites Sublinear time hypergraph sparsification via cut and edge sampling queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Sublinear time hypergraph sparsification via cut and edge sampling queries

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.801134Z

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 3fa5fb93-00fc-4d7e-b0de-f7596f8bb208 · outbound

This paper cites Polynomial time optimal query algorithms for finding graphs with arbitrary real weights.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Polynomial time optimal query algorithms for finding graphs with arbitrary real weights

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.795620Z

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 2075e303-deb6-477b-9ea3-0618a359460c · outbound

This paper cites A linear hypergraph extension of tur´an’s theorem.The Electronic Journal of Combinatorics, pages P4–41, 2022.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles A linear hypergraph extension of tur´an’s theorem.The Electronic Journal of Combinatorics, pages P4–41, 2022

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.792786Z

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 e7a07d1b-470b-4ff9-b1d6-96d503a9a9fb · outbound

This paper cites Vertex and hyperedge connectivity in dynamic graph streams.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Vertex and hyperedge connectivity in dynamic graph streams

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.771391Z

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 845863e8-8373-47a7-9aa4-5ada4fe94d3b · outbound

This paper cites PhD thesis, Mas- sachusetts Institute of Technology, 2008.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles PhD thesis, Mas- sachusetts Institute of Technology, 2008

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.781412Z

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 7e08dcb4-2c0f-47f7-93aa-d9b9ce1b938d · outbound

This paper cites Dirac’s theorem for linear hypergraphs.SIAM Journal on Discrete Mathematics (SIDMA), 39(2):834–847, 2025.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Dirac’s theorem for linear hypergraphs.SIAM Journal on Discrete Mathematics (SIDMA), 39(2):834–847, 2025

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.766206Z

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 df452838-3d5a-4c00-8dc5-ad43f0f9fbd1 · outbound

This paper cites Regular subgraphs of linear hypergraphs.Interna- tional Mathematics Research Notices, 2024(17):12366–12381, 2024.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Regular subgraphs of linear hypergraphs.Interna- tional Mathematics Research Notices, 2024(17):12366–12381, 2024

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.749062Z

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 998742bc-d539-4294-b2a0-53f90d382850 · outbound

This paper cites Minimizing convex functions with rational minimizers.Journal of the ACM, 70(1):1– 27, 2022.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Minimizing convex functions with rational minimizers.Journal of the ACM, 70(1):1– 27, 2022

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.765860Z

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 d762cfc8-cabd-4379-8de3-fb9bd8bb3e9c · outbound

This paper cites Minimum cuts with fewer cut queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Minimum cuts with fewer cut queries

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.763373Z

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 fd002661-288e-4758-b186-47fcd859e6ca · outbound

This paper cites Cut Sparsification and Succinct Representation of Sub- modular Hypergraphs.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Cut Sparsification and Succinct Representation of Sub- modular Hypergraphs

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.804476Z

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 2e124bcb-b291-4840-a416-15f652cb5390 · outbound

This paper cites Cut-Query Algorithms with Few Rounds.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Cut-Query Algorithms with Few Rounds

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.773702Z

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 9389204d-0dcf-440c-a979-53787056e8eb · outbound

This paper cites All-pairs minimum cut using cut queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles All-pairs minimum cut using cut queries

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.777644Z

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 8e222e6f-6eb5-46e8-ac9e-19aafdb7be48 · outbound

This paper cites Faster all-pairs minimum cut: Bypassing exact max-flow.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Faster all-pairs minimum cut: Bypassing exact max-flow

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.784988Z

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 e621e276-f573-44bc-a0ec-b4f1e796ae97 · outbound

This paper cites Near-optimal size linear sketches for hyper- graph cut sparsifiers.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Near-optimal size linear sketches for hyper- graph cut sparsifiers

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.753974Z

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 aa39e5f3-6741-4c0b-b622-8c6bdf146ee6 · outbound

This paper cites Sketching cuts in graphs and hypergraphs.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Sketching cuts in graphs and hypergraphs

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.782923Z

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 2225a0f3-6fa9-408f-8d39-cceb7c198938 · outbound

This paper cites Quantum algorithms for graph problems with cut queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Quantum algorithms for graph problems with cut queries

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.699614Z

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 e29ef8ea-9c29-42be-991b-2271ba62d03f · outbound

This paper cites Deterministic min-cut in poly-logarithmic max-flows.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Deterministic min-cut in poly-logarithmic max-flows

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.703575Z

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 fa90ab0a-fd94-4227-8916-1aa34333f021 · outbound

This paper cites Learning spanning forests optimally in weighted undirected graphs with cut queries.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Learning spanning forests optimally in weighted undirected graphs with cut queries

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.720739Z

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 4e7fc564-3913-4d34-961e-e7e03f8371cf · outbound

This paper cites Weighted min-cut: sequential, cut-query, and streaming algorithms.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Weighted min-cut: sequential, cut-query, and streaming algorithms

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.768545Z

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 87e165a2-a8e8-47be-96c4-a845f354bb8f · outbound

This paper cites A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph.Algorithmica, 7(1):583–596, 1992.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph.Algorithmica, 7(1):583–596, 1992

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.745960Z

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 4bfcbe02-8d4b-4899-8c17-571e6a6af474 · outbound

This paper cites Quotient sparsification for submodular functions.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Quotient sparsification for submodular functions

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.757382Z

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 1b77234a-bf4a-4fc4-b4da-b95022ed63b7 · outbound

This paper cites Minimizing symmetric submodular functions.Mathematical Programming, 82:3–12, 1998.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Minimizing symmetric submodular functions.Mathematical Programming, 82:3–12, 1998

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.748116Z

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 4c230e68-6de8-4589-84cf-e29d4aa3ca3a · outbound

This paper cites Matthew Weinberg.

Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Matthew Weinberg

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T08:32:07.796809Z

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

Observation 01a92096-9361-4a9c-b727-d1193eaa4f10 · inbound

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds cites this paper.

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T13:24:25.916838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.