{"as_of":"2026-08-12T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf0621d1267b6643ecf2f08516077e606c869a5e0a3d63d9ea17c6115aa9eb13","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:57:58.895426Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2507.07528/citation-record","integrity":"/paper/2507.07528/integrity","json":"/paper/2507.07528/citation-record.json","paper":"/paper/2507.07528"},"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-06T18:57:59.981724Z","title":"Petri nets, hypergraphs and conflicts (preliminary version)","venue":null,"work_id":"1d020a39-ce9d-4d4a-85a7-41f08439083d","year":1993},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.740906Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:823e5f2bf59629b77dfe867656e12a7ccde671a6a781d1abd5e45c02d031d2d8","observation_id":"55836221-cf5b-4d41-a5b5-dbe021adb77b","resolution":{"observed_at":"2026-08-06T18:57:59.986196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2010.09.030","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Linear time analysis of properties of conflict-free and general petri nets","venue":"Theoretical Computer Science","work_id":"05ef198a-d4c2-407d-9032-4a92996ab4be","year":2011},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.746371Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:7ff0dc5c1fe3d21f8473098c1d7c48dc5bcb7ca8fdf5a188e2d1b2fb9b34cf71","observation_id":"4bfc2645-0ece-4fe7-b7ba-5df38d23cbae","resolution":{"observed_at":"2026-08-06T18:57:59.188892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:59.967124Z","title":"Linear time algorithms for liveness and boundedness in conflict-free petri nets","venue":null,"work_id":"fb823af9-d1ef-4267-8ea0-ed5e84fccee2","year":1992},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.751009Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:af5903396543f8e5193e739d224c5ea874f7d098ea9f3e8ad6948898aefeae1e","observation_id":"558d8cbd-39ad-45bb-ba74-3f105df12f8c","resolution":{"observed_at":"2026-08-06T18:57:59.971966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-012-9729-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"On the complexity of strongly connected components in directed hypergraphs","venue":"Algorithmica","work_id":"a405954a-f9f4-453a-944f-f48cb8cc5227","year":2014},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.755820Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:9b4f6c0069674dbf0dc5babae73cce11956f2d3419d2b7f359c94e4bcb4e396b","observation_id":"6037162b-1132-4958-8aa3-185a67ef2fcc","resolution":{"observed_at":"2026-08-06T18:57:59.174536Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jda.2003.12.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Partially dynamic maintenance of minimum weight hyperpaths","venue":"Journal of Discrete Algorithms","work_id":"6a066b80-88e8-49fb-a1e4-0c3f002281b0","year":2005},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.760421Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:3cc13222c140b785c3c45c551c99342fe7334ffab839369dc6ff4ed7fb3cabfc","observation_id":"3bb1b31f-2c5a-4625-b746-2111a869b279","resolution":{"observed_at":"2026-08-06T18:57:59.159841Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:59.952726Z","title":"Italiano, Luigi Laura, Umberto Nanni, and Fabiano Sarracco","venue":null,"work_id":"a5b0924b-2ba0-40cc-9621-7476004a4358","year":2012},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.765008Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:f7a85edf8b9485e061fe9f6a67d5c5b12ec43474d34f797b84d6992ad0f0d981","observation_id":"b9303b99-0b66-445e-a47e-c751d7e676e4","resolution":{"observed_at":"2026-08-06T18:57:59.957482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.769959Z","title":"Directed hypergraphs: Introduction and fundamental algorithms―a survey","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.769959Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:4b523aff603c9769fbfcffd1dfa9b44e55afed48fdc980e7eb80a18fbc3caa26","observation_id":"a77eedb5-ed94-42bd-beed-977ef7a1e76c","resolution":{"observed_at":"2026-08-06T18:57:58.769959Z","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":"10.1016/j.tcs.2020.12.021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Generating clause sequences of a cnf formula","venue":"Theoretical Computer Science","work_id":"dd587d23-1be8-4217-b32a-27cfa3f97799","year":2021},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.774295Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:39a216bbd8090908ced5985cb09b4ea0ebade9bc42b466fe3d18310ca23e7865","observation_id":"ab7fa685-f6cd-4ede-ac75-443abe4132de","resolution":{"observed_at":"2026-08-06T18:57:59.136702Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/mcda.1603","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Output-sensitive complexity of multiobjective combinatorial optimization","venue":"Journal of Multi-Criteria Decision Analysis","work_id":"f4c1fdee-7157-419a-8615-fc809c45b6e6","year":2017},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.779183Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:76b29945f5d40a8e2fc32fdefd0d87b941ba3bc7b9feef4abbecb6eae59e8d43","observation_id":"a840800f-8449-4fc2-b1fc-160057c98fa6","resolution":{"observed_at":"2026-08-06T18:57:59.122895Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.783775Z","title":"Generating all the minimal separators of a graph","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.783775Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:10697b7e48308fae8383a0db8d5c0c626652db4c2e676700a6ac563536539f2e","observation_id":"0a05cb7f-2afb-4d39-99e2-3c1a0718bb59","resolution":{"observed_at":"2026-08-06T18:57:58.783775Z","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-06T18:57:59.937439Z","title":"Optimal listing of cycles and st-paths in undirected graphs","venue":null,"work_id":"bad189fe-12fb-456e-8336-3cb6b2557e1a","year":2013},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.788044Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:351461de45acab5ea98f1ac7c5b88adf2bfda9fbb0ba69d6f2889b80bd3c1d2e","observation_id":"a9dbe6b0-7c78-439d-a38d-7b7488a3a59b","resolution":{"observed_at":"2026-08-06T18:57:59.942610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2024.07.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Generating minimal redundant and maximal irredundant subhypergraphs","venue":"Discrete Applied Mathematics","work_id":"fcdb2ec6-cde7-41fa-be55-aecbf0ba1731","year":2024},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.792525Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:560117449c99c81adcf78856f9f0d1c41f0225a8d3726f6b8a24c6ba1db9f22d","observation_id":"b995b1a7-34d4-411a-9a57-81bc8fa8f658","resolution":{"observed_at":"2026-08-06T18:57:59.099164Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.10646","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:59.841696Z","title":"On the hardness of inclusion-wise minimal separators enumeration","venue":null,"work_id":"557fc9d6-2f10-463d-839f-54d1e99088c8","year":2024},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.797486Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:6d88f87623b1b9fdfd42dc27e58c7814061b42fd76d4cb99c89cce23abae317a","observation_id":"0f0f522f-b07a-4a87-a998-061420d4da0d","resolution":{"observed_at":"2026-08-06T18:57:59.848943Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.aml.2007.07.031","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On finding hypercycles in chemical reaction networks","venue":"Applied Mathematics Letters","work_id":"a0128a61-00ec-42c0-9d2a-709dbf8fea36","year":2008},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.801668Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:171ef0d7517a802b152e9a135db27d569c8ec9500eaba07c16e310996854056c","observation_id":"b4697636-7a30-49af-872d-1b4b88b47d4c","resolution":{"observed_at":"2026-08-06T18:57:59.084814Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18537","last_updated":"2025-08-04T08:17:25Z","snapshot_observed_at":"2026-08-03T21:42:31.872060Z","submitted_at":"2024-02-28T18:22:03Z","title":"On the enumeration of signatures of XOR-CNF's","version":2},"cited_work":{"arxiv_id":"2402.18537","doi":"10.48550/arxiv.2402.18537","metadata_source":"pith","pith_arxiv_id":"2402.18537","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"On the enumeration of signatures of XOR-CNF's","venue":"cs.DS","work_id":"780d0d27-0384-4219-b6e5-d32e02f4a1bf","year":2024},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.806890Z"},"links":{"cited_paper":"/paper/2402.18537","citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:6e35ac8a71cd679aea74d93b5142e390896744eea2d8da2522d1a6130adedcc5","observation_id":"e50f09ee-24b5-4825-b85b-dc983de46bc3","resolution":{"observed_at":"2026-08-06T18:57:59.070565Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2007.04.017","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Computational aspects of monotone dualization: A brief survey","venue":"Discrete Applied Mathematics","work_id":"cb857b02-337c-47c3-b03a-db567445fe95","year":2008},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.812045Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:8ea79595c3f8bb90d0cf1dc891fb99747b245055df790773e71d5aed603e0c89","observation_id":"22cfa12e-3371-4cdc-a39d-d69eba7e5eb8","resolution":{"observed_at":"2026-08-06T18:57:59.050607Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1996.0062","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:59.770160Z","title":"Fredman and Leonid Khachiyan","venue":null,"work_id":"c582a6fe-d549-4d0c-95f7-fa079b5a2f41","year":1996},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.817371Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:ff76ce0fc3de310fec6fd119bc1dc8523b0c4a20f96179dd49ce048bbf80c0a1","observation_id":"0ebf4d41-29a0-476a-b12e-7877c7e642e5","resolution":{"observed_at":"2026-08-06T18:57:59.780210Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01581727","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Max Horn SAT and the minimum cut problem in directed hypergraphs","venue":"Mathematical Programming","work_id":"ae50d10d-fb1d-483c-94fa-64de44395274","year":1998},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.821955Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:c7cf7d8fac9cd767c7b9edfd1847fac7bb41d6c916986fabbafc37586731c7ea","observation_id":"87931560-08b9-4220-b8c4-420cfcc05b22","resolution":{"observed_at":"2026-08-06T18:57:59.034732Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.826638Z","title":"Directed hypergraphs and applications","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.826638Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:3f8d0332feae2409c9243b3af04a84bbf960c0b228394a82b013926ae1a1cfbc","observation_id":"4f235207-ad28-437e-9faf-a653538151ff","resolution":{"observed_at":"2026-08-06T18:57:58.826638Z","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":"10.1007/bf02735318","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Directed hypergraphs as a modelling paradigm","venue":"Decisions in Economics and Finance","work_id":"8177323e-c6dd-4b24-9b80-c4d2ea918d18","year":1998},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.831139Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:5c2f61bc1e808b7f4526e59e0fb3789ba04f507a2e64db0312bfa4700c4a7229","observation_id":"c71817e3-a892-4c6e-8242-ed3e2633a58c","resolution":{"observed_at":"2026-08-06T18:57:59.020734Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.835242Z","title":"Johnson, Mihalis Yannakakis, and Christos H","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.835242Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:dcb9e41fe956ff6156db024b087c564f4a55b41ca07d2bf554614a0a43247477","observation_id":"7a9c62a2-9b48-4444-a149-07c2f01ec8b1","resolution":{"observed_at":"2026-08-06T18:57:58.835242Z","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":"10.1007/s00453-007-9074-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Elbassioni, and Vladimir Gurvich","venue":"Algorithmica","work_id":"47e676b1-a207-4251-826e-7e35b56b933a","year":2008},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.839517Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:733325aa7ceba731d4b4f940cb16d0e123c30e853149d8f8b4a4eeb73c5d2e0c","observation_id":"52c91d3c-717d-450e-bc8e-31cc682c9b2e","resolution":{"observed_at":"2026-08-06T18:57:59.005380Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.is.2008.01.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Efficiently enumerating results of keyword search over data graphs","venue":"Information Systems","work_id":"44e6a29c-8515-49b9-9b69-c7f412eff5f1","year":2008},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.843850Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:810d6e01e55624279e940d7e6b080e59d43dd7f47624244f9b3e0eb3f39bebf8","observation_id":"edf792d0-c7c2-4a30-98c5-1b1b89e72d49","resolution":{"observed_at":"2026-08-06T18:57:58.989292Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7804.35241","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:59.550113Z","title":"Linear-delay enumeration for minimal Steiner problems","venue":null,"work_id":"b43e9dec-63a2-49a2-abb4-f89abafc3da2","year":2022},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.848211Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:f70928a8b308fb9465b2c708c08d188213d30192396f28d3cabf2aa00c324908","observation_id":"b1ac75b1-49d5-4ca5-877f-fcc8b58f99c0","resolution":{"observed_at":"2026-08-06T18:57:59.557085Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.852437Z","title":"Shortest hyperpaths in directed hypergraphs for reaction pathway inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.852437Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:e1c13b644fbbcfbf5e1701b2069b62f453dee3b6c27fb34a52fd364ba00444cd","observation_id":"b7f5a6b7-ed68-444d-8628-0084be83a71f","resolution":{"observed_at":"2026-08-06T18:57:58.852437Z","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":"10.4230/lipics.mfcs.2020.60","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Efficient enumerations for minimal multicuts and multiway cuts","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"aa227d70-8a43-4a3e-84bb-dec09efb2e26","year":2020},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.856778Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:abe67681af129e71c82706de593e1af1c7fb489979d54c89fff13e9a734d2e1a","observation_id":"1ddb7962-9171-4fa9-aaa3-803a4559e1d3","resolution":{"observed_at":"2026-08-06T18:57:58.973804Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:59.923614Z","title":"A remark on the definition of a B -hyperpath","venue":null,"work_id":"9e09397a-c53f-41b1-b4e3-93b378a58a50","year":2001},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.861422Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:4c81886ba9fedec9f3cff8d57af4ee50495f4500ebe0470ab14857df7a8c9231","observation_id":"4d69b310-526e-478d-b2a1-af28c12a8878","resolution":{"observed_at":"2026-08-06T18:57:59.927924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:59.908538Z","title":"Scott Provan and Douglas R","venue":null,"work_id":"04edd2d9-73d4-4b07-8f1c-4217f42cf632","year":1996},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.866067Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:c538b0fd07b1f7fdf03c5cdf2c3d0963857170b6539bff1fa94897ad6aac5963","observation_id":"c94a45d8-873c-4802-be4f-8dd596d6a423","resolution":{"observed_at":"2026-08-06T18:57:59.913697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.870149Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.870149Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:32cf0e2d8f2cb6c2d8eefd35965025ddd978caa08fa3cf6dffdab77f83d701ca","observation_id":"aa8deac8-8310-4d7f-acff-3d7293d65a13","resolution":{"observed_at":"2026-08-06T18:57:58.870149Z","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-06T18:57:59.890792Z","title":null,"venue":null,"work_id":"f4f60148-0179-4556-b0be-df6790dfb2d8","year":1975},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.874470Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:6e123f7a1a78090c3cc738f17359a7b25c61586d2f52f3f00b8148581361981e","observation_id":"183bf30a-1d65-4aee-9a4f-8b0f251df9db","resolution":{"observed_at":"2026-08-06T18:57:59.897346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:59.874998Z","title":"Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph","venue":null,"work_id":"03c7a671-de8f-4df6-946e-f2ddc9a0cb1b","year":2010},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.878652Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:301058c6074c2722c2b323caea1472cd933111764d050a6ff0c9c73d622e8fed","observation_id":"1cbe5fed-c513-4fd4-9924-8cede388f57d","resolution":{"observed_at":"2026-08-06T18:57:59.880763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.02.038","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Linear connectivity problems in directed hypergraphs","venue":"Theoretical Computer Science","work_id":"ba53c3af-f4bf-4320-9996-0730601ab413","year":2009},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.882780Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:053f9208d3fd0f2b8c0c1aeff61c740bdb53da8c43fbf74868b83f17f367190c","observation_id":"878b22d7-d1fb-4f41-843f-1f7c831b7f34","resolution":{"observed_at":"2026-08-06T18:57:58.948443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T18:57:58.886914Z","title":"An algorithm to enumerate all cutsets of a graph in linear time per cutset","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.886914Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:ce17b6579e6a3ebdbc7a70239ba606d7e14b9a592fd9c37ce04c508acaf5d2a0","observation_id":"7c9e3e86-a66f-492b-92d5-27f130fa73f0","resolution":{"observed_at":"2026-08-06T18:57:58.886914Z","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-06T18:57:59.858330Z","title":"An efficient algorithm for enumerating chordless cycles and chordless paths","venue":null,"work_id":"3d68ecba-223f-493c-b39f-a7af39befacb","year":2014},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.891132Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:ff6c9e70edb7e85fa99ded40db438d9a8539d44cd4d1f65fcc5e4f34dbb75f00","observation_id":"eb2a5b15-bdc5-4dc9-83d2-e053077fa056","resolution":{"observed_at":"2026-08-06T18:57:59.862823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2007.04.023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Volpentesta","venue":"European Journal of Operational Research","work_id":"f210af82-40d6-48c4-8883-d4e7a7ac6b2a","year":2008},"citing_paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:57:58.895426Z"},"links":{"citing_paper":"/paper/2507.07528"},"observation_digest":"sha256:997742e54b9ce9dcdc3fc6c37f79e2964618e4c0d036fd8291adb5a3bb086f68","observation_id":"9443a7ba-9566-432b-ad1b-c437194b6664","resolution":{"observed_at":"2026-08-06T18:57:58.931660Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.07528","last_updated":"2025-07-10T08:24:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T06:31:55.035763Z","submitted_at":"2025-07-10T08:24:39Z","title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":8,"verified_exact":17,"verified_fuzzy":8},"total_outbound_references":35},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}