{"as_of":"2026-08-18T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c00702912297b622905f483fb6c23c83750bd9085e1cad49a51abdb061c3274c","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:21:05.973698Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-05-08T02:35:39.256508Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T22:41:34.022484Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"cited_work":{"arxiv_id":"2505.01763","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.01763","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"221758b2-1056-4c4c-b643-4074435802d2","year":2025},"citing_paper":{"arxiv_id":"2605.02635","last_updated":"2026-05-04T14:20:25Z","snapshot_observed_at":"2026-08-16T00:12:48.949544Z","submitted_at":"2026-05-04T14:20:25Z","title":"Quantum Hypergraph Partitioning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-08T02:35:39.256508Z"},"links":{"cited_paper":"/paper/2505.01763","citing_paper":"/paper/2605.02635"},"observation_digest":"sha256:f3362eafabda7e9da242f4765883a4d4949c80be87654a5570e1b48856d5937e","observation_id":"f87f5503-3045-4c3a-b832-794965f3073a","resolution":{"observed_at":"2026-05-11T22:41:34.030134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.01763/citation-record","integrity":"/paper/2505.01763/integrity","json":"/paper/2505.01763/citation-record.json","paper":"/paper/2505.01763"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.740508Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.740508Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:85690e89233dfe437fed8c34c79ab3edd427235dc01b1761f71aa848f8808cd2","observation_id":"3dea899d-a057-494d-bed8-5442882ec15b","resolution":{"observed_at":"2026-08-16T04:21:05.740508Z","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-16T04:21:07.301641Z","title":"Sublinear algorithms for hierarchical clustering","venue":null,"work_id":"12d9fb09-3681-49ae-aa4c-3c9f836fba34","year":2022},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.746734Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:ee928b5da340346c40baa93f98030edb7a117d3779eab69db7433fd0800a5da9","observation_id":"ee580df3-fabc-4538-b52a-27d2eb289040","resolution":{"observed_at":"2026-08-16T04:21:07.306004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/100813956","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:06.189977Z","title":"Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication","venue":null,"work_id":"5d5c0e0e-b65f-4cb9-9df0-28d875ce3ec3","year":2013},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.751486Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:d3c89748bd9f4d78baf59a50a761fde101caf0772e0e180a8b0c164c9e890762","observation_id":"8e59c3a1-e103-4bdc-be08-47b16970fa3e","resolution":{"observed_at":"2026-08-16T04:21:06.194653Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.756428Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.756428Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:4d0b4ea24d3f92caa254fae0dff42cbbfc7ef4397953d9cc85446510562d6611","observation_id":"88dd80ec-7e68-469a-8989-6198529a6f26","resolution":{"observed_at":"2026-08-16T04:21:05.756428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.766053Z","title":"and Gribling, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.766053Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:64818ee66029a9f2ed0e85818f76c7fb7665a3f1b9b0201c35634b3a85b7fd68","observation_id":"7b0a0863-fe63-4c4a-9a02-0da5de19c18e","resolution":{"observed_at":"2026-08-16T04:21:05.766053Z","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":"10.4230/lipics.ccc.2021.28","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:06.165908Z","title":"and Lee, T","venue":null,"work_id":"911dc716-82f4-425e-a34b-638cd764318c","year":2021},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.770572Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:f1f9ddfdf60701ccf7955957c0c59f8e0a28938aef4695e5faf6ad4cf0eeef41","observation_id":"10dc5ee8-5546-4449-860f-be7a9b372342","resolution":{"observed_at":"2026-08-16T04:21:06.170406Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.15587","last_updated":"2024-02-05T01:45:51Z","snapshot_observed_at":"2026-08-16T17:45:38.029831Z","submitted_at":"2021-10-29T07:35:46Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.15587","snapshot_observed_at":"2026-08-16T04:21:05.775524Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.775524Z"},"links":{"cited_paper":"/paper/2110.15587","citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:0378f66a9dac5d0102aa8887bd22f16be1fc4a2b0c6ef1f70337f5401336ce71","observation_id":"6c7fa6e1-0b0b-47f9-80a2-4008cd17dd1c","resolution":{"observed_at":"2026-08-16T04:21:05.775524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.780342Z","title":"Hypergraph partitioning for sparse matrix-matrix multiplication","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.780342Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:1db66b78fda4793de8d3fa438b1848ad99ef9bf4ba7ab799dbf0c8b321192cc0","observation_id":"08c61ce9-b1d7-42dd-8156-2a861c5513ea","resolution":{"observed_at":"2026-08-16T04:21:05.780342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.784858Z","title":"New notions and constructions of sparsification for graphs and hypergraphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.784858Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:3d3c7b8c1741d3c0dcaa9065efe034e5383e0aa88d527a40a3464b16a54809b7","observation_id":"309e6ffd-515a-4967-9ffc-d93e9c285891","resolution":{"observed_at":"2026-08-16T04:21:05.784858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.788995Z","title":"A., and Srivastava, N","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.788995Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:3db55f51c78f69e80a27914ef61ca3c8cbaf41b17efa2579971c1deb9a366091","observation_id":"07a6f783-fc10-4cab-9e4d-e92f6501ee02","resolution":{"observed_at":"2026-08-16T04:21:05.788995Z","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-16T04:21:07.287696Z","title":"Adversarial robustness of streaming algorithms through importance sampling","venue":null,"work_id":"b48e03eb-c3ad-4d58-8962-b0a94b2a76e1","year":2021},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.793455Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:586884eb655e237b59a5b7067634096b6ea78154c1ea2698cebf48bae718c9f6","observation_id":"608c5b19-7cf1-4363-887a-25ffc37e12a4","resolution":{"observed_at":"2026-08-16T04:21:07.292287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2023-07-03-1046","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:06.134132Z","title":"Quantum M otif C lustering","venue":null,"work_id":"ba0e5b2f-4250-4953-a06f-f52c8002731b","year":2023},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.797604Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:f0e9b3c4d99bf15ed70815b1005b0dfb009cfaf986e955afc2c1b260610484f7","observation_id":"1c1bcca9-299f-4a45-8881-06edaa99e2ae","resolution":{"observed_at":"2026-08-16T04:21:06.138844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.801642Z","title":"H., Louis, A., Tang, Z","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.801642Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:c08823137062d78c0ce35be09aa276688178c0808bef622fa154bfa80bac334f","observation_id":"a0a89b8c-aeb7-444f-ab92-f68f6f24bb52","resolution":{"observed_at":"2026-08-16T04:21:05.801642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.805758Z","title":"and Xu, C","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.805758Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:1bc53511f7d97c5446663d4930fb89051ca6e37ed330f605af2f5b9d26d77dac","observation_id":"bae3acf9-2975-40d9-8e24-a2a6d5c318b0","resolution":{"observed_at":"2026-08-16T04:21:05.805758Z","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-16T04:21:07.273863Z","title":"P., Peng, R., Gutenberg, M","venue":null,"work_id":"3a895724-3821-493d-a4c7-78b37e8df9d5","year":2022},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.809927Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:29682049793fff66976a5b3132d083d2e42fe4d982865590a9a0f9901f01b470","observation_id":"2a84236e-021e-44b7-a573-e1996df3cee2","resolution":{"observed_at":"2026-08-16T04:21:07.278238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.813376Z","title":"Near-linear size hypergraph cut sparsifiers","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.813376Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:17287d893d801f59395527d120cc1edb2671f4da27eb45c9d431442dcfd74c61","observation_id":"29b82dbf-9303-461b-afa9-dfad1ef09862","resolution":{"observed_at":"2026-08-16T04:21:05.813376Z","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-16T04:21:07.259888Z","title":"B., Kyng, R., Miller, G","venue":null,"work_id":"9de80fb7-484b-4d78-b551-3942cb679473","year":2014},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.817155Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:f26206d02951d18e9b2f8af5d9f127ca50c8c824dd786d3e290faedc98559e0a","observation_id":"e9ddfe35-fa9f-4f12-9e28-49f67f19beb0","resolution":{"observed_at":"2026-08-16T04:21:07.263913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:07.247379Z","title":"B., Kelner, J., Peebles, J., Peng, R., Sidford, A., and Vladu, A","venue":null,"work_id":"4abca903-19d8-4c7b-b56c-3a0f0ebcc2e6","year":2016},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.820708Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:e1573c16aa5efe2706431718947d7d69f1bf12e5b27748109f97df0eb360acff","observation_id":"d8ecba27-2b5a-468c-8364-015b30b34cb0","resolution":{"observed_at":"2026-08-16T04:21:07.251442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:07.234691Z","title":"B., Cousins, B., Lee, Y","venue":null,"work_id":"645cfacf-2110-48b4-b732-963263262b44","year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.824288Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:3e49859fafe7a66b04e505e0964d39292c80c17b035bb3f0dadd7c4a94398ab1","observation_id":"ba1dfc21-2707-420a-8ba1-126a07c468f3","resolution":{"observed_at":"2026-08-16T04:21:07.238694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.827688Z","title":"Quantum random access memory","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.827688Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:348cc415229388cbf11d7e71689fca2c677f7132640d53aca2311d8030d50c99","observation_id":"f39f4cdb-fc84-4120-83cb-204b8fffb405","resolution":{"observed_at":"2026-08-16T04:21:05.827688Z","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":"10.1103/physreva.105.062440","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:06.091912Z","title":"Preparing many copies of a quantum state in the black-box model","venue":null,"work_id":"9458217a-e753-48a6-9317-b0b1acebaa3d","year":2022},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.831176Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:08b00270d43fd466afda10aa4fe89229cd3e74fc9bfe8f1bf0c1e29bef80a22e","observation_id":"15224bd6-940c-40be-96ba-2787da33c043","resolution":{"observed_at":"2026-08-16T04:21:06.097340Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:07.220142Z","title":null,"venue":null,"work_id":"36eb445c-cd61-42b0-b5c5-2a6343985de1","year":2013},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.834783Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:12c4c47ccf6c75b732c450fff2acf08d50786d2dd912c70a900ae0478af6c9bb","observation_id":"2443d5f7-7a27-402f-8253-81239fbd7046","resolution":{"observed_at":"2026-08-16T04:21:07.224521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.843128Z","title":"R., Liu, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.843128Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:8e9720f2b7b031454e19129a4fad81e24e80a2ad6263d4f689fcb41e4a9461d3","observation_id":"8bc3c963-8e25-4586-90ad-7b309a1e5880","resolution":{"observed_at":"2026-08-16T04:21:05.843128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.847195Z","title":"Towards tight bounds for spectral sparsification of hypergraphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.847195Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:28573408aa07ce3011df1931e3c3da2213855285f8984a6c0fec94a5d9a54138","observation_id":"d1c9df21-a611-4680-a4bd-167800b6fc09","resolution":{"observed_at":"2026-08-16T04:21:05.847195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.851282Z","title":"Spectral hypergraph sparsifiers of nearly linear size","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.851282Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:2a44405c0d578a6e3582d39f30452fad488c7a525ec77b534e79783db35126c5","observation_id":"9140361b-2598-4d85-9451-e68ae530fe8e","resolution":{"observed_at":"2026-08-16T04:21:05.851282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.856271Z","title":"Multilevel hypergraph partitioning: applications in vlsi domain","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.856271Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:d750ad1facc955d862e7fd6e4ee85e65fe81a9325566594a0f20b35fe4ed46f1","observation_id":"9be1603b-32ae-48d7-b8da-058c42085ce9","resolution":{"observed_at":"2026-08-16T04:21:05.856271Z","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-16T04:21:07.206666Z","title":"and Wagner, F","venue":null,"work_id":"e45b44b7-c0a0-46af-8d7e-6569c6bd9a5c","year":1996},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.860619Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:e7e736c707b01c59b43a0ce6732995b3425a7ccedc2ace515822bcf5a532945d","observation_id":"e9e8004a-8034-43a2-ae38-7ea4d4f2505a","resolution":{"observed_at":"2026-08-16T04:21:07.210923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.864830Z","title":"and Krauthgamer, R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.864830Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:37c52eca8bc4ddadb07451b8c3c9ab57d4582aabb9e705ee57c62779388b32bb","observation_id":"a9136669-9853-456d-95de-aa8dc051116a","resolution":{"observed_at":"2026-08-16T04:21:05.864830Z","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-16T04:21:07.192726Z","title":"and Sun, H","venue":null,"work_id":"610c7e20-50ee-4ed4-abf6-fe4c65048dd7","year":2020},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.869037Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:1e37568d4b86f8da6b7d134c951b6b31e27ea407eaa7b1c687cff9f5e57f987c","observation_id":"57179a57-7df9-4dc3-82a7-5242fb71dfa7","resolution":{"observed_at":"2026-08-16T04:21:07.197008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.873197Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.873197Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:beb7f62738631d21fde59787c96385c7e049c988539a93e14ba2859a9d446f8c","observation_id":"ec3c4cd5-2226-4280-a00c-9390ebaa388a","resolution":{"observed_at":"2026-08-16T04:21:05.873197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.877528Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.877528Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:a016882e3863c055c931ccc038cce955e7aa3f739c3aa46b7787c8f68e288f51","observation_id":"5f33e8e3-0933-4a27-b0ea-b16c1051b445","resolution":{"observed_at":"2026-08-16T04:21:05.877528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.881637Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.881637Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:e6aa4f1f3fb0cbb0e44bd861eaa077f0d3809b24adc3f34e7f0864b9aac49a58","observation_id":"f8c15001-e8d9-4ca4-9fa9-89a7bd9d3342","resolution":{"observed_at":"2026-08-16T04:21:05.881637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.885873Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.885873Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:f750327e16a511ea449d9ff9fbd6a712164a4cf6bd14a1f09450958313d40641","observation_id":"90de5c12-23d2-47a8-b6e8-6338a14d8a9f","resolution":{"observed_at":"2026-08-16T04:21:05.885873Z","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-16T04:21:07.177793Z","title":"and Milenkovic, O","venue":null,"work_id":"800333ab-6d2a-43a3-9f0d-d13717e779da","year":2017},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.890476Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:9580612107174c2e78ccfc4ddb56fea7d33e232a97c6b9fa91bc45ceefb1cc40","observation_id":"ee8759d7-2281-4bc3-a1dd-30752b4ae00e","resolution":{"observed_at":"2026-08-16T04:21:07.182305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:07.163666Z","title":"Quadratic decomposable submodular function minimization: Theory and practice","venue":null,"work_id":"5eb469a6-e156-4b82-bccd-12f71f1da0ea","year":2020},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.894690Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:d255c289594ae07bb9237443e3124d2391c0ed2732f68bfba7918c980874e7d6","observation_id":"c524f23a-633c-4abc-89f1-835bd7f6fddc","resolution":{"observed_at":"2026-08-16T04:21:07.168090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:07.148353Z","title":"Sublinear quantum algorithms for training linear and kernel-based classifiers","venue":null,"work_id":"fce02864-b1eb-4456-bc41-bc2dbe1d9681","year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.899965Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:5d6e7e832de99f81435429436a02ee4bbd9eb0ab71a63f22cb72e347ed151193","observation_id":"5723c04c-226c-4787-9e37-1b8349cc799a","resolution":{"observed_at":"2026-08-16T04:21:07.153811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14018","last_updated":"2024-08-26T05:06:39Z","snapshot_observed_at":"2026-08-18T04:38:42.988561Z","submitted_at":"2024-08-26T05:06:39Z","title":"Quantum Speedups for Approximating the John Ellipsoid","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14018","snapshot_observed_at":"2026-08-16T04:21:05.904094Z","title":"Quantum speedups for approximating the J ohn ellipsoid, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.904094Z"},"links":{"cited_paper":"/paper/2408.14018","citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:af953a9f852db5ad0842349422f49e85e19533b0f2678399f421d14062b09298","observation_id":"8f4c5499-2082-4e17-91ce-1b7e3f5a29d1","resolution":{"observed_at":"2026-08-16T04:21:05.904094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.908576Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.908576Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:6a88182ddd3479276977a5bca6f8a7a9361ffbd3276f3e5ba5402b1959f53961","observation_id":"086697fd-5d2c-4dfc-9ad3-63bff6a8b9ff","resolution":{"observed_at":"2026-08-16T04:21:05.908576Z","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":"10.1016/s0167-9260(00)00008-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:06.040384Z","title":"and Wong, D","venue":null,"work_id":"31a64e2f-9ace-4a26-96d6-bd942b4d9fd3","year":2000},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.912675Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:ab11946736c090fe7f562047b3561f50cd5dc6da8a4d54e8f42b2b49738e4ae8","observation_id":"30a7c4f4-b646-40ed-8e43-7ab20e996782","resolution":{"observed_at":"2026-08-16T04:21:06.045504Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.917926Z","title":"Nearly Tight Spectral Sparsification of Directed Hypergraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.917926Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:95a07217ae455e23b4195276eb371aef82b7185d44cfb0628d7a5eb3c341967b","observation_id":"fe789717-0533-42cf-aae1-519b79354226","resolution":{"observed_at":"2026-08-16T04:21:05.917926Z","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-16T04:21:07.132729Z","title":"Partitioning well-clustered graphs: Spectral clustering works! In Conference on learning theory, pp.\\ 1423--1455","venue":null,"work_id":"6a01081d-bba2-4a59-b23f-8d3ffe1aed1f","year":2015},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.922079Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:9b1f30b2a3f08b3638b3eb00cbcae004b836b3e636adc28f1d9d7634b2b22db1","observation_id":"03559176-13fe-4fe5-9295-7b69f8020e49","resolution":{"observed_at":"2026-08-16T04:21:07.138026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.925724Z","title":"Quotient sparsification for submodular functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.925724Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:21856a3f41a946cec433d6c66cc7bd65c35f0088b5fd5ee1b71f39592dfe9215","observation_id":"b9b71aaa-44ba-4e41-a396-846a823b01ca","resolution":{"observed_at":"2026-08-16T04:21:05.925724Z","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-16T04:21:07.117018Z","title":"and Komodakis, N","venue":null,"work_id":"fe4eb066-fe94-42d3-9a94-dc5a4b7b5f75","year":2017},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.929466Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:211d8754a65aaac350eca4d2d6f01be179954a8187e0919b03e36bace95c1750","observation_id":"fa7e3d36-cdde-47e2-83a8-db683c9306df","resolution":{"observed_at":"2026-08-16T04:21:07.121775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.933495Z","title":"and Yoshida, Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.933495Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:57a91cd5f8d92c7a962aaaa236660091cf0e2ddbf37403fcdcb4f6560284f377","observation_id":"dcf211e6-e762-4c87-87be-465031354c57","resolution":{"observed_at":"2026-08-16T04:21:05.933495Z","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-16T04:21:07.102102Z","title":"C., and Yoshida, Y","venue":null,"work_id":"da172f8e-5b62-4bb5-9d00-e31f61e9b2fc","year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.938626Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:eaf3b07f5f3c5ac9bca27ef3234c54fbfaf3d9f4a47bdd6664e6547d936a1ffb","observation_id":"09033cc1-fa67-49e3-8a4c-2396548e51cb","resolution":{"observed_at":"2026-08-16T04:21:07.106784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14823","last_updated":"2023-11-24T19:41:28Z","snapshot_observed_at":"2026-08-18T06:12:18.633946Z","submitted_at":"2023-11-24T19:41:28Z","title":"Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14823","snapshot_observed_at":"2026-08-16T04:21:05.942692Z","title":"Revisiting quantum algorithms for linear regressions: Quadratic speedups without data-dependent parameters, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.942692Z"},"links":{"cited_paper":"/paper/2311.14823","citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:13882f3c88e682cc004d4f71944e9473f0d03a8ef76f256bbd28edda64fc4b9d","observation_id":"3f13c990-bfd7-4cc6-a157-9f5fdaa68fc2","resolution":{"observed_at":"2026-08-16T04:21:05.942692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.947621Z","title":null,"venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.947621Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:fb031356a0481e77e70026761a531b7ae3520eec9d850839c3a04b99b8fde8de","observation_id":"2b4b273c-43f2-44ac-9115-cb7e35645980","resolution":{"observed_at":"2026-08-16T04:21:05.947621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:21:05.951862Z","title":"Hypergraph clustering based on pagerank","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.951862Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:81731a7abe75b74bc122ae6ce9a7dacdf5b366ee91998e7bfffe37418c7ce420","observation_id":"7eb6993b-e3b2-43de-8da9-6da6e23ab039","resolution":{"observed_at":"2026-08-16T04:21:05.951862Z","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-16T04:21:07.087270Z","title":"Hypergcn: A new method for training graph convolutional networks on hypergraphs","venue":null,"work_id":"97ce6e1b-3624-4701-b442-fa14c0f7dfb4","year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.956806Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:ffd1902905e4132b8ef4cc64dc95b438baf18904edd0686a85df0538aa93d2c6","observation_id":"bf512366-b802-4fde-93fd-4a730222c995","resolution":{"observed_at":"2026-08-16T04:21:07.092189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.961202Z","title":"Nhp: Neural hypergraph link prediction","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.961202Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:3fc54971a2c096670a91f025fc0b24ecda308081a752c2895a6c6b84a40a0d0d","observation_id":"39937a40-8027-4ba7-b2af-eb5b109e5674","resolution":{"observed_at":"2026-08-16T04:21:05.961202Z","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-16T04:21:07.073754Z","title":"Cheeger inequalities for submodular transformations","venue":null,"work_id":"b49bb448-b076-4921-92d3-d898d7abb9ef","year":2019},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.965241Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:9fd4f2c9bf7f93c370daaa5b74915c59abfc9e9531376ceecee36603a536fce2","observation_id":"6a874900-4f38-44e0-9723-97aacd026423","resolution":{"observed_at":"2026-08-16T04:21:07.077962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T04:21:05.969425Z","title":"G., and Chan, T.-H","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.969425Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:2603c93bd0cc10bb1a405155b344ae816e3eb079c4895cf26fd09274ff219822","observation_id":"5045d0d4-ce7d-4273-88a8-ada3418fc90a","resolution":{"observed_at":"2026-08-16T04:21:05.969425Z","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-16T04:21:07.060057Z","title":"Learning with hypergraphs: Clustering, classification, and embedding","venue":null,"work_id":"f0ef4572-f670-45ee-9865-e48ddaba0d45","year":2006},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.973698Z"},"links":{"citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:65090d1cf29f5e95d3d233f95b21c75a8377ec55430dc29a900bfda1efb8aa1a","observation_id":"b4690d05-5694-4205-9ceb-5976261da126","resolution":{"observed_at":"2026-08-16T04:21:07.064006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":5,"verified_fuzzy":17},"total_outbound_references":53},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2505.01763."}