{"as_of":"2026-08-11T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:091e9c66090e93a9e97384071e874ab928c0c1b93fa86d8ed14025eed5bea66a","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:52:37.193625Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-19T12:06:38.050214Z","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-19T12:07:20.822570Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"cited_work":{"arxiv_id":"2412.14932","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.14932","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is qma1-hard.arXiv preprint arXiv:2412.14932","venue":null,"work_id":"8baaa3ce-c657-4f28-982c-70c082e196da","year":null},"citing_paper":{"arxiv_id":"2506.01432","last_updated":"2026-04-27T09:33:29Z","snapshot_observed_at":"2026-07-06T21:34:53.033109Z","submitted_at":"2025-06-02T08:43:58Z","title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T12:06:38.050214Z"},"links":{"cited_paper":"/paper/2412.14932","citing_paper":"/paper/2506.01432"},"observation_digest":"sha256:e8815b33cad776cf138823c8ee2cd3d05a4fda45ccf86b14d31386d08114a190","observation_id":"9e75a443-2302-433f-b463-bc14636cff64","resolution":{"observed_at":"2026-05-19T12:07:20.824728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.14932/citation-record","integrity":"/paper/2412.14932/integrity","json":"/paper/2412.14932/citation-record.json","paper":"/paper/2412.14932"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:52:37.898991Z","title":"S pecifically, the Laplacian of a signed graph is symmetric and takes values in − 1,0,1, whereas the Laplacian of a directed graph is not symmetric a nd takes values in 0,1","venue":null,"work_id":"9d945749-61a7-4805-893e-f56f0b3c336b","year":null},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:36.999897Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:333d9af3698a20d3fbd18095a8fbae41b55988b549f15aaeaec498498ec5deec","observation_id":"63ad5cd3-456c-4f7e-b490-c99eac337fd5","resolution":{"observed_at":"2026-08-11T11:52:37.904315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.884684Z","title":null,"venue":null,"work_id":"7b58b409-ebb5-4969-8b86-f0a702b9c268","year":1997},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.007226Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:827ba93f41dd49812adb8e88202594851d134473d5989543168ba312f836fa1f","observation_id":"11ee5be7-cb87-4df4-a258-87621419bb47","resolution":{"observed_at":"2026-08-11T11:52:37.889295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.870288Z","title":"Gharibian, Y","venue":null,"work_id":"95805693-dcfe-4ad4-9b70-d64f28f9335a","year":2015},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.012023Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:b303f1d58c00c9cd41543a53d1c5e1de2efc6c0664629a1d1e527053f7bfd31f","observation_id":"9485166c-f729-4717-87df-e560509434a9","resolution":{"observed_at":"2026-08-11T11:52:37.874835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.855539Z","title":"Adamaszek and J","venue":null,"work_id":"6f99e175-fa68-4930-bd05-881f414491bb","year":2016},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.017742Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:2c084f7bf9a596b49c2936aea4ee59a773f0c148329c0ff179e675fa8c2c4bbd","observation_id":"937eaa50-3c37-487a-b815-0480359f7a56","resolution":{"observed_at":"2026-08-11T11:52:37.860073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11793","last_updated":"2022-09-23T18:14:16Z","snapshot_observed_at":"2026-08-04T10:02:59.084769Z","submitted_at":"2022-09-23T18:14:16Z","title":"Clique Homology is QMA1-hard","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11793","snapshot_observed_at":"2026-08-11T11:52:37.022569Z","title":"Crichigno and T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.022569Z"},"links":{"cited_paper":"/paper/2209.11793","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:72cbc990c37219d4fa79876493f468e340ac8aa644ece8bf78d3e6dd626ca9e1","observation_id":"0e6b3295-8a5c-4226-9756-6d27ac2ddf90","resolution":{"observed_at":"2026-08-11T11:52:37.022569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17234","last_updated":"2024-10-06T23:00:19Z","snapshot_observed_at":"2026-07-06T16:54:06.540083Z","submitted_at":"2023-11-28T21:15:30Z","title":"Gapped Clique Homology on weighted graphs is $\\text{QMA}_1$-hard and contained in $\\text{QMA}$","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17234","snapshot_observed_at":"2026-08-11T11:52:37.027917Z","title":"King and T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.027917Z"},"links":{"cited_paper":"/paper/2311.17234","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:c7a664a2d75eaa5b69dfa9783aa87e1f1c8367ea25001696ab2ade6b72033e27","observation_id":"ec6435c9-2ce5-4fb6-8a07-401d77b84988","resolution":{"observed_at":"2026-08-11T11:52:37.027917Z","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-11T11:52:37.841082Z","title":"Zaslavsky, Negative (and positive) circles in signed gra phs: A problem collection, AKCE International Journal of Gr aphs and Combinatorics 15, 31 (2018)","venue":null,"work_id":"63cf4ef4-e5c9-46bf-95fd-0bcf9bb7121f","year":2018},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.033043Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:36084a941c412e1cd234f81e923a7a573333e38a3aa30fa4192ec138a94d0dac","observation_id":"cf6a3271-178b-49bc-a175-0fd8c7626fae","resolution":{"observed_at":"2026-08-11T11:52:37.845874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.825724Z","title":"Figueiredo and Y","venue":null,"work_id":"d264d17d-d7a3-4581-8830-1064a9f74a32","year":2014},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.038107Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:004ab480b679247535a3cee3eb6811942c8aa7fc73b784a613761652de110544","observation_id":"68f1d899-95da-4025-95df-93ed08677118","resolution":{"observed_at":"2026-08-11T11:52:37.831295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.811187Z","title":null,"venue":null,"work_id":"77d8a3e9-eded-4b25-909a-0c1bb5e6e4ac","year":2016},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.042696Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:87b30ba26682c5f39e43a323c05aa547b63b326941708ec658b626984fc895d6","observation_id":"a702d833-d5ae-43d6-bcaa-a1de708d91f9","resolution":{"observed_at":"2026-08-11T11:52:37.815861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.796877Z","title":null,"venue":null,"work_id":"76b15c1b-fa2c-498f-a6e0-d9dba0cd2039","year":2021},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.047098Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:7f21ddcd1734720c62c252d0abae914aa4d224b9b284fe68193b7f57434d064b","observation_id":"62aa6c1b-395c-41aa-8961-deef0c3d55dd","resolution":{"observed_at":"2026-08-11T11:52:37.801584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.782435Z","title":"Vicsek, A","venue":null,"work_id":"6b3815f5-7314-4211-b3c9-d58a946d6247","year":1995},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.051672Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:de70c8b4afa6ad40e11398902af6dc72cd1de253a9de7e9f18b0ce20c3dddae0","observation_id":"6d1e26da-fc24-4910-996a-34a7632d85b1","resolution":{"observed_at":"2026-08-11T11:52:37.787209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.767970Z","title":"Ou-Yang, D.-Q","venue":null,"work_id":"e3ffeca9-9f31-4cbb-bfd5-cec8b04d4fa1","year":2015},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.056440Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:d57794b3f47d145c229ba8ddc516a330aaeec6ebac7862a205395aa8af7d9909","observation_id":"df9fb79f-d0fc-44bf-99e6-7355549e6990","resolution":{"observed_at":"2026-08-11T11:52:37.772782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.753464Z","title":null,"venue":null,"work_id":"5bb8a83a-9dd0-4b91-b685-fa1c23c6c993","year":1987},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.060897Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:7cf1fe8a2a96336a7d3aa37751ed1cdfe7b6f10d0cf194e2ace6dc998dc1e96f","observation_id":"8beebf47-907e-4316-8ad2-d57231db8bd0","resolution":{"observed_at":"2026-08-11T11:52:37.758207Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.738690Z","title":"Camps, L","venue":null,"work_id":"b9597013-9e9b-4fe2-af15-a9adb62fc37d","year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.065274Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:2caccdf9e1bf6475a89d203a11dfc241a04691504c47a43455e8368e0013d22e","observation_id":"fef9bf7d-ed7b-46ae-a536-eaa3c999b881","resolution":{"observed_at":"2026-08-11T11:52:37.743463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.724100Z","title":"Sünderhauf, E","venue":null,"work_id":"5e1f0bf2-65cd-49c6-82fc-c1471fa91180","year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.069781Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:abe9e837c13755c78d6388271395ff3b6bdd449cff56f77465fcbe4d535012df","observation_id":"fbf4179e-18a0-4619-98fb-05f1dce4d0f7","resolution":{"observed_at":"2026-08-11T11:52:37.728766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.709517Z","title":"Barabási and R","venue":null,"work_id":"5aa6f5c4-6ff5-4227-8458-3769c421d1c1","year":1999},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.074568Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:9c66000323c019e781620b8d61c4bb3551c1fff02f37fb56a570c0cd5c337ad9","observation_id":"5c8636e2-da5b-4381-866d-4f344d2bc7b6","resolution":{"observed_at":"2026-08-11T11:52:37.714227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.02861","last_updated":"2019-10-07T15:40:36Z","snapshot_observed_at":"2026-07-06T08:27:27.910216Z","submitted_at":"2019-10-07T15:40:36Z","title":"Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms","version":1},"cited_work":{"arxiv_id":"1910.02861","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.02861","snapshot_observed_at":"2026-08-11T11:52:37.346707Z","title":"Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms","venue":"quant-ph","work_id":"04becc22-300e-41b1-89d8-5fa498366f48","year":2019},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.079027Z"},"links":{"cited_paper":"/paper/1910.02861","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:a7b57477e24b4dd1a178266b517b5567a599e7e3317f4280f02f77e60101d5c9","observation_id":"13415828-9fa7-4583-8865-5bd985005ba1","resolution":{"observed_at":"2026-08-11T11:52:37.355207Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.694989Z","title":"Apers and R","venue":null,"work_id":"616cdf92-b9be-4088-aad5-ca72dd5def79","year":2022},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.083791Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:421c9ce67a21682697816b1131ccbe1204240c0e830a2a4ab4a1b44fe9ff9375","observation_id":"be55d089-86a6-4acb-a5d1-69b1e7cdfe10","resolution":{"observed_at":"2026-08-11T11:52:37.699534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.680904Z","title":null,"venue":null,"work_id":"a7f9b8bc-85c8-4dae-9d54-bbb49fb9730e","year":2010},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.088116Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:c95440fc95490c38f5c87fb60d8246cc135c6db7c44b2647b4c4de9b5b7ae067","observation_id":"340f4dd9-2ed1-4eec-a160-60ebf195a3c6","resolution":{"observed_at":"2026-08-11T11:52:37.685383Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.092842Z","title":"Jost and D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.092842Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:f51253539bed190bf27955bb829c6347db4a187160d16d15e26bea023ce7990f","observation_id":"6728f028-3445-470e-bfdb-8319a0a40260","resolution":{"observed_at":"2026-08-11T11:52:37.092842Z","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-11T11:52:37.666595Z","title":"Goldreich and D","venue":null,"work_id":"65d8590b-db6f-474a-983f-390a330c9c6d","year":1997},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.097541Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:a0eb022bd2dbe2e5c8ee333583fdab408ad898bbf8e31d268705e1fca33e0ad5","observation_id":"2abe2a12-d11e-4005-bdc0-642e26c67969","resolution":{"observed_at":"2026-08-11T11:52:37.671210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.651620Z","title":"Trevisan, Lecture notes on graph partitioning, expander s and spectral methods, Lecture notes (2016), available at https://lucatrevisan.github.io/books/expanders-2016.pdf","venue":null,"work_id":"81774003-7001-43ad-ac19-3156c98e0ab5","year":2016},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.102104Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:e55ca728c03c0d62d89621f60ebb6de31118e649d26abb61d759ff2d5e878137","observation_id":"b602cfff-7ceb-42bd-b60d-ce8b893b3b75","resolution":{"observed_at":"2026-08-11T11:52:37.656694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.636145Z","title":"Cvetković, P","venue":null,"work_id":"77233cf5-242f-4d8b-a1e9-87c5fa83e755","year":2007},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.106500Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:564250a94dfb6c949583d35b1d278403c33831511a55c6056f93c90aad661b57","observation_id":"60722214-98e0-4c33-89ff-25ed4aaeaca2","resolution":{"observed_at":"2026-08-11T11:52:37.641198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.621660Z","title":"Lloyd, S","venue":null,"work_id":"f89858e0-4fe0-49ba-b893-1c31846cda57","year":2016},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.110800Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:3027976e426a97ac41f14193a60a7b6e311645d609a4d220b0560e6eb94f1758","observation_id":"57fed74f-dbcb-4dae-b86a-be808238d2d2","resolution":{"observed_at":"2026-08-11T11:52:37.626112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12887","last_updated":"2026-03-31T20:50:14Z","snapshot_observed_at":"2026-07-06T13:56:26.171420Z","submitted_at":"2022-09-26T17:56:11Z","title":"A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12887","snapshot_observed_at":"2026-08-11T11:52:37.115029Z","title":"McArdle, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.115029Z"},"links":{"cited_paper":"/paper/2209.12887","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:778eb0b78b389208a11582ac2c64708052ae1a79f43226594efe03ac25759053","observation_id":"e6193bb4-cf82-44a9-8a58-20d1b3f3ebd1","resolution":{"observed_at":"2026-08-11T11:52:37.115029Z","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-11T11:52:37.607576Z","title":null,"venue":null,"work_id":"f9ce73be-0521-42d1-8a6e-4d5180e9d76a","year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.119702Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:a52c2115f6ede063f62df420f36e5ae7ea94efd7091243609396ae2a630751cd","observation_id":"e7628f14-bf2e-4d21-ac10-c4c56b91282c","resolution":{"observed_at":"2026-08-11T11:52:37.612139Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.593590Z","title":"Gyurik, C","venue":null,"work_id":"a6604024-12e0-4a86-8998-1018daf2f1bc","year":2022},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.124051Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:30072e7b7f4e882f75a2c7e71c0e0365be3f359c5cfceaff0f401418433bb063","observation_id":"96423283-ec06-4919-94d2-168fedc45b02","resolution":{"observed_at":"2026-08-11T11:52:37.598200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.579097Z","title":"Schmidhuber and S","venue":null,"work_id":"a58901ce-ddb9-4666-a8d3-8ded5d4d3dce","year":2023},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.129026Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:63f9aeb1b5835d63b07f2fae6e4bc351b4fe0502dc18624678d1dbbecdff1a14","observation_id":"0b9c914a-013e-47cc-a8b3-2f19c29cb0c8","resolution":{"observed_at":"2026-08-11T11:52:37.583807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.564559Z","title":"Cade and P","venue":null,"work_id":"3e674ea5-b0b8-4615-89ba-e5874265e765","year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.133580Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:bf4f71886de048a0f8e21efa04bbaf973f8dae4e4076b179169a31714ff84264","observation_id":"c50a3e01-9fd4-4ed9-a41e-b636f11c713e","resolution":{"observed_at":"2026-08-11T11:52:37.569281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-07T08:46:38.056159Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-08-11T11:52:37.138169Z","title":"Gyurik, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.138169Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:298ab4859f14703343eff12923e13ea00541455f77c36764e8a74088350c9cb8","observation_id":"925ce362-8e73-4767-85f5-72bb9b0e4454","resolution":{"observed_at":"2026-08-11T11:52:37.138169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0606140","last_updated":"2007-10-02T17:22:07Z","snapshot_observed_at":"2026-07-07T07:22:56.686152Z","submitted_at":"2006-06-16T19:36:58Z","title":"The Complexity of Stoquastic Local Hamiltonian Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0606140","snapshot_observed_at":"2026-08-11T11:52:37.143099Z","title":"Bravyi, D","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.143099Z"},"links":{"cited_paper":"/paper/quant-ph/0606140","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:d19dfd866b8e985d3c95969f65a83bcbdf5ba71e3352293770ed6fc1787348ac","observation_id":"26f1045b-0476-4a3e-a8b9-20d24be2350d","resolution":{"observed_at":"2026-08-11T11:52:37.143099Z","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-11T11:52:37.550419Z","title":"Bravyi, A","venue":null,"work_id":"9a2cc975-3d6a-44a1-addb-353c89f8227d","year":2006},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.148185Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:f1095266451578d5c053e2cc10ebe67bb808b428ffdf26ad70b0d588a5505856","observation_id":"f9262e31-5098-475f-9000-3ed96dec8fce","resolution":{"observed_at":"2026-08-11T11:52:37.555093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.536066Z","title":"Aharonov and A","venue":null,"work_id":"94174de8-8e06-42d9-a9b2-a41b3f662876","year":2019},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.152726Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:ae34043c32a1d98f94237e52113b635c019e7b31775ec57ca3a071f73a7476fa","observation_id":"19e8009b-ca06-40fc-adf3-5679628947ea","resolution":{"observed_at":"2026-08-11T11:52:37.540789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.521622Z","title":null,"venue":null,"work_id":"f45a0342-cee6-4767-9b30-63b0c1fc951d","year":2014},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.157104Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:8384ad5da24e2c793ce3b9e9d9b208a6d617954fe6b72cf9bbe1113973fac130","observation_id":"203d9e7f-8c88-425e-a6f3-f2a999db8759","resolution":{"observed_at":"2026-08-11T11:52:37.526438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.506495Z","title":null,"venue":null,"work_id":"7424dcf6-bdcd-4797-8514-3e08508e1b49","year":2023},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.161756Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:26ad51f519d0ef43c4cc151cb4f9ee19a8c7d8a6db3682dc131abc22a31f97fd","observation_id":"28a5392f-b125-4529-a04d-74329ce033a6","resolution":{"observed_at":"2026-08-11T11:52:37.510959Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.491864Z","title":"Dittrich and G","venue":null,"work_id":"dbb88d28-eb0d-4dbe-9304-98f742276e23","year":2020},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.166605Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:84169bba609763e1854cbbf33693b7352b9671572c90c021bb962db7c7e77653","observation_id":"78f651aa-8558-456d-91e3-561007e4dcca","resolution":{"observed_at":"2026-08-11T11:52:37.496696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.475980Z","title":"Kunegis, S","venue":null,"work_id":"29e9e35d-f6dd-4bea-bb0e-fc0fbf015c8c","year":2010},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.171068Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:3d13b4801171c0915f3263ada101bfd821acb79c3581a159b538c628da89bf83","observation_id":"f798b90c-df7d-4ef3-980a-b02e09b65083","resolution":{"observed_at":"2026-08-11T11:52:37.481317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.458665Z","title":"Lim, Hodge laplacians on graphs, Siam Review 62, 685 (2020)","venue":null,"work_id":"97bf9eba-21a0-4fb4-a613-f42724be3584","year":2020},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.175719Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:64934e09970bc51f94a6f49d487f9775616a83dd8c2142961391ca6898bd3f0a","observation_id":"1afcb8d7-3ff8-4ebb-8014-bf2d1ef49312","resolution":{"observed_at":"2026-08-11T11:52:37.463570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.443236Z","title":"Friedman, Computing betti numbers via combinatorial lap lacians, in Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing (1996) pp","venue":null,"work_id":"9b2847b4-49e9-4da9-9888-a93ca5a25ff1","year":1996},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.180205Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:23ee2b11e1bf4622797fa59dff6fadf075f1ae9f1a2652a0abbcb9904a994282","observation_id":"bdda34b0-79f3-49b8-8c56-22dec36112ec","resolution":{"observed_at":"2026-08-11T11:52:37.448021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.427674Z","title":"She and Z","venue":null,"work_id":"6f8c91b9-ce22-4151-abf7-58279b4dac16","year":2019},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.184731Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:bb7c69ea3803383c81c40a5d30a6ec37186d2402c2865f0473fbc64aee1547ef","observation_id":"ff7015b4-6fd8-406a-b076-e87bf676ca27","resolution":{"observed_at":"2026-08-11T11:52:37.432784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.411958Z","title":"Adriaens and S","venue":null,"work_id":"4da07327-a915-4ae7-894a-e7177f4efb34","year":2023},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.189237Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:e9c462d33b650847d5cd5143abca3071a5d9818d3dcd1bee32dc428c06432026","observation_id":"f5c60c44-2ee7-4d45-9e8b-7c351cf28483","resolution":{"observed_at":"2026-08-11T11:52:37.416817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:52:37.396681Z","title":"Desai and V","venue":null,"work_id":"343d1736-1cad-4de1-a72e-d202ad773a99","year":1994},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.193625Z"},"links":{"citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:8eb37f1c5d87bb104c53059df6524cfce556e496d099b4fa2b5bf69de6f007b6","observation_id":"50327a29-b4ac-4cbb-a6f5-6cc76f1483f1","resolution":{"observed_at":"2026-08-11T11:52:37.401532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T11:45:19.756430Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":42},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2412.14932."}