{"as_of":"2026-08-10T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10472d7db9ab36e5509b40f112cd2e77443821f4656b953a5e21993b8e01e8d4","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:40:22.958359Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2508.18375/citation-record","integrity":"/paper/2508.18375/integrity","json":"/paper/2508.18375/citation-record.json","paper":"/paper/2508.18375"},"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-05T16:40:23.719239Z","title":"A One-Way Quantum Computer","venue":null,"work_id":"952468c7-7498-4516-8c3a-98e960bed3fe","year":2001},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.804754Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:68cb28d21a531a41139e36b89b0aa8c47347e04406ca526980fad03ede15c13a","observation_id":"c353d571-1e87-4829-b310-3184b0267c34","resolution":{"observed_at":"2026-08-05T16:40:23.721709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.711737Z","title":"Generating Entanglement with Linear Optics","venue":null,"work_id":"909e1941-f0d0-4c9e-921b-b9b9e839242f","year":2017},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.807917Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:2ce82b9406a354e8adb8535f2e82e66376f84c250c403036f229ee3e6c7e7550","observation_id":"5fd5369b-d5ca-49f1-ab82-03e96e35f2a5","resolution":{"observed_at":"2026-08-05T16:40:23.714239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.703820Z","title":"Resource-efficient linear optical quantum com- putation","venue":null,"work_id":"20be8cc5-2e31-471d-abb5-c71c0c0e9358","year":2005},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.810574Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:b45cc9f2ed6691106e859fb95e75f8e7d950eb976bf5dba28b21e19a66f74352","observation_id":"e3ce09ed-061a-49e7-9b5c-75a29aef8dce","resolution":{"observed_at":"2026-08-05T16:40:23.706660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.695725Z","title":"Fusion-based quantum computation","venue":null,"work_id":"d1bf6978-4f63-43a0-9465-0919255b7ada","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.813707Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:8c2bd4fd70d21ad512f16b54a38cc353fc68242bb274a53ab049739f8d17a89e","observation_id":"a513fdb1-917a-4232-b6e5-efb6bfc380b1","resolution":{"observed_at":"2026-08-05T16:40:23.698682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.614810Z","title":"Fault tolerant quantum computation with nondeterministic gates","venue":null,"work_id":"ec37aa5c-ce08-46f2-9691-4f7b75dd064b","year":2010},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.816442Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:a5707610748c03b73cadb726ab60131867345b0b4afdcc927389f66cbf2c97fa","observation_id":"c681794f-1d4c-4020-bd9f-1c5edf989ffd","resolution":{"observed_at":"2026-08-05T16:40:23.617432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.607081Z","title":"All- photonic architecture for scalable quantum com- puting with greenberger-horne-zeilinger states","venue":null,"work_id":"0d092187-5329-42c8-a7e9-a90f48161bde","year":2022},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.819150Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:178c473f86b79ca4088f95441fe3beb832b8164ecc7d7545ddc2a1fea6910391","observation_id":"ca3c6e6e-ed5b-47bb-8c61-9f5de2218074","resolution":{"observed_at":"2026-08-05T16:40:23.609922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.598750Z","title":"Extracting GHZ states from linear cluster states","venue":null,"work_id":"51db7b66-981b-47ad-9a45-8a0f85d0ecdb","year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.822005Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:524bbd8db5fc13665b4dd0002371330651aa7f939473a455f5d7a1760820e6f7","observation_id":"52d7c093-7bf9-41ca-adbb-d09de5b5bcf7","resolution":{"observed_at":"2026-08-05T16:40:23.602033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.590324Z","title":"Observation of entanglement be- tween a single trapped atom and a single pho- ton","venue":null,"work_id":"3b8837d3-d45d-4d97-ba40-00611808a4b6","year":2004},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.824721Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:772854f6e3140bff89525a4d814cd580c0dfee6e728b74ba5ecfd5ce72268fd5","observation_id":"0c0c5528-f6eb-4efd-a8b1-a3544ccc57cd","resolution":{"observed_at":"2026-08-05T16:40:23.593465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.574702Z","title":"High-rate entanglement between a semiconduc- tor spin and indistinguishable photons","venue":null,"work_id":"62d50c17-f44e-407d-b02d-e0031b0f0a6b","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.831233Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:55c04b9e538071c68cc2b219835b6460643b8273cc2c364a8d19ba0e38839ecd","observation_id":"788577f8-675a-426d-aae5-aecd4bf1d510","resolution":{"observed_at":"2026-08-05T16:40:23.577541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13825","last_updated":"2021-06-25T18:02:42Z","snapshot_observed_at":"2026-07-06T11:23:16.094906Z","submitted_at":"2021-06-25T18:02:42Z","title":"Creation of Entangled Photonic States Using Linear Optics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13825","snapshot_observed_at":"2026-08-05T16:40:22.834036Z","title":"Creation of Entangled Photonic States Using Linear Op- tics","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.834036Z"},"links":{"cited_paper":"/paper/2106.13825","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:4f005a8179729c3da472adfb082ca2d1594994966c7aa4d6245c71d39d983998","observation_id":"81d86dbc-9fe8-48df-8d28-3f064e36a21d","resolution":{"observed_at":"2026-08-05T16:40:22.834036Z","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-05T16:40:23.566306Z","title":"Repeat-Until-Success Linear Optics Dis- tributed Quantum Computing","venue":null,"work_id":"e9bc186e-1c7c-4f05-9604-fd8af619c193","year":2005},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.840180Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:944cd9ba76d726be5ce35efdc3eb4c5aaa0533510098a3d26326d874f6b02e9a","observation_id":"1b30599e-955a-4cb1-b859-e4dc0c1015a3","resolution":{"observed_at":"2026-08-05T16:40:23.569125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05605","last_updated":"2024-07-17T14:29:52Z","snapshot_observed_at":"2026-07-06T16:45:24.070954Z","submitted_at":"2023-11-09T18:59:05Z","title":"A Spin-Optical Quantum Computing Architecture","version":5},"cited_work":{"arxiv_id":"2311.05605","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.05605","snapshot_observed_at":"2026-08-05T16:40:23.317543Z","title":"A Spin-Optical Quantum Computing Architecture","venue":"quant-ph","work_id":"ea877d3b-5134-4c2d-b2ba-088062f3ab7d","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.842645Z"},"links":{"cited_paper":"/paper/2311.05605","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:9560012baa24ee3c7173d35e7f3e1cf074a7b0d52551a00f2c14d9f58bf10966","observation_id":"7e612210-6846-4c9e-8d61-82164b792527","resolution":{"observed_at":"2026-08-05T16:40:23.320453Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.558492Z","title":"Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum-information processing","venue":null,"work_id":"84c09a7e-722d-4367-84a9-0e5cea6c82b3","year":2015},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.845586Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:b828effce59028b988ea226cff0caa1ae80465a25269c33e72cc800b16d377db","observation_id":"3231d9e4-727c-4acb-8943-2c354105f2fe","resolution":{"observed_at":"2026-08-05T16:40:23.561257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:22.848099Z","title":"Enhanced Fault-tolerance in Photonic Quantum Comput- ing: Floquet Code Outperforms Surface Code in Tailored Architecture","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.848099Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:4e76fe1b589605c15b44ac1f17f0bf62ed458aecbdc874882c5433b65898f3eb","observation_id":"d7c42f43-2cda-4d60-82c8-725e097435a0","resolution":{"observed_at":"2026-08-05T16:40:22.848099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13541","last_updated":"2024-09-20T14:33:54Z","snapshot_observed_at":"2026-08-07T15:59:24.405021Z","submitted_at":"2024-09-20T14:33:54Z","title":"Fusion and flow: formal protocols to reliably build photonic graph states","version":1},"cited_work":{"arxiv_id":"2409.13541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.13541","snapshot_observed_at":"2026-08-05T16:40:23.247997Z","title":"Fusion and flow: formal protocols to reliably build photonic graph states","venue":"quant-ph","work_id":"a3488de0-d4db-45fa-9fed-01b63fe7bf54","year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.850781Z"},"links":{"cited_paper":"/paper/2409.13541","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:9c896776aebba183273c27d3a212560efd14ac1237fcec6313b4e99348a027e2","observation_id":"885943a4-5af3-451a-a58c-0daa54e25a3e","resolution":{"observed_at":"2026-08-05T16:40:23.251047Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.550698Z","title":"Rewrit- ing Measurement-Based Quantum Computations with Generalised Flow","venue":null,"work_id":"71c91080-d625-4306-9041-300b8531bd07","year":2010},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.853443Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:08fba90025c169682728fa5ffd58edc10c57ade1a0342a0a6eac0b9f760e360d","observation_id":"9221dda5-487e-458a-83b7-34a9f90e090d","resolution":{"observed_at":"2026-08-05T16:40:23.553343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03178","last_updated":"2020-05-26T16:13:42Z","snapshot_observed_at":"2026-08-09T14:30:26.293349Z","submitted_at":"2019-02-08T16:37:51Z","title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03178","snapshot_observed_at":"2026-08-05T16:40:22.856068Z","title":"Graph-theoretic Simplification of Quantum Circuits with the ZX- calculus","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.856068Z"},"links":{"cited_paper":"/paper/1902.03178","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:092dadb5fd948739eb88ec5250af540d0b34818c986f4ea3721a34d6009bea25","observation_id":"53c1d2b4-a1d1-4239-a0fc-8fe2f8b03389","resolution":{"observed_at":"2026-08-05T16:40:22.856068Z","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-05T16:40:23.543063Z","title":"Generalized flow and determinism in measurement-based quan- tum computation","venue":null,"work_id":"308b448b-774d-417c-a926-71953b7a92ae","year":2007},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.859104Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:57133557454d83c9b55da46921d07167a1f213309137286b54895849c9a0b109","observation_id":"329e947c-5098-4558-b956-b2369ec6ea3e","resolution":{"observed_at":"2026-08-05T16:40:23.545749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.535065Z","title":"There and back again: A circuit ex- traction tale","venue":null,"work_id":"3a4c57eb-0e05-4006-9ff2-215502a5ba53","year":2021},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.861624Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:b1103fdada89bd713645fd0cc24cd09d17f6a4e4f697b934064133f865ffcc9a","observation_id":"f6828ac5-53b6-4d40-bf90-2ab1d99259c4","resolution":{"observed_at":"2026-08-05T16:40:23.537995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.527206Z","title":"Complete flow-preserving rewrite rules for mbqc patterns with pauli measurements","venue":null,"work_id":"b01d667f-e971-40c7-91a4-19ad055ca8e2","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.864399Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:58930cb4a11c3426b5901a89be9738faae7a07bbc6f840921e939aea97fbdb45","observation_id":"2c7cecf0-1578-4558-a2ae-e35c54562fa0","resolution":{"observed_at":"2026-08-05T16:40:23.529842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.519631Z","title":"Graph- theoretical optimization of fusion-based graph state generation","venue":null,"work_id":"9779d049-23d9-4ba3-9bae-fc23f73bd410","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.867600Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:57bb848f5934c62579a87d0cc49949d4068639ba5d5d22a4a9282f499b9c2467","observation_id":"62a4f625-4917-4566-92c0-0dfa84ebe9ee","resolution":{"observed_at":"2026-08-05T16:40:23.522293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.13018","last_updated":"2022-05-09T16:29:27Z","snapshot_observed_at":"2026-08-07T16:55:28.907676Z","submitted_at":"2020-05-26T20:25:44Z","title":"QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.13018","snapshot_observed_at":"2026-08-05T16:40:22.870096Z","title":"Qasmbench: A low-level qasm benchmark suite for nisq evaluation and simula- tion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.870096Z"},"links":{"cited_paper":"/paper/2005.13018","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:859a74cc3158031642aedb6f989a9931735c06257f2f344a81313c8066e799d8","observation_id":"e37f2856-26b3-4f07-a10a-5c95695bf49a","resolution":{"observed_at":"2026-08-05T16:40:22.870096Z","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-05T16:40:22.872919Z","title":"Minimizing resource overhead in 18 fusion-based quantum computation us- ing hybrid spin-photon devices","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.872919Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:8ce6436085d6a537c04c7067ab7b732f589815d67e66f8b415313e5c7a668ba6","observation_id":"faf649c7-2625-47d6-8b52-4843178f75c9","resolution":{"observed_at":"2026-08-05T16:40:22.872919Z","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-05T16:40:23.511740Z","title":"A compiler for universal pho- tonic quantum computers","venue":null,"work_id":"dee619a9-84d4-4662-aeb3-39436a68cd52","year":2022},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.875781Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:0029dc9e924e424a672ec1552272aed99be592054d60b9a2200d0b3a58c585a3","observation_id":"cea6d890-7249-442b-8441-315694968359","resolution":{"observed_at":"2026-08-05T16:40:23.514443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.504050Z","title":"Repeat-until-success linear optics dis- tributed quantum computing","venue":null,"work_id":"77c046ed-9de5-414a-b287-0aff7711446c","year":2005},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.878518Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:10556953b568264e416260b8501ec4286c3ea63942ebf382352d300953741f20","observation_id":"54e9254b-ce4a-438a-bf60-5a52316b471b","resolution":{"observed_at":"2026-08-05T16:40:23.506782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.495984Z","title":"Experimental generation of an eight- photon greenberger–horne–zeilinger state","venue":null,"work_id":"aedd6bde-9e29-41c8-8840-b089f58585ea","year":2011},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.881416Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:528df692702bc3c213b71a6c3a2f778283dd549e61332ea529d8234e34f41292","observation_id":"f5902e7c-edf3-4f1a-9e3f-ed4b01b4754f","resolution":{"observed_at":"2026-08-05T16:40:23.498631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.487689Z","title":"Deterministic and re- configurable graph state generation with a single solid-state quantum emitter","venue":null,"work_id":"490af6ce-875b-4e96-a60a-e59e82f19a9a","year":2025},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.884320Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:c34564d59647ed039fe90818deb770677dfe80d3a07de714eae0c635059cf2b9","observation_id":"dbed0cc8-4fdb-4d83-be49-dddf9bd78339","resolution":{"observed_at":"2026-08-05T16:40:23.490467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.23518","last_updated":"2025-04-19T15:16:30Z","snapshot_observed_at":"2026-07-06T19:42:34.403090Z","submitted_at":"2024-10-30T23:59:54Z","title":"Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter","version":2},"cited_work":{"arxiv_id":"2410.23518","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.23518","snapshot_observed_at":"2026-08-05T16:40:23.157835Z","title":"Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter","venue":"quant-ph","work_id":"32362ecd-4ba9-4eeb-a838-a8e46f3d3201","year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.889605Z"},"links":{"cited_paper":"/paper/2410.23518","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:d996131756be5e829164f13f9f1608a9f35ee78c00255cab7fdddeff7b71c1b5","observation_id":"b82c3189-d84b-404f-aa5d-2f39258390f9","resolution":{"observed_at":"2026-08-05T16:40:23.160862Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.480035Z","title":"Reducibility among combi- natorial problems","venue":null,"work_id":"d156d77d-dbc4-471e-999d-b2f375ef7852","year":1972},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.892455Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:34a0a2eb7826299b0a82cd468697eb0b69b094e6bfd6083ae4af02af83154983","observation_id":"40781edc-3f09-47f8-aef0-24d379a6740a","resolution":{"observed_at":"2026-08-05T16:40:23.482646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.471116Z","title":"List of graphs for which the hamilto- nian path problem is in p","venue":null,"work_id":"fc0d86cf-3b15-4973-b0c8-700c2c041d0d","year":null},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.895291Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:d4f97748a2b1b8a10793cbb0649873ff5680ffafa4ad3d4064b8fd7e50d54d68","observation_id":"421f1557-5328-48ff-933c-1b4748ba0aef","resolution":{"observed_at":"2026-08-05T16:40:23.474839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.462659Z","title":"Approximation algorithms for cover- ing a graph by vertex-disjoint paths of max- imum total weight","venue":null,"work_id":"0b513970-5c6f-4d46-8bc0-eae40feb946a","year":1990},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.898068Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:8163aa96b4f4312ed417188684f9707894f17fbcb809195f86c310458666bbbc","observation_id":"cfdb7811-e193-495e-ad90-55440c1144d2","resolution":{"observed_at":"2026-08-05T16:40:23.466092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.454443Z","title":"Path cover problems with length cost","venue":null,"work_id":"a412ef0e-dc28-4065-bc42-f9bd8347f817","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.900858Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:c402fd070feb9bb5735f521d06fdfe11a1bc0ec45450ae6b8ad345284a25e6ae","observation_id":"8ec1c85f-bea7-4e03-81bf-fbc2fd8e3e1a","resolution":{"observed_at":"2026-08-05T16:40:23.457574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.446320Z","title":"Graph theory 1736-1936","venue":null,"work_id":"7b8676bb-e6bc-42e8-a780-1a60389381cb","year":1936},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.903655Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:ea6e02dc80d61261d0ba335b91d51a405fb33f972ca3b94553df7a72beab3c8a","observation_id":"63b1b8fc-612c-4ae2-8ffd-2fb61d077ef2","resolution":{"observed_at":"2026-08-05T16:40:23.449192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.438446Z","title":"Graphs and their uses","venue":null,"work_id":"f4a5e7e3-4981-4f11-ba08-f0791ec78949","year":1990},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.906427Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:9bda766a1a51ad5605ddb0d15ef75f7c2568198b2d26cd2d372b13a034bf88a1","observation_id":"94804662-1f63-4060-8027-31535d6410e1","resolution":{"observed_at":"2026-08-05T16:40:23.441182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.430382Z","title":"Eulerian graphs and re- lated topics: Part 1, volume 2","venue":null,"work_id":"bf4f47fc-8c95-4fb1-a8c1-7a1a9858ea0f","year":1991},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.909078Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:7600ae8384812e38e7eb8df6923ecda121578309cb7be8eebb2c884ea6ba5552","observation_id":"8d4d2541-2f7e-44c7-b4c9-65438b5d2255","resolution":{"observed_at":"2026-08-05T16:40:23.433363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/2039666","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:40:23.145056Z","title":"Graphs with 1-factors","venue":null,"work_id":"c6818a45-904d-4fdf-9114-8e24abb43bd5","year":1974},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.911759Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:58b3b5001cae87ae5bf96a4922407a0d780b49985e87482492eb1d9431d7fce5","observation_id":"3b232e38-ec35-424b-acfa-df26a0e4d861","resolution":{"observed_at":"2026-08-05T16:40:23.149119Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.422094Z","title":"An o(v—v— c —e—) algoithm for finding maximum matching in general graphs","venue":null,"work_id":"b1f7f706-6916-4ca4-afb8-8186b0f6763e","year":1980},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.914525Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:e6b696cab24d2f84a92ea49450f8fc65cf6fa53217242218783f0e2707db4b01","observation_id":"e4703bb5-8776-4aa2-a1c0-87bbb53db1bb","resolution":{"observed_at":"2026-08-05T16:40:23.424903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.414315Z","title":"Approximation algorithms","venue":null,"work_id":"58b60042-e3c9-42d7-a6ae-5dba167c7469","year":2001},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.917341Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:867070dbe9a0e8b393343266c30cc10d3758c96f180bbfa30e9c4e40b350b394","observation_id":"507f2f32-0807-4b99-b989-1ab713f80933","resolution":{"observed_at":"2026-08-05T16:40:23.416934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:22.920323Z","title":"The planar hamiltonian circuit problem is np-complete","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.920323Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:616b3ec3bdc93ba613b4fa68d5ce6aae4c1f921a6ee1d4526089fc24fdd8423f","observation_id":"4a74554e-cfbb-4821-8cca-c67d126ba3df","resolution":{"observed_at":"2026-08-05T16:40:22.920323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09285","last_updated":"2018-06-25T04:48:34Z","snapshot_observed_at":"2026-07-06T06:46:32.717122Z","submitted_at":"2018-06-25T04:48:34Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","version":1},"cited_work":{"arxiv_id":"1806.09285","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.09285","snapshot_observed_at":"2026-08-05T16:40:23.017001Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","venue":"cs.DS","work_id":"040d1ab4-f568-42e2-b31b-824b89a3d405","year":2018},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.922968Z"},"links":{"cited_paper":"/paper/1806.09285","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:e4366ab74922b836dc14cd75a15ffa38b92f1e89ab0a5fc6c7f7bde66404c416","observation_id":"ccb3a749-7429-43f9-a8d0-fa586b2182e2","resolution":{"observed_at":"2026-08-05T16:40:23.020207Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-08-05T16:40:22.925985Z","title":"Complexity of graph-state preparation by clifford circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.925985Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:05d383d1d999886c1a503234576612669b2cad50c8c3b8c920bdb50896e6254b","observation_id":"5ecd51bf-7203-4cd1-9376-1cb2444fe8aa","resolution":{"observed_at":"2026-08-05T16:40:22.925985Z","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-05T16:40:23.405998Z","title":"Rank-width and vertex-minors","venue":null,"work_id":"020abc9f-dd9d-493f-8c46-2187a687e656","year":2005},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.928614Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:b42fba8066d9778925207771d1a7a16963cbd4bfb2fb8a7b3a78b4a1d106084d","observation_id":"40df561a-55c6-4b6f-ab94-759e94e19b59","resolution":{"observed_at":"2026-08-05T16:40:23.409056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.09310","last_updated":"2021-01-22T20:00:22Z","snapshot_observed_at":"2026-08-09T20:28:20.719847Z","submitted_at":"2021-01-22T20:00:22Z","title":"Fusion-based quantum computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.09310","snapshot_observed_at":"2026-08-05T16:40:22.931522Z","title":"Fusion-based quantum computation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.931522Z"},"links":{"cited_paper":"/paper/2101.09310","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:adbb47ea5d42ac8c7471b6338a81eeb1176032469f965fd5ae06d3c63b77e1e8","observation_id":"73110380-5299-4f5b-82d9-5f0ba9dff5c8","resolution":{"observed_at":"2026-08-05T16:40:22.931522Z","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-05T16:40:23.398168Z","title":"Measurement-based quantum computation on cluster states","venue":null,"work_id":"6707dfea-256c-49d1-b07c-84582c155ac9","year":2003},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.934083Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:21b125ab7d118d898f42c397d148f40029d9c6254c60ce4b306c1cfb6c2ae655","observation_id":"2953c494-8e7c-475d-89d6-dac0b6ea0a3e","resolution":{"observed_at":"2026-08-05T16:40:23.400706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.389049Z","title":"All-photonic quantum repeaters","venue":null,"work_id":"df793556-8f22-476b-92f3-1cd23f9706a5","year":2015},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.936728Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:60a5ec24d752758515e138b9d17c5aa7ccfc4a08abeb817a9a801188ab40c3a0","observation_id":"b8a600fd-97aa-4c1a-b355-ab6cee4054cf","resolution":{"observed_at":"2026-08-05T16:40:23.392409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.379469Z","title":"Resource costs for fault-tolerant linear optical quantum comput- ing","venue":null,"work_id":"0086bece-a84e-4124-ae63-7977f0057439","year":2015},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.939208Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:ef2e65dd5550b68358f5f4ba5aea6208b685a92621bc952813ae8d02d37c969b","observation_id":"280839db-1109-4af7-be85-2342b841ad35","resolution":{"observed_at":"2026-08-05T16:40:23.382708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.370622Z","title":"Loss tolerance in one-way quan- tum computation via counterfactual error correc- tion","venue":null,"work_id":"c6bd9d34-7a31-479b-86e7-790c0ec1396c","year":2006},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.941904Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:6d0d25d8dc85f720fa4bcb06ced1a8c70929150ef0d8aa306dd01d67385316f1","observation_id":"7d614f1a-032f-4e0c-951b-8aa04846ae02","resolution":{"observed_at":"2026-08-05T16:40:23.373613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.362056Z","title":"Pyzx: Large scale automated diagrammatic rea- soning","venue":null,"work_id":"40967666-c177-4309-a656-258cdecfb8f8","year":2020},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.944962Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:ae1dc91d337f29e7058479a718d8f823e7a4e6f9ecc8650100842b1fde13d179","observation_id":"ff4b0b34-81a0-4ced-be3c-66525f871643","resolution":{"observed_at":"2026-08-05T16:40:23.364861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.582800Z","title":"Sequential generation of linear cluster states from a single photon emitter","venue":null,"work_id":"40c75a86-1168-4814-bdee-d36364154801","year":2020},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.948245Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:6f9546a64ab54a27784f48b724d0090475160ce34fe2549cc2c36ffca8be735c","observation_id":"0865d6e7-4fd4-4679-8c71-7bfb4c23078e","resolution":{"observed_at":"2026-08-05T16:40:23.585481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04587","last_updated":"2025-04-09T11:25:39Z","snapshot_observed_at":"2026-08-02T11:48:15.728015Z","submitted_at":"2024-12-05T20:03:21Z","title":"Generating graph states with a single quantum emitter and the minimum number of fusions","version":3},"cited_work":{"arxiv_id":"2412.04587","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.04587","snapshot_observed_at":"2026-08-05T16:40:22.993439Z","title":"Generating graph states with a single quantum emitter and the minimum number of fusions","venue":"quant-ph","work_id":"628d5ccb-3a7c-478b-958e-c246bcc25211","year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.950844Z"},"links":{"cited_paper":"/paper/2412.04587","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:ec38e567ba373cead364ddacece41f83c4368931341f2a0039c060b082924a7c","observation_id":"7ce0558e-3375-465b-b292-96e7114b5f77","resolution":{"observed_at":"2026-08-05T16:40:22.998486Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.353096Z","title":"Optimizing Graph Codes for Measurement-Based Loss Tolerance","venue":null,"work_id":"19eeaaec-a61d-47df-bb30-b119d0b7485d","year":2023},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.955318Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:f495f514b3da2a61170d62ddeb9a566ae6752f28d4a5f46572352850b3d2aa61","observation_id":"3ae0f537-baaa-46fb-83d3-def9c714bd71","resolution":{"observed_at":"2026-08-05T16:40:23.356337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T16:40:23.344746Z","title":"Loss-tolerant architecture for quantum computing with quantum emitters","venue":null,"work_id":"ec61d367-402e-4a4e-8d93-ee688f55a9a7","year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.958359Z"},"links":{"citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:f00c1912dcff14edc652bd4fdc2c0200404fb294abc914b2e4b973728e6efc77","observation_id":"085f5f9e-86f5-42c8-913d-8e229bf87405","resolution":{"observed_at":"2026-08-05T16:40:23.347507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T17:16:09.954784Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":6,"verified_fuzzy":38},"total_outbound_references":52},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2508.18375."}