Pith. sign in

Paper Citation Record · LEDGER

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks

As of 21 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2508.18375.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.18375 v1

Coverage vector

measured 52 of 52 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T16:40:22.958359Z

measured 52 of 52 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

52 of 52 outbound references displayed

  • verified exact6
  • verified fuzzy38
  • unresolved8
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c353d571-1e87-4829-b310-3184b0267c34 · outbound

This paper cites A One-Way Quantum Computer.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks A One-Way Quantum Computer

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.721709Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.804754Z digest=sha256:34f9775656987381f609d3064a908e7263d325e036f66dc014a259e8fe19e73e

Observation 5fd5369b-d5ca-49f1-ab82-03e96e35f2a5 · outbound

This paper cites Generating Entanglement with Linear Optics.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Generating Entanglement with Linear Optics

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.714239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.807917Z digest=sha256:881b6d8cf12a8781bb753a547dfb7dbfe8cb40249185e392fdc364f9994dfda8

Observation e3ce09ed-061a-49e7-9b5c-75a29aef8dce · outbound

This paper cites Resource-efficient linear optical quantum com- putation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Resource-efficient linear optical quantum com- putation

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.706660Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.810574Z digest=sha256:56a58310ae3543f567bb729bbf250f7977ae5852d2c00384486edef96f770f45

Observation a513fdb1-917a-4232-b6e5-efb6bfc380b1 · outbound

This paper cites Fusion-based quantum computation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Fusion-based quantum computation

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.698682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.813707Z digest=sha256:5ade6d432ed1907d543c1e1efb3de2719fe4381f3f767a7113bc51a9c0e142c0

Observation c681794f-1d4c-4020-bd9f-1c5edf989ffd · outbound

This paper cites Fault tolerant quantum computation with nondeterministic gates.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Fault tolerant quantum computation with nondeterministic gates

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.617432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.816442Z digest=sha256:0b77850074b3d5287af828ce6587e63a2e3a1a8db6bcda52d5258eecab2c7f6a

Observation ca3c6e6e-ed5b-47bb-8c61-9f5de2218074 · outbound

This paper cites All- photonic architecture for scalable quantum com- puting with greenberger-horne-zeilinger states.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks All- photonic architecture for scalable quantum com- puting with greenberger-horne-zeilinger states

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.609922Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.819150Z digest=sha256:5ceef12c58488fcefe77cb0026d0f48dd3f2160ddea6b11dfcd503a3cda366f2

Observation 52d7c093-7bf9-41ca-adbb-d09de5b5bcf7 · outbound

This paper cites Extracting GHZ states from linear cluster states.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Extracting GHZ states from linear cluster states

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.602033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.822005Z digest=sha256:0f6ee3f4735f8c75b3fa27b1809a6be7c3ec5888c51ecd7a1ef76d090a7f0e4b

Observation 0c0c5528-f6eb-4efd-a8b1-a3544ccc57cd · outbound

This paper cites Observation of entanglement be- tween a single trapped atom and a single pho- ton.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Observation of entanglement be- tween a single trapped atom and a single pho- ton

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.593465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.824721Z digest=sha256:6ad23cb5c3c307c798ca322ba5f87aec55e6f92f69855ab9d87a3a7a8423348b

Observation 788577f8-675a-426d-aae5-aecd4bf1d510 · outbound

This paper cites High-rate entanglement between a semiconduc- tor spin and indistinguishable photons.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks High-rate entanglement between a semiconduc- tor spin and indistinguishable photons

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.577541Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.831233Z digest=sha256:48c644685f3af1564e139b5b1aa70cf6ef80e5779181df9107e7a88d4ed2c343

Observation 81d86dbc-9fe8-48df-8d28-3f064e36a21d · outbound

This paper cites Creation of Entangled Photonic States Using Linear Optics.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Creation of Entangled Photonic States Using Linear Optics

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.834036Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.834036Z digest=sha256:752053addb272b07aeee02fdbfc6adc260ef75e267520656fb3e28adfddcac05

Observation 1b30599e-955a-4cb1-b859-e4dc0c1015a3 · outbound

This paper cites Repeat-Until-Success Linear Optics Dis- tributed Quantum Computing.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Repeat-Until-Success Linear Optics Dis- tributed Quantum Computing

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.569125Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.840180Z digest=sha256:988576d3f8863750fd026a13257b068c04afcc3ece69ef2a2d0dc6b998272010

Observation 7e612210-6846-4c9e-8d61-82164b792527 · outbound

This paper cites A Spin-Optical Quantum Computing Architecture.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks A Spin-Optical Quantum Computing Architecture

Reference 14

Resolution
verified exact
local_arxiv, observed 2026-08-05T16:40:23.320453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.842645Z digest=sha256:87871963f8d525bedd9925e0d61ae23ae7d869fd40251a96976ce12e39da6003

Observation 3231d9e4-727c-4acb-8943-2c354105f2fe · outbound

This paper cites Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum-information processing.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum-information processing

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.561257Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.845586Z digest=sha256:03e1e72c9a8429cfc7d4cf3fa5508c7f4535bcb5ed9371f10357013bc33595f3

Observation d7c42f43-2cda-4d60-82c8-725e097435a0 · outbound

This paper cites Enhanced Fault-tolerance in Photonic Quantum Comput- ing: Floquet Code Outperforms Surface Code in Tailored Architecture.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Enhanced Fault-tolerance in Photonic Quantum Comput- ing: Floquet Code Outperforms Surface Code in Tailored Architecture

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.848099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.848099Z digest=sha256:e9295e9c1dc748d31bee49cda5ca7c4d53f8a6ac2bf4c90050b8c45433ed73ca

Observation 885943a4-5af3-451a-a58c-0daa54e25a3e · outbound

This paper cites Fusion and flow: formal protocols to reliably build photonic graph states.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Fusion and flow: formal protocols to reliably build photonic graph states

Reference 17

Resolution
verified exact
local_arxiv, observed 2026-08-05T16:40:23.251047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.850781Z digest=sha256:116331cf91fe1ef24d564d363d51424e3504dd8c58658f7d6cc15b875904eeed

Observation 9221dda5-487e-458a-83b7-34a9f90e090d · outbound

This paper cites Rewrit- ing Measurement-Based Quantum Computations with Generalised Flow.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Rewrit- ing Measurement-Based Quantum Computations with Generalised Flow

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.553343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.853443Z digest=sha256:d3ee34d9adac7d464cdf24652ce69a05073c7ef8895740d849009552c9223a51

Observation 53c1d2b4-a1d1-4239-a0fc-8fe2f8b03389 · outbound

This paper cites Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.856068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.856068Z digest=sha256:d1ee05742c20bf9b85212e075c4be586a7959b47d439f1c69df44fc81c95ed6b

Observation 329e947c-5098-4558-b956-b2369ec6ea3e · outbound

This paper cites Generalized flow and determinism in measurement-based quan- tum computation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Generalized flow and determinism in measurement-based quan- tum computation

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.545749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.859104Z digest=sha256:7a16f16459aad9514766ad239cfca47a6e73bfe56d84017b1a74045a6473e33d

Observation f6828ac5-53b6-4d40-bf90-2ab1d99259c4 · outbound

This paper cites There and back again: A circuit ex- traction tale.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks There and back again: A circuit ex- traction tale

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.537995Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.861624Z digest=sha256:c05149e356e46913310c85bbec43a8837c3e1ae420647ab136fedd089e347a44

Observation 2c7cecf0-1578-4558-a2ae-e35c54562fa0 · outbound

This paper cites Complete flow-preserving rewrite rules for mbqc patterns with pauli measurements.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Complete flow-preserving rewrite rules for mbqc patterns with pauli measurements

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.529842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.864399Z digest=sha256:490c5b5c979a56c9afb937a8bbd9115ebf3402cfb42af50c314ca6eefe3cb9ea

Observation 62a4f625-4917-4566-92c0-0dfa84ebe9ee · outbound

This paper cites Graph- theoretical optimization of fusion-based graph state generation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Graph- theoretical optimization of fusion-based graph state generation

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.522293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.867600Z digest=sha256:d46a6a4751c4f32e2b0b917dfe140e0e829b23039bc95f65270793a7671b5b13

Observation e37f2856-26b3-4f07-a10a-5c95695bf49a · outbound

This paper cites QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.870096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.870096Z digest=sha256:a430b8d852c82aa2a7a3488e9966f0eb030679649ecd2fab7bdeb2a2bdbbebf0

Observation faf649c7-2625-47d6-8b52-4843178f75c9 · outbound

This paper cites Minimizing resource overhead in 18 fusion-based quantum computation us- ing hybrid spin-photon devices.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Minimizing resource overhead in 18 fusion-based quantum computation us- ing hybrid spin-photon devices

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.872919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.872919Z digest=sha256:836d11d6afcd97f30ddd887f47d8cb6a1379b7e96519141e678592ceeb457894

Observation cea6d890-7249-442b-8441-315694968359 · outbound

This paper cites A compiler for universal pho- tonic quantum computers.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks A compiler for universal pho- tonic quantum computers

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.514443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.875781Z digest=sha256:420ffff604c5edf0c106a91a94aa8f61e1c76ae534d3fdf099559585ac4419e1

Observation 54e9254b-ce4a-438a-bf60-5a52316b471b · outbound

This paper cites Repeat-until-success linear optics dis- tributed quantum computing.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Repeat-until-success linear optics dis- tributed quantum computing

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.506782Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.878518Z digest=sha256:08d42013baeefb735e72fd47d31b5afec317b119bc3e10fdac0ab404910b22d1

Observation f5902e7c-edf3-4f1a-9e3f-ed4b01b4754f · outbound

This paper cites Experimental generation of an eight- photon greenberger–horne–zeilinger state.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Experimental generation of an eight- photon greenberger–horne–zeilinger state

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.498631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.881416Z digest=sha256:58eacd78fbdf7a5432c23fbf45dd3402c902d829f2a6b428641d4bf72b075c4d

Observation dbed0cc8-4fdb-4d83-be49-dddf9bd78339 · outbound

This paper cites Deterministic and re- configurable graph state generation with a single solid-state quantum emitter.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Deterministic and re- configurable graph state generation with a single solid-state quantum emitter

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.490467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.884320Z digest=sha256:c918fe8a834e02eefe9782ed16058a01d0d3a7d3c4ad861056d21801c0e1ce8f

Observation b82c3189-d84b-404f-aa5d-2f39258390f9 · outbound

This paper cites Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter

Reference 31

Resolution
verified exact
local_arxiv, observed 2026-08-05T16:40:23.160862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.889605Z digest=sha256:7d593b1409ba6a90218e1f4e52c6fe4cc5094758b615fe54de4dac32ecab5bda

Observation 40781edc-3f09-47f8-aef0-24d379a6740a · outbound

This paper cites Reducibility among combi- natorial problems.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Reducibility among combi- natorial problems

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.482646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.892455Z digest=sha256:c15cabb19c1ab10e7d18131004b95df38a7ec8166dd94298f560f9148a48d84b

Observation 421f1557-5328-48ff-933c-1b4748ba0aef · outbound

This paper cites List of graphs for which the hamilto- nian path problem is in p.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks List of graphs for which the hamilto- nian path problem is in p

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.474839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.895291Z digest=sha256:6363717b7d31a73be34673817310d24177f7944e275f0dbcc88feb7c4f797ee0

Observation cfdb7811-e193-495e-ad90-55440c1144d2 · outbound

This paper cites Approximation algorithms for cover- ing a graph by vertex-disjoint paths of max- imum total weight.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Approximation algorithms for cover- ing a graph by vertex-disjoint paths of max- imum total weight

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.466092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.898068Z digest=sha256:5cdd19d6880ef0d22cfaa08b286a817d1d2c3f42e0178d3f9fbfa3eac79b5f78

Observation 8ec1c85f-bea7-4e03-81bf-fbc2fd8e3e1a · outbound

This paper cites Path cover problems with length cost.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Path cover problems with length cost

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.457574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.900858Z digest=sha256:076081939a3317a3413f67fcd4cfaa2b0ec90b1600f6b79ad271251bf87771ff

Observation 63b1b8fc-612c-4ae2-8ffd-2fb61d077ef2 · outbound

This paper cites Graph theory 1736-1936.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Graph theory 1736-1936

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.449192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.903655Z digest=sha256:bf7dd000c8126ca2ed5c98d50bc96ebd27552c3410ce25790ec2f0ad323fc0fd

Observation 94804662-1f63-4060-8027-31535d6410e1 · outbound

This paper cites Graphs and their uses.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Graphs and their uses

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.441182Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.906427Z digest=sha256:0d04de4820f8ffd7817c89d2c64056e329ea5cf0ff98b5434c185511b629478a

Observation 8d4d2541-2f7e-44c7-b4c9-65438b5d2255 · outbound

This paper cites Eulerian graphs and re- lated topics: Part 1, volume 2.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Eulerian graphs and re- lated topics: Part 1, volume 2

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.433363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.909078Z digest=sha256:5c6a33dc1aa4064e34483311fec84a078e98a8d140ba8e1b9482a968e7539963

Observation 3b232e38-ec35-424b-acfa-df26a0e4d861 · outbound

This paper cites Graphs with 1-factors.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Graphs with 1-factors

Reference 39

Resolution
verified exact
raw_fallback, observed 2026-08-05T16:40:23.149119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.911759Z digest=sha256:6ea7d5752c7eaed9273420461c5a0457e7b1daf55320b0fe8a5d2015e4491523

Observation e4703bb5-8776-4aa2-a1c0-87bbb53db1bb · outbound

This paper cites An o(v—v— c —e—) algoithm for finding maximum matching in general graphs.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks An o(v—v— c —e—) algoithm for finding maximum matching in general graphs

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.424903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.914525Z digest=sha256:e273377360e791d9482cda3ac39829038aaaa786119857c922f3349d697e0015

Observation 507f2f32-0807-4b99-b989-1ab713f80933 · outbound

This paper cites Approximation algorithms.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Approximation algorithms

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.416934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.917341Z digest=sha256:1e27071ab6d41f54dbb45e1e2f19530af542be06cb5312b3cac8ccd544c3b0ab

Observation 4a74554e-cfbb-4821-8cca-c67d126ba3df · outbound

This paper cites The planar hamiltonian circuit problem is np-complete.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks The planar hamiltonian circuit problem is np-complete

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.920323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.920323Z digest=sha256:864aaaad34e431b15de8cdcfb0b39248a9d0863c0c3d9f72c487ed50c838114f

Observation ccb3a749-7429-43f9-a8d0-fa586b2182e2 · outbound

This paper cites A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

Reference 43

Resolution
verified exact
local_arxiv, observed 2026-08-05T16:40:23.020207Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.922968Z digest=sha256:f9726050f46426e7a25f0425b0b77ace82e544637f6cea755c72a367bd7d5127

Observation 5ecd51bf-7203-4cd1-9376-1cb2444fe8aa · outbound

This paper cites Complexity of graph-state preparation by Clifford circuits.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Complexity of graph-state preparation by Clifford circuits

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.925985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.925985Z digest=sha256:00a476c21a4e483f40589b66ef32e4e090d05f468ec548339f69d194d84c6376

Observation 40df561a-55c6-4b6f-ab94-759e94e19b59 · outbound

This paper cites Rank-width and vertex-minors.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Rank-width and vertex-minors

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.409056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.928614Z digest=sha256:88c6ee40a65378550f88720646456832250b54a12b8d2caccbe74ea527cb3e72

Observation 73110380-5299-4f5b-82d9-5f0ba9dff5c8 · outbound

This paper cites Fusion-based quantum computation.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Fusion-based quantum computation

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.931522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.931522Z digest=sha256:3e9c730ab64c43b646ba2485419aa5f60c7c5a4cf3ab0b5bc36b555cd7870e01

Observation 2953c494-8e7c-475d-89d6-dac0b6ea0a3e · outbound

This paper cites Measurement-based quantum computation on cluster states.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Measurement-based quantum computation on cluster states

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.400706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.934083Z digest=sha256:2087b43e2474a297d0fb9b78992af333b36a4410e5326503123e693142b3e7de

Observation b8a600fd-97aa-4c1a-b355-ab6cee4054cf · outbound

This paper cites All-photonic quantum repeaters.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks All-photonic quantum repeaters

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.392409Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.936728Z digest=sha256:d0b2b0e697e51aed62642b2ccbdb14c06ecd517a4c9656bd1a87f5294baff3ff

Observation 280839db-1109-4af7-be85-2342b841ad35 · outbound

This paper cites Resource costs for fault-tolerant linear optical quantum comput- ing.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Resource costs for fault-tolerant linear optical quantum comput- ing

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.382708Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.939208Z digest=sha256:3a758559c0344f6fa5610689225ff768aeecb74c13c7a31016fa3074f4a8b8b7

Observation 7d614f1a-032f-4e0c-951b-8aa04846ae02 · outbound

This paper cites Loss tolerance in one-way quan- tum computation via counterfactual error correc- tion.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Loss tolerance in one-way quan- tum computation via counterfactual error correc- tion

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.373613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.941904Z digest=sha256:ddb362400be2f441a10e56136d832b550b98cdc92b0d0eafc3f493388156af84

Observation ff4b0b34-81a0-4ced-be3c-66525f871643 · outbound

This paper cites Pyzx: Large scale automated diagrammatic rea- soning.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Pyzx: Large scale automated diagrammatic rea- soning

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.364861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.944962Z digest=sha256:67e771e19ed9b4502c7753ed0653f6160cbf2314b3641fc278f24e85a187f2d5

Observation 0865d6e7-4fd4-4679-8c71-7bfb4c23078e · outbound

This paper cites Sequential generation of linear cluster states from a single photon emitter.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Sequential generation of linear cluster states from a single photon emitter

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.585481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.948245Z digest=sha256:eac7707f8853e5ccae20f31531fa084b29d2ac31f6f173db560e11e0511560a5

Observation 7ce0558e-3375-465b-b292-96e7114b5f77 · outbound

This paper cites Generating graph states with a single quantum emitter and the minimum number of fusions.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Generating graph states with a single quantum emitter and the minimum number of fusions

Reference 53

Resolution
verified exact
local_arxiv, observed 2026-08-05T16:40:22.998486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.950844Z digest=sha256:54de568106f50fd0e76a88afb624f1a5ce539fb28b9dcc2f24aa4381fd01ac89

Observation 3ae0f537-baaa-46fb-83d3-def9c714bd71 · outbound

This paper cites Optimizing Graph Codes for Measurement-Based Loss Tolerance.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Optimizing Graph Codes for Measurement-Based Loss Tolerance

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.356337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.955318Z digest=sha256:06197f80b3835b9ca8c5bb5f41d4dc0f3f48f75e729ddbcbe40166fc02dd2b40

Observation 085f5f9e-86f5-42c8-913d-8e229bf87405 · outbound

This paper cites Loss-tolerant architecture for quantum computing with quantum emitters.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Loss-tolerant architecture for quantum computing with quantum emitters

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T16:40:23.347507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T16:40:22.958359Z digest=sha256:07c7089bf6cc39b334d6658bbbab9cb3ca591f54b3a46986a9621afbada2c764

Pith citing papers

No inbound Pith citation observations are available.