Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T18:57:58.895426Z
Paper Citation Record · LEDGER
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
As of 12 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2507.07528.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
35 of 35 outbound references displayed
- verified exact17
- verified fuzzy8
- unresolved8
- parse uncertain0
- malformed identifier0
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 55836221-cf5b-4d41-a5b5-dbe021adb77b · outbound
This paper cites Petri nets, hypergraphs and conflicts (preliminary version).
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Petri nets, hypergraphs and conflicts (preliminary version)
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.986196Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 4bfc2645-0ece-4fe7-b7ba-5df38d23cbae · outbound
This paper cites Linear time analysis of properties of conflict-free and general petri nets.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Linear time analysis of properties of conflict-free and general petri nets
Reference 2
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.188892Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 558d8cbd-39ad-45bb-ba74-3f105df12f8c · outbound
This paper cites Linear time algorithms for liveness and boundedness in conflict-free petri nets.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Linear time algorithms for liveness and boundedness in conflict-free petri nets
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.971966Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 6037162b-1132-4958-8aa3-185a67ef2fcc · outbound
This paper cites On the complexity of strongly connected components in directed hypergraphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs On the complexity of strongly connected components in directed hypergraphs
Reference 4
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.174536Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 3bb1b31f-2c5a-4625-b746-2111a869b279 · outbound
This paper cites Partially dynamic maintenance of minimum weight hyperpaths.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Partially dynamic maintenance of minimum weight hyperpaths
Reference 5
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.159841Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b9303b99-0b66-445e-a47e-c751d7e676e4 · outbound
This paper cites Italiano, Luigi Laura, Umberto Nanni, and Fabiano Sarracco.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Italiano, Luigi Laura, Umberto Nanni, and Fabiano Sarracco
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.957482Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a77eedb5-ed94-42bd-beed-977ef7a1e76c · outbound
This paper cites Directed hypergraphs: Introduction and fundamental algorithms―a survey.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Directed hypergraphs: Introduction and fundamental algorithms―a survey
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.769959Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ab7fa685-f6cd-4ede-ac75-443abe4132de · outbound
This paper cites Generating clause sequences of a cnf formula.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Generating clause sequences of a cnf formula
Reference 8
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.136702Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a840800f-8449-4fc2-b1fc-160057c98fa6 · outbound
This paper cites Output-sensitive complexity of multiobjective combinatorial optimization.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Output-sensitive complexity of multiobjective combinatorial optimization
Reference 9
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.122895Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 0a05cb7f-2afb-4d39-99e2-3c1a0718bb59 · outbound
This paper cites Generating all the minimal separators of a graph.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Generating all the minimal separators of a graph
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.783775Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a9dbe6b0-7c78-439d-a38d-7b7488a3a59b · outbound
This paper cites Optimal listing of cycles and st-paths in undirected graphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Optimal listing of cycles and st-paths in undirected graphs
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.942610Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b995b1a7-34d4-411a-9a57-81bc8fa8f658 · outbound
This paper cites Generating minimal redundant and maximal irredundant subhypergraphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Generating minimal redundant and maximal irredundant subhypergraphs
Reference 12
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.099164Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 0f0f522f-b07a-4a87-a998-061420d4da0d · outbound
This paper cites On the hardness of inclusion-wise minimal separators enumeration.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs On the hardness of inclusion-wise minimal separators enumeration
Reference 13
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-06T18:57:59.848943Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b4697636-7a30-49af-872d-1b4b88b47d4c · outbound
This paper cites On finding hypercycles in chemical reaction networks.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs On finding hypercycles in chemical reaction networks
Reference 14
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.084814Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation e50f09ee-24b5-4825-b85b-dc983de46bc3 · outbound
This paper cites On the enumeration of signatures of XOR-CNF's.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs On the enumeration of signatures of XOR-CNF's
Reference 15
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T18:57:59.070565Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 22cfa12e-3371-4cdc-a39d-d69eba7e5eb8 · outbound
This paper cites Computational aspects of monotone dualization: A brief survey.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Computational aspects of monotone dualization: A brief survey
Reference 16
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.050607Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 0ebf4d41-29a0-476a-b12e-7877c7e642e5 · outbound
This paper cites Fredman and Leonid Khachiyan.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Fredman and Leonid Khachiyan
Reference 17
- Resolution
- verified exact
- raw_fallback, observed 2026-08-06T18:57:59.780210Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 87931560-08b9-4220-b8c4-420cfcc05b22 · outbound
This paper cites Max Horn SAT and the minimum cut problem in directed hypergraphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Max Horn SAT and the minimum cut problem in directed hypergraphs
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.034732Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 4f235207-ad28-437e-9faf-a653538151ff · outbound
This paper cites Directed hypergraphs and applications.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Directed hypergraphs and applications
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.826638Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c71817e3-a892-4c6e-8242-ed3e2633a58c · outbound
This paper cites Directed hypergraphs as a modelling paradigm.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Directed hypergraphs as a modelling paradigm
Reference 20
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.020734Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7a9c62a2-9b48-4444-a149-07c2f01ec8b1 · outbound
This paper cites Johnson, Mihalis Yannakakis, and Christos H.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Johnson, Mihalis Yannakakis, and Christos H
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.835242Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 52c91d3c-717d-450e-bc8e-31cc682c9b2e · outbound
This paper cites Elbassioni, and Vladimir Gurvich.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Elbassioni, and Vladimir Gurvich
Reference 22
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:59.005380Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation edf792d0-c7c2-4a30-98c5-1b1b89e72d49 · outbound
This paper cites Efficiently enumerating results of keyword search over data graphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Efficiently enumerating results of keyword search over data graphs
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:58.989292Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b1ac75b1-49d5-4ca5-877f-fcc8b58f99c0 · outbound
This paper cites Linear-delay enumeration for minimal Steiner problems.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Linear-delay enumeration for minimal Steiner problems
Reference 24
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-06T18:57:59.557085Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b7f5a6b7-ed68-444d-8628-0084be83a71f · outbound
This paper cites Shortest hyperpaths in directed hypergraphs for reaction pathway inference.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Shortest hyperpaths in directed hypergraphs for reaction pathway inference
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.852437Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1ddb7962-9171-4fa9-aaa3-803a4559e1d3 · outbound
This paper cites Efficient enumerations for minimal multicuts and multiway cuts.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Efficient enumerations for minimal multicuts and multiway cuts
Reference 26
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:58.973804Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 4d69b310-526e-478d-b2a1-af28c12a8878 · outbound
This paper cites A remark on the definition of a B -hyperpath.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs A remark on the definition of a B -hyperpath
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.927924Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation c94a45d8-873c-4802-be4f-8dd596d6a423 · outbound
This paper cites Scott Provan and Douglas R.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Scott Provan and Douglas R
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.913697Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation aa8deac8-8310-4d7f-acff-3d7293d65a13 · outbound
This paper cites an unresolved cited work.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Unresolved cited work
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.870149Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 183bf30a-1d65-4aee-9a4f-8b0f251df9db · outbound
This paper cites an unresolved cited work.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Unresolved cited work
Reference 30
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T18:57:59.897346Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 1cbe5fed-c513-4fd4-9924-8cede388f57d · outbound
This paper cites Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.880763Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 878b22d7-d1fb-4f41-843f-1f7c831b7f34 · outbound
This paper cites Linear connectivity problems in directed hypergraphs.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Linear connectivity problems in directed hypergraphs
Reference 32
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:58.948443Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7c9e3e86-a66f-492b-92d5-27f130fa73f0 · outbound
This paper cites An algorithm to enumerate all cutsets of a graph in linear time per cutset.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs An algorithm to enumerate all cutsets of a graph in linear time per cutset
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:57:58.886914Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation eb2a5b15-bdc5-4dc9-83d2-e053077fa056 · outbound
This paper cites An efficient algorithm for enumerating chordless cycles and chordless paths.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs An efficient algorithm for enumerating chordless cycles and chordless paths
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T18:57:59.862823Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 9443a7ba-9566-432b-ad1b-c437194b6664 · outbound
This paper cites Volpentesta.
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs Volpentesta
Reference 35
- Resolution
- verified exact
- doi, observed 2026-08-06T18:57:58.931660Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Pith citing papers
No inbound Pith citation observations are available.