{"as_of":"2026-08-13T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3132b92691885bc5ae61b2e476c0fcfd30afa20c5c7c107429db5882b2a0968f","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:43:40.189702Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.15015/citation-record","integrity":"/paper/2411.15015/integrity","json":"/paper/2411.15015/citation-record.json","paper":"/paper/2411.15015"},"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-12T14:43:41.876196Z","title":"The result- ing state can be measured","venue":null,"work_id":"0dbba224-2c59-433a-9a97-aacfdd3b6153","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.633219Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:b68b609bc6d057b5998993df4b64321a12296da650cbe5d38824cac1547d689e","observation_id":"741420be-2b76-41ea-a00a-11c8917a1988","resolution":{"observed_at":"2026-08-12T14:43:41.881077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.859824Z","title":"F¨ orderprogramm Quanten- technologien – von den Grundlagen zum Markt","venue":null,"work_id":"20cc8377-213e-427c-bb52-4dfadf4f4447","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.656560Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:462e596510a5e0594f2fa3f570a90bddda65db521bc650a968db76f6458ec95a","observation_id":"b5e1d667-7ebe-4598-8957-b8558e030aec","resolution":{"observed_at":"2026-08-12T14:43:41.865720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.843316Z","title":"We can introduce a matrix with d rows and n′ ≡ n − 1 columns, where each element is either 0 or 1","venue":null,"work_id":"afda1125-1662-40d3-818e-ad773b2bcb4a","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.690829Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:f50f85711a3fc774e412302bd42d4deb84cba8f9fc2e789aa575ec03f50b6151","observation_id":"2223afdc-6371-42bb-af76-48b207dc067a","resolution":{"observed_at":"2026-08-12T14:43:41.848875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.828464Z","title":"This is equivalent to counting the number of ways to select 3 elements from sets of size n′","venue":null,"work_id":"6ec50ed0-33e6-4988-924a-67f4a84af3ba","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.716531Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:5c773d0dc0f97f334ed74a91ce7b686411ea749ce27fee7bfe5f27acb7544121","observation_id":"7ed50c22-ba84-4cf4-acc1-13bc0fcfa425","resolution":{"observed_at":"2026-08-12T14:43:41.833318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.811997Z","title":null,"venue":null,"work_id":"71f34d99-5a16-4be8-b51e-c329527041ed","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.767296Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:48ed82955f14e0cf6ffbb354232deef2bc2b2d45a6f0ffa8340468e4844f712a","observation_id":"41246134-15ac-4246-9f98-0ed4b23d500e","resolution":{"observed_at":"2026-08-12T14:43:41.817570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.794387Z","title":"For simple graphs, the standard graph analysis packages can be used to generate random Erd˝ os-R´ enyi graphs [59], which can then be assigned to the nodes","venue":null,"work_id":"212a0df0-eda8-4375-b2b2-39a468c14358","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.818043Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:7013dc8fe80136d82ae7698f38aebbdc3fd6c495efbd2b5ef63454253147a8d7","observation_id":"e52fe79f-ed27-442d-8f57-786f506f8e3b","resolution":{"observed_at":"2026-08-12T14:43:41.799216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.778952Z","title":"This is explained vi- sually in figure 11 for a fraction of a complete graph","venue":null,"work_id":"602b6fbc-4376-4a8c-bdc6-1377ac2a9576","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.868836Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:788b7f6d638d60932309f0495706043c49b18d770a54c193885eb43c3077c256","observation_id":"e23dbc02-f555-4fd5-a3ab-cb9ab8f2a09e","resolution":{"observed_at":"2026-08-12T14:43:41.784338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.761953Z","title":null,"venue":null,"work_id":"4938a9ee-cd56-4ceb-9231-0399d269657a","year":2010},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.911242Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:9c9a6a72582ab85239df8c34d2ed8a09ba6c71b8e5f210238fa28905228603a0","observation_id":"987d7b48-1a43-46cd-8d7c-edbdf2e4e189","resolution":{"observed_at":"2026-08-12T14:43:41.767182Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.744482Z","title":"Coecke, T","venue":null,"work_id":"907b1f6a-8b77-4243-86ec-fe3de2ecd849","year":2016},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.947620Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:d77fd4f649c6eb9868cc8351cd8cf79ba2159e07262304b807fa3f2131afe4f7","observation_id":"aa850e26-7d3e-4881-952a-d13bb8aa7f95","resolution":{"observed_at":"2026-08-12T14:43:41.749492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.728388Z","title":"Schmid, D","venue":null,"work_id":"81bbabfa-0e16-45e0-aada-841f7b676715","year":2020},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:37.982874Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:021e0a255152da19dbf6079289b3d1d3cde4322e684440aed6450bbbedd059a3","observation_id":"4c7fc930-ff89-437b-997b-e66181418f27","resolution":{"observed_at":"2026-08-12T14:43:41.733355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.712645Z","title":"Tilma, S","venue":null,"work_id":"38bddc1a-3a55-45c2-80cb-69f4159bf498","year":2010},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.017367Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:93f1c60db2ccb1519d19c03a60402dba48eb82eb78aea956a9521a09f438adc3","observation_id":"d5359e60-86c7-46b8-8149-e9b504917217","resolution":{"observed_at":"2026-08-12T14:43:41.717706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.696626Z","title":"Catani, Non-classicality as a computational resource , Ph.D","venue":null,"work_id":"c0fedd9c-cba6-4fd6-a24d-d1d097cc6e07","year":2018},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.043386Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:fec0dde49d9d8f775ec70198778313076d4262771523a6ad4192c800098c4ca0","observation_id":"dc7514d1-fa2b-4d2d-9edf-d3546b727f3e","resolution":{"observed_at":"2026-08-12T14:43:41.701784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.678847Z","title":null,"venue":null,"work_id":"013256db-94f3-4b6b-9707-cb6f7c3dddfa","year":2023},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.070408Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:d6789972de02fe146c6a8e9b7512a7dbc6a4f5f6bae59f09b67f5afbb326a77e","observation_id":"0c6c68c9-3741-4627-8a77-276aad731416","resolution":{"observed_at":"2026-08-12T14:43:41.684528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:38.119532Z","title":"Horodecki, P","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.119532Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:f9ff819a38ae2db3ceaeb93a4333e1299401036a693e96536ce804f06153ff81","observation_id":"67483e1a-d8e0-4bab-ab7a-54126c7cd389","resolution":{"observed_at":"2026-08-12T14:43:38.119532Z","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-12T14:43:41.651052Z","title":"Bengtsson and K","venue":null,"work_id":"82ca2fa9-89c8-44d8-9d81-ed2fcc49be27","year":2017},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.176166Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:bf2d723d35483654f473974152220abe04974d13a15c2bf6881642a6c4467822","observation_id":"653ad7bb-3e61-4dd4-b605-da1f0851b8c7","resolution":{"observed_at":"2026-08-12T14:43:41.655556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.637391Z","title":"Schmid, T","venue":null,"work_id":"5cdf1d1f-5e17-437d-9d9f-7b2f68bb01bf","year":2023},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.220966Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:769c41161f4799d9f9eab15b468a347bf04d193a4c65227c3517b20650757fd7","observation_id":"d986de34-5534-4478-84f1-272ab793e0b9","resolution":{"observed_at":"2026-08-12T14:43:41.641613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.623169Z","title":"Scarani, Bell nonlocality (Oxford University Press, 2019)","venue":null,"work_id":"88bd4cdf-b7a7-4945-a8a4-cb98ef523cf1","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.251593Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:f86bb9bfd68eff47ca7fbc2470f0d7ca743cdd6f3853c4e0da42765913312908","observation_id":"6940031c-ad42-4d94-81fd-38b9cbfd2c62","resolution":{"observed_at":"2026-08-12T14:43:41.627629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.609732Z","title":"Wolfe, D","venue":null,"work_id":"451fbab6-62e0-4514-8686-754dcdd72eaf","year":2020},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.306187Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:1edacfc428abdb8198d7061ac4e6b412db0554f0f20f38c672a26e5b32932326","observation_id":"733d9a5d-4745-4543-aff1-cf4c16fb460f","resolution":{"observed_at":"2026-08-12T14:43:41.613850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.595445Z","title":"Rosset, D","venue":null,"work_id":"832fa140-588e-476d-9642-031f7c05f82b","year":2020},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.355565Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:6a0d906a5de53f763513e7c7baf10da0dbefe9ae02a6ae5717e859ce97bb027c","observation_id":"90c70559-8fa9-454d-b0e8-cb2edb9a9de3","resolution":{"observed_at":"2026-08-12T14:43:41.600270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.581854Z","title":"Montanaro, Quantum algorithms: an overview, npj Quantum Information 2, 1 (2016), number: 1 Publisher: Nature Publishing Group","venue":null,"work_id":"93b03d4e-bcbd-41e1-a5c7-bdbb73685fd4","year":2016},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.429027Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:5b1cc8478c792ab53ba57dd51537b390045b83b341f722151bc75e94cb869b88","observation_id":"8a48a884-5656-4020-a6f0-ae35332a0344","resolution":{"observed_at":"2026-08-12T14:43:41.586006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.567847Z","title":null,"venue":null,"work_id":"568c0583-0a47-428d-bef0-bd01d4376b90","year":2009},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.457200Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:78078fbb6128611f0e178e04e61bbae7cb46c4383d4395d8bca5e0653290d1c8","observation_id":"21d92556-e789-4c64-a0dd-9cdda30ff3cd","resolution":{"observed_at":"2026-08-12T14:43:41.572340Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.552554Z","title":"Sipser, Introduction to the Theory of Computation , Vol","venue":null,"work_id":"621c8cab-25da-48b7-9cf2-aa0cbdff288b","year":1996},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.473437Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:d69121a7d651c18f0ea8f57ea3b0cb5ad05141ea992407a34245fc6d75e2a85a","observation_id":"66db4e7f-da2d-4c4b-946c-513537573e8b","resolution":{"observed_at":"2026-08-12T14:43:41.557330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.537383Z","title":"Bernstein and U","venue":null,"work_id":"e23bc698-6a9f-4fd0-b92a-5032f184d3d5","year":1997},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.498765Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:2939bb5be3b143194dc1d553d5f5f0372df69b98486a0c5f420891a08ed630cf","observation_id":"42e6ed19-ee86-4f73-a1a6-e4c92d1c6210","resolution":{"observed_at":"2026-08-12T14:43:41.542219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.522598Z","title":"Ediger, K","venue":null,"work_id":"694dbd66-f8be-473f-8dbb-efedcab08286","year":2010},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.557349Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:d6586ac42af46bf3f99933372b58811c504bf9b965c1892b2cca2fa0b56d0a0d","observation_id":"33cd32da-5b48-4466-a11c-967577b431ce","resolution":{"observed_at":"2026-08-12T14:43:41.527456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.507664Z","title":null,"venue":null,"work_id":"ab5e7de3-79fc-481f-a1bb-fa0d73df03d5","year":2012},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.620013Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:6ddd2f537ec048d85d55af8bb2f74627bbcd8327b94a9f0fd21499d57a43b6a6","observation_id":"f1db810d-f286-42d4-b0f3-cfe644aefa93","resolution":{"observed_at":"2026-08-12T14:43:41.512229Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.492772Z","title":null,"venue":null,"work_id":"f5403333-5672-4232-8986-18731888dfbe","year":2007},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.663299Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:b1d1cccf5f25b1951ebec00ded79fe41e407794f34477395d774dbe78198246a","observation_id":"6dd70e63-b45b-44cf-bdb0-480264c3a10d","resolution":{"observed_at":"2026-08-12T14:43:41.497518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.478882Z","title":null,"venue":null,"work_id":"a5e4cc9d-3ee7-46e0-899a-1ac9dddda922","year":2011},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.720953Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:efe07196736195e1f802271535fee123fb5a3905e6a40431e2b55c4399237652","observation_id":"9dae446b-adf4-4a4c-aa67-05ffac269357","resolution":{"observed_at":"2026-08-12T14:43:41.483289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.00585","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:43:40.571056Z","title":null,"venue":null,"work_id":"0cbc28f7-914b-4355-a4a9-0f5374de6ee9","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.777170Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:19874417fec5326b4aa8c288bfa974fb7c41b6119af79eaf0410789d00818456","observation_id":"a81ba113-fe59-4eaf-901f-db0ee16032c2","resolution":{"observed_at":"2026-08-12T14:43:40.617420Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.464942Z","title":null,"venue":null,"work_id":"3ef63444-057e-4f8e-a21b-6395e8146575","year":2003},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.829919Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:4ce7ea6b4d5add5ad7c73887940db10b7dfe354ea724477512026963a4307257","observation_id":"007c3cc3-c9df-46a1-8e29-2979b9669488","resolution":{"observed_at":"2026-08-12T14:43:41.469310Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.450177Z","title":"Enrico Fermi","venue":null,"work_id":"d83dc127-cdd1-4281-b28d-f9791d4faffe","year":2006},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.864930Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:4b8642d11373a7e6b912e087039144e5969a5ff83446045ef535b99af06ca521","observation_id":"9baf3867-a4ef-4533-b534-1fcea6279834","resolution":{"observed_at":"2026-08-12T14:43:41.454675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.435961Z","title":"Coecke and A","venue":null,"work_id":"d16776f9-9470-49b6-8665-30b4683306c2","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.889030Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:d591ff69dc81bf7a6a35999e832cab945623a7c2be5161426e100e48ce6c80fd","observation_id":"349f016e-8730-4c6c-9189-6527db9a4c99","resolution":{"observed_at":"2026-08-12T14:43:41.440318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.421874Z","title":"de Beaudrap and M","venue":null,"work_id":"7ed33cfb-9363-420b-871f-df75c9683eca","year":2014},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.936077Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:75cb48a08243b1792f4d159a97e84a604d6320771dfdb6b0da1bc40b0c6e962c","observation_id":"30874e39-9730-4bc0-a870-32d055c4e69d","resolution":{"observed_at":"2026-08-12T14:43:41.426263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.407206Z","title":null,"venue":null,"work_id":"2289ebb1-e7ef-4930-a0d8-f8016c7946ae","year":2022},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.954720Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:1012195ea54a1517edcd482d1aead147c678ff263a5ee3bc07f5129ff3d8cd71","observation_id":"0535c604-60d7-4a8d-a6a2-d36c8e277cc3","resolution":{"observed_at":"2026-08-12T14:43:41.411777Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.392113Z","title":"Vesperini and R","venue":null,"work_id":"248037a3-a390-4277-bd0f-19664be31acd","year":2024},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:38.989818Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:9a096639537555292cfacc73070af6fcf00c21a9c8018fe1c570dfcfb6460894","observation_id":"e1bee2c8-cb02-43ba-be55-779b18d11d64","resolution":{"observed_at":"2026-08-12T14:43:41.396758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.376795Z","title":null,"venue":null,"work_id":"20eaa02a-6e11-4451-997c-479d2d6564ae","year":2004},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.027504Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:7c1aa03085609a2ceacda8d3364dd131185f9f8e78943d91be503a6fa05f6cc4","observation_id":"5ebb8a5d-a26b-4f45-9c84-6b7d3f5eb632","resolution":{"observed_at":"2026-08-12T14:43:41.381859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.359540Z","title":null,"venue":null,"work_id":"71b1b0ad-aac5-46b0-a29e-8865f0e27750","year":1995},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.060660Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:5fc1057f8151168d8854a19d012bcb0f392404df1ebbf0a157e66d9a375188de","observation_id":"01c07159-f361-4a5e-8412-6a0d109e0186","resolution":{"observed_at":"2026-08-12T14:43:41.364923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.344366Z","title":null,"venue":null,"work_id":"7efbeead-8d67-4e34-aa26-79d269c0f408","year":2007},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.095749Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:1f55790b463dd6d0abd5f7b13257574132f261e11c15525c88b789effee871ce","observation_id":"dff62a4a-9b62-4a3a-8ea9-29495753d31e","resolution":{"observed_at":"2026-08-12T14:43:41.349053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.329211Z","title":"Erciyes, Distributed Graph Algorithms for Computer Networks (Springer Science & Business Media, 2013)","venue":null,"work_id":"fbdc2307-8d0b-4ccb-88d4-e99d23c29b33","year":2013},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.123702Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:03ff7445395b9d25ed3ae2958e1ca7352ab768ee42d491d84a72c153d29aa38f","observation_id":"cb337863-466d-47a3-b172-376a11f90a1e","resolution":{"observed_at":"2026-08-12T14:43:41.333577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.314067Z","title":"Shiloach and U","venue":null,"work_id":"7732f9ea-af51-4f8c-83fd-c199f12d3ea8","year":1982},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.155957Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:14952a75b21903c67450d1ba007aa81aa7c5f536ea4d11225f7ed970ff42a2c9","observation_id":"ae65e80d-941a-4572-95e8-96aa9efe6e59","resolution":{"observed_at":"2026-08-12T14:43:41.318894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.298417Z","title":"D¨ urr, M","venue":null,"work_id":"ea4ccdcb-12de-4a68-b9c9-03e759bd957e","year":2006},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.211117Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:e3e64b5162132730ffa58b3764b990049fdd74112927ea2b7ecb325e9a231997","observation_id":"9a37c19f-5718-4d0b-b052-e88d5970982b","resolution":{"observed_at":"2026-08-12T14:43:41.303165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.283145Z","title":null,"venue":null,"work_id":"b45f5d55-40d1-46b9-aa52-169df75d5628","year":1996},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.264854Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:4e269e4793d097f7b1285bc7ce5657975e6176907ea7b65f40f0d0f999dac7d5","observation_id":"0c0a2ffa-d9df-4f57-93e9-816e38e87f9a","resolution":{"observed_at":"2026-08-12T14:43:41.287714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.267585Z","title":"Coecke and R","venue":null,"work_id":"147ee98f-7c8b-40c6-a52e-c0a34ca7ad7d","year":2008},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.306328Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:38c6639b87ed5c19b0191e3c2474a18bc12faba6a6569771c7b503f667e1cb2b","observation_id":"d9df3169-c4b9-4a12-a28c-0faa6db8661b","resolution":{"observed_at":"2026-08-12T14:43:41.272368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:39.334338Z","title":"Coecke and A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.334338Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:23c51b8af911e619b22129b2111a0284b059972c69faf267ef48ad03b58d8b5e","observation_id":"6cd81eaf-98fe-4f76-b586-1118cdf243eb","resolution":{"observed_at":"2026-08-12T14:43:39.334338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13966","last_updated":"2020-12-27T15:54:25Z","snapshot_observed_at":"2026-08-10T15:19:13.806606Z","submitted_at":"2020-12-27T15:54:25Z","title":"ZX-calculus for the working quantum computer scientist","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13966","snapshot_observed_at":"2026-08-12T14:43:39.356023Z","title":"van de Wetering, ZX-calculus for the working quantum computer scientist (2020), arXiv:2012.13966 [quant-ph]","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.356023Z"},"links":{"cited_paper":"/paper/2012.13966","citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:5f979a2fe7338a7634a2f8e10fd139dacd60041709c442aa31bf95f57d7d284e","observation_id":"5a743c15-e4cf-425e-b305-a437adfcad8e","resolution":{"observed_at":"2026-08-12T14:43:39.356023Z","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-12T14:43:41.242091Z","title":"Coecke and R","venue":null,"work_id":"1a8e7634-5ac4-4b8e-80d8-16f280b8918f","year":2011},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.378843Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:74e700bad990894b469b39a956b4504aca06a2f71e0ee48470481446b3871d56","observation_id":"24561f8f-b24b-4a45-b61d-231d95f942d2","resolution":{"observed_at":"2026-08-12T14:43:41.246899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.228001Z","title":"Vilmart, A near-minimal axiomatisation of zx-calculus for pure qubit quantum mechanics, in 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2019) pp","venue":null,"work_id":"b084a208-3dc1-4913-82e0-3db65587f96a","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.410794Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:69d8aa9743349bfe142162b7c545306d8a690f4b47ea623b6bc2619efcc6e7e4","observation_id":"01b14539-1ec7-4dfc-8cc3-2c447eec3ac2","resolution":{"observed_at":"2026-08-12T14:43:41.232565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.06898","last_updated":"2023-05-04T11:33:30Z","snapshot_observed_at":"2026-07-06T11:57:35.819061Z","submitted_at":"2021-10-13T17:26:57Z","title":"Representing and Implementing Matrices Using Algebraic ZX-calculus","version":4},"cited_work":{"arxiv_id":"2110.06898","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.06898","snapshot_observed_at":"2026-08-12T14:43:40.397554Z","title":"Representing and Implementing Matrices Using Algebraic ZX-calculus","venue":"quant-ph","work_id":"95c6ccdc-7211-4c9b-b19b-ff091a76cfc9","year":2021},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.425603Z"},"links":{"cited_paper":"/paper/2110.06898","citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:18bd4049a4e836ee0bd8b82750940c50a53f679cd1a02c8d8cfc9dcd442f3d79","observation_id":"281d755b-0548-4fad-b78d-d159ccfa6a47","resolution":{"observed_at":"2026-08-12T14:43:40.421595Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.213074Z","title":"Terashima and M","venue":null,"work_id":"a3040aa9-9d16-47f7-8f1e-a025f4f89b87","year":2005},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.446831Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:4e800b787c5c0eb89adc7139461595a75a3cde65106749f58367ea83ea875749","observation_id":"14c2f817-e090-4a05-9127-a334ccacb617","resolution":{"observed_at":"2026-08-12T14:43:41.217701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.196977Z","title":"Brassard, P","venue":null,"work_id":"9415a6dc-4706-4c5a-8d08-04bdb12e0cf3","year":2002},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.485630Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:1b0bcf03ca359f9a6ef67aec0435a9da4be021e1a5335eeb25a15f42c50812b0","observation_id":"042327d4-0e08-4b83-8e9d-7094403e042a","resolution":{"observed_at":"2026-08-12T14:43:41.201685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.182039Z","title":"Renner, Simplifying information-theoretic arguments by post-selection, in Quantum Cryptography and Com- puting (IOS Press, 2010) pp","venue":null,"work_id":"e618741e-2a15-4459-852c-cd70370890ec","year":2010},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.619448Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:5b77ce52e81b405171c79d1c0a6961070655b68c7f79b21cc23d1a2e78d4a721","observation_id":"54ff8b36-bf0c-488b-a706-6d225410885a","resolution":{"observed_at":"2026-08-12T14:43:41.187058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:39.651899Z","title":"Wright, Automatic post-selection by ancillae ther- malization, Physical Review Research 3, 10.1103/Phys- RevResearch.3.033151 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.651899Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:f282c6866c93eb29b7587237055f22a67abdf5c64640cede967740ac7ade13a4","observation_id":"a5f13323-d47d-4c08-838b-00b041f67328","resolution":{"observed_at":"2026-08-12T14:43:39.651899Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:43:39.688353Z","title":"Poulin, Stabilizer Formalism for Operator Quan- tum Error Correction, Physical Review Letters 95, 10.1103/PhysRevLett.95.230504 (2005)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.688353Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:4dc3c8bdf51a91986e48ea7c6935202325b71bfec3c390149874757188a922c5","observation_id":"2d43fe91-a0a1-4024-bd90-037a03d621a9","resolution":{"observed_at":"2026-08-12T14:43:39.688353Z","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-12T14:43:41.167192Z","title":null,"venue":null,"work_id":"d3c086db-fc22-4b1d-ba72-5276763892fa","year":1998},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.731443Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:7581dd61f3a49e1a1110865dd35e0a4715438686d23dd3bc2bf922382a6ccfa3","observation_id":"a2309f16-ef68-4162-a8fa-9fb3b64d7a3e","resolution":{"observed_at":"2026-08-12T14:43:41.172020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.152101Z","title":null,"venue":null,"work_id":"b5f1eb44-2e17-4670-b081-6154c7b9ab90","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.774947Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:efd6bbc1284380b346064b50b703fd88f6cc064783ec8a6dc96bd9a6cd7a1dae","observation_id":"14f07dfa-084c-430c-95d3-fde45eacc59b","resolution":{"observed_at":"2026-08-12T14:43:41.156740Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.136915Z","title":null,"venue":null,"work_id":"9f1013b6-1a29-4537-ba32-72fea3108c12","year":2021},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.818450Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:7e64901daec06696d10bcbd483d7688ad259cbcf08cdbd6ddf15a6c1b5475177","observation_id":"babcf42d-5ffb-4696-924b-885ddee50ad5","resolution":{"observed_at":"2026-08-12T14:43:41.141481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.120876Z","title":null,"venue":null,"work_id":"bdd6684e-d5c0-44d8-8083-6781f14ba77a","year":2021},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.873951Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:fc538a786694fc98eab8e6971f58d4263ef12ad19759d11eaca26431e3e26487","observation_id":"2c279c29-a14c-45b7-94d0-931d2672a753","resolution":{"observed_at":"2026-08-12T14:43:41.125722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:41.090438Z","title":null,"venue":null,"work_id":"0332d76e-6faa-4435-acce-3901cbb1bf68","year":2021},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.915070Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:e96769cba9506db97ceff42e04847d184b75a5a599ddec77a8e130e547af9d09","observation_id":"3adb14c8-3dab-4ae8-bb68-1f485565df4c","resolution":{"observed_at":"2026-08-12T14:43:41.103970Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.978939Z","title":null,"venue":null,"work_id":"722cf27b-4350-492c-bd64-d2310d1bebe1","year":2009},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:39.968442Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:61e428a8b0e9a74574fc20cc6ebc426cd4b964d796f3c87ed428db757395a4b7","observation_id":"588a8d26-0a50-4126-afa3-aa946953a460","resolution":{"observed_at":"2026-08-12T14:43:41.021169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.897424Z","title":"Kissinger and J","venue":null,"work_id":"df4a3782-5e75-42ce-8f46-9bb8655a87fd","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.009303Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:35474c0e76fde9aafd98e63e1c4a1a249288bbc2677a46dfbf86df71e692a7ec","observation_id":"21244c66-0178-4193-9aa8-af9cafadd176","resolution":{"observed_at":"2026-08-12T14:43:40.928529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.816744Z","title":"Duncan and S","venue":null,"work_id":"1ba38926-a4ee-4145-b648-731e1ec26da1","year":null},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.048577Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:30d006341847b32a517108e285d8f6cad809e4f945453e74794da4f057288c25","observation_id":"95a41d7b-b12d-414c-a815-8af73d586c5d","resolution":{"observed_at":"2026-08-12T14:43:40.843690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.079775Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.079775Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:04aa8dbce01066b3a79be6caf181478cfb3cb8619aee4de2149d426aef9ca3f8","observation_id":"67f13b1e-e743-4257-8717-2a704c116059","resolution":{"observed_at":"2026-08-12T14:43:40.079775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:43:40.103500Z","title":"Bezanson, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.103500Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:32c46ac2f5553b3f2e02f9af3a6224d9c2c72f5e701612fd7e188a00d6dfdda9","observation_id":"51fcdee3-dcc0-4020-9a4f-793512649d44","resolution":{"observed_at":"2026-08-12T14:43:40.103500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.10877","last_updated":"2020-10-08T15:56:31Z","snapshot_observed_at":"2026-07-06T08:46:31.893868Z","submitted_at":"2019-12-23T14:42:37Z","title":"Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design","version":3},"cited_work":{"arxiv_id":"1912.10877","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.10877","snapshot_observed_at":"2026-08-12T14:43:40.300293Z","title":"Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design","venue":"quant-ph","work_id":"649214de-558b-446e-ac9d-d802f18398b7","year":2019},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.121015Z"},"links":{"cited_paper":"/paper/1912.10877","citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:1ae0ebed969e3f36abdeeb4852f311d79570e7681b91aa318e795707fd115fbe","observation_id":"36b05b3d-ab40-49f3-9051-c6a9f4fc8ccf","resolution":{"observed_at":"2026-08-12T14:43:40.346102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.726989Z","title":"Erd˝ os and A","venue":null,"work_id":"db51b792-5f29-411c-af6a-83bddd025680","year":1959},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.153753Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:040b7aa52e9c2389c4f35d528493a0fcad015a0a07795a86f212ec7a45c889b3","observation_id":"57e83d74-4c64-4c16-94c8-18cc3d441dea","resolution":{"observed_at":"2026-08-12T14:43:40.746740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:43:40.661596Z","title":"Mertens, The Easiest Hard Problem: Number Par- titioning, in Computational Complexity and Statistical Physics (Oxford University Press, 2005)","venue":null,"work_id":"579294d0-7f79-41c6-be06-8e91ddbfcb9c","year":2005},"citing_paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T14:43:40.189702Z"},"links":{"citing_paper":"/paper/2411.15015"},"observation_digest":"sha256:b14a09ac3176f14a0cd58f69c78d179b5ad828fa4327114886d09bd6d175b0c0","observation_id":"c99d2ed2-6654-490e-a837-fbf38c45fdb3","resolution":{"observed_at":"2026-08-12T14:43:40.691610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15015","last_updated":"2024-12-04T12:30:42Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T14:34:28.223310Z","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":3,"verified_fuzzy":36},"total_outbound_references":65},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2411.15015."}