{"as_of":"2026-08-08T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd99df0031bba3af9fdea6c04045c90d0974f2d6e4ebaa88b8ed79376e382ac1","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-07-02T04:00:51.707120Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:24:25.916838Z","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":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2607.01216/citation-record","integrity":"/paper/2607.01216/integrity","json":"/paper/2607.01216/citation-record.json","paper":"/paper/2607.01216"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T08:32:07.783838Z","title":"Deterministic edge connectivity and max flow using subquadratic cut queries","venue":null,"work_id":"f22ef81e-6f46-478e-87f0-f35050956479","year":2025},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:123b10511971b307f6c2e6733e29cdfa57c6530982dd82464d910c36c6e1220d","observation_id":"e65e5550-9b5d-4bcc-a443-c780229f8e00","resolution":{"observed_at":"2026-07-06T08:32:07.787043Z","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-07-06T08:32:07.777989Z","title":"Learning a hidden hypergraph","venue":null,"work_id":"66a2ebd2-10db-4ce7-89ff-41f349b7b3cf","year":2005},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:7ad809b539916ac2eab9363cac50fd85cf962deadc39c97ffa7618ac40d8ec0d","observation_id":"c608ea05-1891-407c-9bca-df25dcb88855","resolution":{"observed_at":"2026-07-06T08:32:07.779577Z","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-07-06T08:32:07.788073Z","title":"Cut query algorithms with star contraction.Proc., IEEE Conference on the Foundations of Computer Science (FOCS), pages 507–518, 2022","venue":null,"work_id":"9d93d543-5730-480b-813b-16916e897823","year":2022},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:6a90e77efcfd1ad55d3ac330dd0b4f8f06ea367e0eaa54f05a5dcf61c1e44047","observation_id":"9756d955-b3ed-4793-99b3-be3fd96be209","resolution":{"observed_at":"2026-07-06T08:32:07.790021Z","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-07-06T08:32:07.769246Z","title":"Graph connectivity and single element recovery via linear and or queries","venue":null,"work_id":"18fab352-dc41-4a94-96c8-c05dad84c3a2","year":2021},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:0023c71fc895801a933dc7beda0c2d736c1cecbb70cad837e49cecb50965b664","observation_id":"e0759fc9-01c4-41be-bb09-edeb2e9752e7","resolution":{"observed_at":"2026-07-06T08:32:07.770859Z","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":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-05T18:39:32.015180Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":"2109.02115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-07-02T04:06:34.632759Z","title":"On the query complexity of connectivity with global queries.arXiv preprint arXiv:2109.02115, 2021","venue":null,"work_id":"a2110e42-f3f7-44bc-9769-f6046343bd71","year":2021},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:9a9dd9e688478eb605b7317a16bbd4b13c73f9ebb16f9369beba4e40835b9309","observation_id":"50ca7307-287e-4379-addf-40dbf8908582","resolution":{"observed_at":"2026-07-02T04:06:34.634273Z","resolver_source":"arxiv_id","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-07-06T08:32:07.787596Z","title":"Improved lower bounds for submodular function minimization","venue":null,"work_id":"157eabd7-c9e2-44fc-b103-054f0a5a8aad","year":2022},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:d22d469a77d1d5ea2cbdd5c27f15073d67b588e4ed154398bcf36ed15bff0f52","observation_id":"2d89f3d4-daca-4eea-bf65-f1e2a5f26a08","resolution":{"observed_at":"2026-07-06T08:32:07.789447Z","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-07-06T08:32:07.728127Z","title":"A query algorithm for learning a spanning forest in weighted undirected graphs","venue":null,"work_id":"388f27fe-0eea-4984-aec6-fc7a92daecd2","year":2023},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:7eacef2b58688e956e94fc458a15100ec09a9c5e70aa251a5c5e640e8cffd9b1","observation_id":"abd78e7f-6cd0-4d27-96cf-c61e205a6f7d","resolution":{"observed_at":"2026-07-06T08:32:07.731976Z","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-07-06T08:32:07.767097Z","title":"Learning partitions using rank queries","venue":null,"work_id":"0ca36b5f-282a-44d3-bde3-978415c576e9","year":2024},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:316135485e4954b7d3fc1233de92b0a3f42833637fd5baf376ce300051a880c3","observation_id":"62498316-aab8-460b-b3ce-058d5f8ec1cc","resolution":{"observed_at":"2026-07-06T08:32:07.768476Z","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-07-06T08:32:07.771958Z","title":"Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity","venue":null,"work_id":"9c834f2c-34c4-457d-ba09-0e624e198d21","year":2021},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:e3543512ce27e5254687a24b4b3723f8368c2c9ae2420d0a33fa47a0ee034ee1","observation_id":"31f791b8-ae0e-48d3-a1c9-5c9b2cd0ba75","resolution":{"observed_at":"2026-07-06T08:32:07.773281Z","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-07-06T08:32:07.774068Z","title":"Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018","venue":null,"work_id":"2fe44aab-daf1-458b-8d7e-22b791ff34ad","year":2018},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:23422b58e4fdde89fe3aaec1510a5f5b0cb153a5703dfe70643b612a567d7a28","observation_id":"9bd0f184-836f-48e6-896b-883951d636d4","resolution":{"observed_at":"2026-07-06T08:32:07.776006Z","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-07-06T08:32:07.791425Z","title":"Near-linear size hypergraph cut sparsifiers","venue":null,"work_id":"0a720148-5cb6-459a-a78a-39f3da3595ed","year":2020},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:96cf5c22862ab36a6ac6656212ee9a6969c9b2795a1067b6fdbc89b30f9af2bd","observation_id":"ec3d1d0a-b172-4abb-9312-f9492d792283","resolution":{"observed_at":"2026-07-06T08:32:07.793554Z","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-07-06T08:32:07.798986Z","title":"Sublinear time hypergraph sparsification via cut and edge sampling queries","venue":null,"work_id":"7e8a3c05-464e-4266-98fd-7f6fba563749","year":2021},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:12e19c8e3fa5ebb3af1e98311d8ee6a900e4aec58492792d4d3b5e4e1ab5901d","observation_id":"a30ba41e-4c7c-4796-b69d-2c89ebb74eab","resolution":{"observed_at":"2026-07-06T08:32:07.801134Z","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-07-06T08:32:07.793882Z","title":"Polynomial time optimal query algorithms for finding graphs with arbitrary real weights","venue":null,"work_id":"a2cf7669-6a15-4931-8a91-0d5dd4c2f5ac","year":2013},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:144c30da034d0e8a01077a7da9a876d12ad5ccbdf0baa2c96cc973efe2032672","observation_id":"3fa5fb93-00fc-4d7e-b0de-f7596f8bb208","resolution":{"observed_at":"2026-07-06T08:32:07.795620Z","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-07-06T08:32:07.790997Z","title":"A linear hypergraph extension of tur´an’s theorem.The Electronic Journal of Combinatorics, pages P4–41, 2022","venue":null,"work_id":"c6f23d8b-c1ed-4d98-856e-355d889f6c7a","year":2022},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:041076a6e97b48b43930e20791c54f5eff89543596bf788f6d09ddcdb21a3e4f","observation_id":"2075e303-deb6-477b-9ea3-0618a359460c","resolution":{"observed_at":"2026-07-06T08:32:07.792786Z","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-07-06T08:32:07.769623Z","title":"Vertex and hyperedge connectivity in dynamic graph streams","venue":null,"work_id":"2cca22b9-a280-456f-89c2-485557ab356d","year":2015},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:e1bc21f4818a5b77c72f22b2e08549a2a213e176b4456f447f87a2cabfaa9618","observation_id":"e7a07d1b-470b-4ff9-b1d6-96d503a9a9fb","resolution":{"observed_at":"2026-07-06T08:32:07.771391Z","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-07-06T08:32:07.779219Z","title":"PhD thesis, Mas- sachusetts Institute of Technology, 2008","venue":null,"work_id":"8dcbea3a-f165-4d9d-9256-3706833c9c04","year":2008},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:d8357c29cd6a54f6736b81625d71a47d4a3e6471a334fc11b3cc4affdb340e83","observation_id":"845863e8-8373-47a7-9aa4-5ada4fe94d3b","resolution":{"observed_at":"2026-07-06T08:32:07.781412Z","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-07-06T08:32:07.764724Z","title":"Dirac’s theorem for linear hypergraphs.SIAM Journal on Discrete Mathematics (SIDMA), 39(2):834–847, 2025","venue":null,"work_id":"5e800532-ed66-4d24-9919-53d366b22875","year":2025},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:aaa55b00860429bd886bf599ddc7b8fbfc9bf298ef0ebc07d61233800d3d2724","observation_id":"7e08dcb4-2c0f-47f7-93aa-d9b9ce1b938d","resolution":{"observed_at":"2026-07-06T08:32:07.766206Z","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-07-06T08:32:07.747341Z","title":"Regular subgraphs of linear hypergraphs.Interna- tional Mathematics Research Notices, 2024(17):12366–12381, 2024","venue":null,"work_id":"030d3100-73ac-4826-bd0f-a069bdbb3eda","year":2024},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:cabe035460582e3c4474e7e33418c61f0faacf82f7f7facd5dcddfe60ec65a46","observation_id":"df452838-3d5a-4c00-8dc5-ad43f0f9fbd1","resolution":{"observed_at":"2026-07-06T08:32:07.749062Z","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-07-06T08:32:07.764328Z","title":"Minimizing convex functions with rational minimizers.Journal of the ACM, 70(1):1– 27, 2022","venue":null,"work_id":"94d628be-0fb8-4a3a-84eb-5270f3482b19","year":2022},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:d67426a1c5b0915f764a2e28766e9e3356c8c158f3c69e7f00bdb7be7a0808b1","observation_id":"998742bc-d539-4294-b2a0-53f90d382850","resolution":{"observed_at":"2026-07-06T08:32:07.765860Z","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-07-06T08:32:07.761980Z","title":"Minimum cuts with fewer cut queries","venue":null,"work_id":"9dd14e19-da7d-4276-bdd3-3ee265c89401","year":2026},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:804866a13a5f54965349c5fc05f13a558a789925516a4efe3c1c2a9a545381f9","observation_id":"d762cfc8-cabd-4379-8de3-fb9bd8bb3e9c","resolution":{"observed_at":"2026-07-06T08:32:07.763373Z","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-07-06T08:32:07.802174Z","title":"Cut Sparsification and Succinct Representation of Sub- modular Hypergraphs","venue":null,"work_id":"0c86bcc5-79ce-41ac-a85b-944be023474d","year":2024},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:c62fbb5b8e44fa1641ba8f229213d626364cc6393bbdead6988fd3b070b5bc7b","observation_id":"fd002661-288e-4758-b186-47fcd859e6ca","resolution":{"observed_at":"2026-07-06T08:32:07.804476Z","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-07-06T08:32:07.772432Z","title":"Cut-Query Algorithms with Few Rounds","venue":null,"work_id":"559f8923-2fde-4be5-97fe-6f94411e75c1","year":2025},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:072c774a73bc3208815338c487426bc67216ed7c551287ca019c3de7e6eb28fd","observation_id":"2e124bcb-b291-4840-a416-15f652cb5390","resolution":{"observed_at":"2026-07-06T08:32:07.773702Z","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-07-06T08:32:07.774277Z","title":"All-pairs minimum cut using cut queries","venue":null,"work_id":"b1d4d141-b252-4d41-bea4-d37cc87503a5","year":2026},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:43ac0e85ebe451bb4ab87f90ccd461fcccf76454039cbc4421c4076824e933b5","observation_id":"9389204d-0dcf-440c-a979-53787056e8eb","resolution":{"observed_at":"2026-07-06T08:32:07.777644Z","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-07-06T08:32:07.783439Z","title":"Faster all-pairs minimum cut: Bypassing exact max-flow","venue":null,"work_id":"b73c3469-cdcf-49c3-86ed-5e854a000ad5","year":2026},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:d16309e8feac81b22b4ed468caf862079a5cd1dfff6df6925d2c353fb938801b","observation_id":"8e222e6f-6eb5-46e8-ac9e-19aafdb7be48","resolution":{"observed_at":"2026-07-06T08:32:07.784988Z","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-07-06T08:32:07.752450Z","title":"Near-optimal size linear sketches for hyper- graph cut sparsifiers","venue":null,"work_id":"b8f66cf8-87aa-492f-815e-6a8813c76f3d","year":2024},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:dd5d502abb54405516b1f27ebcb4517c42cb054ef879c0d6d771bc8d2fee541a","observation_id":"e621e276-f573-44bc-a0ec-b4f1e796ae97","resolution":{"observed_at":"2026-07-06T08:32:07.753974Z","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-07-06T08:32:07.780493Z","title":"Sketching cuts in graphs and hypergraphs","venue":null,"work_id":"97c588bd-95db-464d-af63-3d31b3fa8387","year":2015},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:5371a9aee55cc4ba8a350547108dae5d87b301a5f09cf2a64296d2f14d217c40","observation_id":"aa39e5f3-6741-4c0b-b622-8c6bdf146ee6","resolution":{"observed_at":"2026-07-06T08:32:07.782923Z","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-07-06T08:32:07.697051Z","title":"Quantum algorithms for graph problems with cut queries","venue":null,"work_id":"04f4dceb-f643-415c-8fe2-33f3cc3700d8","year":2021},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:f19cf4404dbc850239e96f09e0f0303bd759d84314c4acf8550e425175a79e6b","observation_id":"2225a0f3-6fa9-408f-8d39-cceb7c198938","resolution":{"observed_at":"2026-07-06T08:32:07.699614Z","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-07-06T08:32:07.701678Z","title":"Deterministic min-cut in poly-logarithmic max-flows","venue":null,"work_id":"6bfb8b4f-329c-4b8d-9c51-f609c621a259","year":2020},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:73ce6f825cee6c0a65ce4edf563ea3b910e3df78838ae46368429a87fee64762","observation_id":"e29ef8ea-9c29-42be-991b-2271ba62d03f","resolution":{"observed_at":"2026-07-06T08:32:07.703575Z","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-07-06T08:32:07.718773Z","title":"Learning spanning forests optimally in weighted undirected graphs with cut queries","venue":null,"work_id":"39e2e8f4-faba-49c1-bfe8-a883fb85f43a","year":2024},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:0b8a5bb9c5355d984a7630122fe8fa1bae58e8ed690c2b2dad2d130070e4ae78","observation_id":"fa90ab0a-fd94-4227-8916-1aa34333f021","resolution":{"observed_at":"2026-07-06T08:32:07.720739Z","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-07-06T08:32:07.766525Z","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms","venue":null,"work_id":"83e76b33-a9a0-4b2a-9c31-4b3b96ff5e8a","year":2020},"citing_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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:ee2234737b2eee7318c8dbad526f687cc6adc81b0c1ab23f8653b5f326cc89aa","observation_id":"4e7fc564-3913-4d34-961e-e7e03f8371cf","resolution":{"observed_at":"2026-07-06T08:32:07.768545Z","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-07-06T08:32:07.743767Z","title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph.Algorithmica, 7(1):583–596, 1992","venue":null,"work_id":"85919dcc-9266-4143-985d-814c6c5a79ce","year":1992},"citing_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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:7badf17f1db846a4d53a7df412ad50ac3c6341e981adbba1d00474dad048de6c","observation_id":"87e165a2-a8e8-47be-96c4-a845f354bb8f","resolution":{"observed_at":"2026-07-06T08:32:07.745960Z","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-07-06T08:32:07.755843Z","title":"Quotient sparsification for submodular functions","venue":null,"work_id":"f438096b-ec59-4589-871d-d8f6c6d506df","year":2024},"citing_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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:464c25c1dc4c123416afdd8381957aeb05545687bf227fd21b2eded40369d457","observation_id":"4bfcbe02-8d4b-4899-8c17-571e6a6af474","resolution":{"observed_at":"2026-07-06T08:32:07.757382Z","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-07-06T08:32:07.745236Z","title":"Minimizing symmetric submodular functions.Mathematical Programming, 82:3–12, 1998","venue":null,"work_id":"6134883e-856d-4844-b4d9-ec412730279a","year":1998},"citing_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},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:dbbe9d3d7b9641c4466621c3bbff5ccb31f15fda02c3157f4ba09cd54926526f","observation_id":"1b77234a-bf4a-4fc4-b4da-b95022ed63b7","resolution":{"observed_at":"2026-07-06T08:32:07.748116Z","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-07-06T08:32:07.794946Z","title":"Matthew Weinberg","venue":null,"work_id":"1d976fad-4d5f-44b9-9360-ee5419176128","year":2018},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:ade6858c0181457cf69714a0b16fac19bd47132a3df8d8ccf71b374b786e50e3","observation_id":"4c230e68-6de8-4589-84cf-e29d4aa3ca3a","resolution":{"observed_at":"2026-07-06T08:32:07.796809Z","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":"2607.01216","last_updated":"2026-07-01T17:54:03Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":33},"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 1 inbound Pith citation observation for arXiv:2607.01216."}