Pith. sign in

Paper Citation Record · LEDGER

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

As of 14 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-14T06:32:32.682623+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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.807917Z digest=sha256:313d035eae0c6784909c2ad1abae29e6ad0a2c7a7b63ff161d0794c346b172c3

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.813707Z digest=sha256:93756a9810f4665a406ce1d8a5d2612621471d1bb2d68c2634b256d0edd2a240

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.822005Z digest=sha256:787db01c40640c1b590dd9b0600faf7ecd76385327577a2b1451b4cc98c9d790

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.824721Z digest=sha256:576721708882118937aa59bcd6c4ea1ec02c32d22b3094007c7c831d149b1db1

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.831233Z digest=sha256:0a97bf45c613f7bb18cfeca1926f455e2383a57751db12e9ed40ba2b624ad5e0

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:11a8bfcaed5ad3f6f1b81bde13134b24ab1f33d22fd94d815ce9e96f414fce31

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.840180Z digest=sha256:5a3f90a6cb4319583a5474af25005b8dd8e8c13a85a5f247319ff0935103cd3e

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.842645Z digest=sha256:4ae48986f95d68ed4b0e889a32e99e76376f18f869880b3e95bd9303cb17e932

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.845586Z digest=sha256:6e2ee58dbfb314424e8e9e3d9c70affb6f40b547f9ec80681cecae856eae0ccb

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:4e76fe1b589605c15b44ac1f17f0bf62ed458aecbdc874882c5433b65898f3eb

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.850781Z digest=sha256:5a353c5bcc6323a312624f40f6348565b1fd630546a5be0d98baaa08ea9f787a

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-14T06:32:32.682623+00:00.

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

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:005c34966fc6223131b2ee5b784ea64c0d2ad7b4b516cae19fd797f7e92cbc39

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.864399Z digest=sha256:411749f923a2bf128e51a6e2c7a21a8f18e12266f3e87528197074a6d107b7c1

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-14T06:32:32.682623+00:00.

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

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:859a74cc3158031642aedb6f989a9931735c06257f2f344a81313c8066e799d8

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:8ce6436085d6a537c04c7067ab7b732f589815d67e66f8b415313e5c7a668ba6

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.881416Z digest=sha256:14dc33b9c4286d7e6ebdef09012cb5242a334d9a2230ac1a74fe6c1f951a6ecd

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.889605Z digest=sha256:75a5d638e7346be5f52275b899e62a0ed2c42568278504ea187088f8d88dc167

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.900858Z digest=sha256:540ab6d766e63506e1ae3f869eba548412290be10ccb23bced147819d0d17042

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.909078Z digest=sha256:665ee1d3d4e66236ed7180d8ce1889f8fce922860e84c385c84f217fdf3b67a7

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.911759Z digest=sha256:2e16d7f5a2f33c3174549fb6cb38ab648b64b70d22143ee8e50cfd914b64622d

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.917341Z digest=sha256:2b2e52740446e004dade3cf165bc6ca49bb8d4f4773063f47f263b325c6058ac

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:616b3ec3bdc93ba613b4fa68d5ce6aae4c1f921a6ee1d4526089fc24fdd8423f

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-14T06:32:32.682623+00:00.

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

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:2ce4572aa81359d41a3885a14402c052873e64772363aa1ebb7ef8060250814b

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.928614Z digest=sha256:983be571cbec59a69a2c64794587c22d1e223a2c7e58a64d8c735253c0c0efd8

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:adbb47ea5d42ac8c7471b6338a81eeb1176032469f965fd5ae06d3c63b77e1e8

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.934083Z digest=sha256:6747e7de82802822dc1b444b0383bf6ec762b6b46a505a24e2b85072083fe6f7

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.939208Z digest=sha256:77594f6b770c5a43be06eb24ddb1e8d069f4cadf9b8cb262e8ce78dd8e316501

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.944962Z digest=sha256:11fc2fda951f61f427f7b1b3662ee34de6b2211d198b788d26c2e72cb0722c70

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

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

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.955318Z digest=sha256:5e2539823da1d907ebb3148238f209c5cbd6a4f26c8a347b787104a16c329956

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-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-05T16:40:22.958359Z digest=sha256:2d086ad4cc05c5b721c27c0143cd7d631de8080d6b7f0350e2e52a30942bf1a9

Pith citing papers

No inbound Pith citation observations are available.