{"as_of":"2026-08-12T12:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d6284ee283a297c22a6ddee4ed6dd4246d2a7ee91850dd2e90f4655b33c4f28","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-12T06:34:41.77262+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-11T20:00:11.853373Z","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:989d3b7ac991838d9d4a23f9954944d15ae16aa573adafa82f904130e68fd79d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:b9f1471b98d0fcda875b7d98a257940733f2b0af56a5b4501ffac20f50066776","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:5aee6f242cec48ae82d7df3918c383e4e2acd70a9763a28c32b0ae1773664619","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:b379721a47dfbac27e9a37503761280c39a8bbc5248db42d615f2d96b03c39d4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:fb1056c057f87b3b9b177fc5c8ac90b68b8b19d7224dd633bda97e4a8f645685","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:9bd9261d7e3234a44fd271a4870c5a41b3a2ea3f5558b293f905c65a9ae5686a","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-11T20:00:11.853373Z","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:4321f3cb2e0f7aefbde982ce7ae368b34727b683e1717a89d504d660ac726af5","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-11T20:00:11.853373Z","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:ee8cb18a465b61e5dca4e44da6492b0218f7eb857e539b5fef9c60ee638ad892","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:e53f722377810bd845029c4979dc4ae60eb651c2f4d5499aff984be8a584ffe9","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:1ea66b7175fdba7bb8007ab0be00ba1f363abbaf89c428cd46e00317a1191c67","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:fae55fa15b84487946a988ef571b232c25b18c8c508ca431f3d9fd4810cb8a62","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:bb4c320683d285fb087e0c9f408dc599072c2edda69781829add1e5caccf83b7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:5b77cfb9c596d7191d1cd4b1d773bcdd60c9dacefac9f36688a676427fa203fa","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:fc969ef91eaa49cf29de2ebedde709174ee7a0898f88fb7b1e0d0d4d7b9fbe1c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:64b97931ce7e10fa9a9f08179e47a666c88397c5dd96af08e6ec9b8e604397a9","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:61a45f6f2d409cf81c3e9f75fbd6b58ead74546a034865c4536474b73ed76017","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:71c3cd9a747796344019770ee5036117c065fb18dc405042e90126d619bd08e8","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:8470e2cab951e272f8089f0bdc356ed51607e2fc466bd397a86afb8b4b8aca04","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:d37b22063497dc8ade931cae63ae3716c21e35c970959b5dc08aec6d44dedea6","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:e055e17f3b7812d8552bf2daf7fa4609fa869a0a66098e27ae7f34c4211ccf87","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:eb55af89de7d5a988abaee68e356137dc69759b6d878b8bc50b91ad6232206c3","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-11T20:00:11.853373Z","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:646b2e893c08e191ed221d25e1881416d638f6e78de550a73bb5ee81eaeb038c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:443dd211d2c912421074e6ad4d2e6cfe68a555d9e558123712d5532ce7e90131","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:2c3f83bfdcf5d174217e785f6e55eba309d755d60259519a4e2588be9c7693c7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:3662eaf58f6c0d6e4b64a11091609c207e13703679d6fbc0418ef50197638656","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:42484ba44929b00c559642fbfd2b603285dcca1c83b884684ad3ad6e2256e7d9","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-11T20:00:11.853373Z","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:c3f037f84a2fbb5ae006032b2978b46071e17b7afa4b01aa8d94b186f1cd90c2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:57e6d2e9cc3f4ad16b55c7adfcbec62bfaeb469373029c42840297640cd26be9","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:0947fc656c91651f398f7592ab0e5f5e0f9e3bf97e1594031c7cfbc53c1f17b2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:598ea3d0089055ffc3dfdff3887b7d4e5be45727c5f3ad6a3470b82ccf83a054","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:510b1fd66b749d939b39efd8e7bdcab927b4b86da3d1e974a029720a5348195c","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-11T20:00:11.853373Z","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:74042f5e96aed9b9870e9c2829510e564574c2c8f0202be3f344b4283e1609e8","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-11T20:00:11.853373Z","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:5b04bd5c0b7f74ac821671a15b5876791c65248600470b546ad2a6cd270f2333","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:e354fd47197feb30b84c9659bd86a98ba86385a083d3d8ae870035a2c0b8320a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:87353d1b966249884a4b6c1e0e91463611d5d02ac246ab33a69c27eb86706d5c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:4abc240ef62961c35108f89c99521a015c1e82fc9cf8528ea79df109ea8a0ecb","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:fd7182025e9f611c615bcc61ea5514449f08222380f202f83fc741471a99dd3b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:33afcee7f1d86cdf6044d49dc74a354dd211a541e45ec1997870b1fd9bd57610","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:ec172129601b1b9e48fba774ec9c6fcf20eed84f7761ed4b7ce2eee42437ea33","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:50c3e845830773160d2f8ed94397f91c3adb61f0ae5a39095bf55290150e823b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:8f73a1d6f723889e745af05322614bd112057f81e2c932ba885131f42c36c642","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:791f12c8ca5391bcfa1b77887c016f5784b66d27da8c8ffbea3735288ad79b22","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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:58c68e8aa03cf0d56157168261bde7f9819307dde1346cd5cc0660a333f24057","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T20:00:11.853373Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2412.14932."}