Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T12:46:03.913848Z
Paper Citation Record · LEDGER
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:1908.06541.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-05T05:49:44.362931Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T05:49:44.494599Z
Reference resolution
15 of 15 outbound references displayed
- verified exact0
- verified fuzzy12
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 49ed167a-f3e5-442e-b561-eeba1dc40405 · outbound
This paper cites an unresolved cited work.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:46:04.108438Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 5b2294da-9214-4701-9dfd-0c328cb8fb3b · outbound
This paper cites ”Two formal analyses of attack graphs.” In Proceedings 15th IEEE Computer Security Foundations Workshop.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Two formal analyses of attack graphs.” In Proceedings 15th IEEE Computer Security Foundations Workshop
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.096789Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 630f4f71-241f-4ee3-ae8e-c321bdcabc26 · outbound
This paper cites ”Approximation and hardness results for label cut and related problems.” Journal of Combinatorial Op- timization 21, no.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Approximation and hardness results for label cut and related problems.” Journal of Combinatorial Op- timization 21, no
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.084329Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e9cbf81e-893e-4acf-9b01-2024f3205f44 · outbound
This paper cites ”Approximating minimum label s-t cut via linear programming.” In Latin American Symposium on Theoretical Informatics, pp.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Approximating minimum label s-t cut via linear programming.” In Latin American Symposium on Theoretical Informatics, pp
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.073373Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 050294cc-0835-4b16-a27d-1f22ae3a6ee2 · outbound
This paper cites Woeginger, and Shenggui Zhang.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem Woeginger, and Shenggui Zhang
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.050996Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9398e0f6-94a1-4a96-b3f9-9149b526eeb4 · outbound
This paper cites ”The parameterized complexity of some minimum label problems.” Journal of Computer and System Sciences 76, no.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”The parameterized complexity of some minimum label problems.” Journal of Computer and System Sciences 76, no
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.040053Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ae5b237c-dc09-49a8-8aac-37ed423ab057 · outbound
This paper cites ”A graph theoretic model for complex network failure scenarios.” In Proceedings of the Eighth INFORMS Telecommunications Conference, Dallas, Texas.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”A graph theoretic model for complex network failure scenarios.” In Proceedings of the Eighth INFORMS Telecommunications Conference, Dallas, Texas
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.028906Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 177684cf-586b-4f57-b942-b53ac33a32cc · outbound
This paper cites ”Efficient algorithms for the label cut problems.” In International Conference on Theory and Applications of Models of Computation, pp.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Efficient algorithms for the label cut problems.” In International Conference on Theory and Applications of Models of Computation, pp
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.017639Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f17e1411-bbde-4df3-91af-768963df7e6e · outbound
This paper cites Karger, and Debmalya Panigrahi.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem Karger, and Debmalya Panigrahi
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:04.005597Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c12810f6-aeaf-47b2-9252-6280c3b12a1f · outbound
This paper cites ”Pseudorandom sets in grassmann graph have near-perfect expansion.” 2018 IEEE 59th Annual Symposium on Foun- dations of Computer Science (FOCS).
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Pseudorandom sets in grassmann graph have near-perfect expansion.” 2018 IEEE 59th Annual Symposium on Foun- dations of Computer Science (FOCS)
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:03.982625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ed9b8c78-1e5f-4724-a31d-7fce1f2432ab · outbound
This paper cites ”On the hardness of approximating minimum vertex cover.” Annals of mathematics (2005): 439-485.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”On the hardness of approximating minimum vertex cover.” Annals of mathematics (2005): 439-485
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:03.971174Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 67777685-d1b7-4791-a0cc-d04b59ac508a · outbound
This paper cites ”Reducibility among combinatorial problems.” Complexity of computer computations.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”Reducibility among combinatorial problems.” Complexity of computer computations
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:03.958814Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ef4664fe-b48e-45bb-a64f-04bb7e31db05 · outbound
This paper cites ”On weighted vs un- weighted versions of combinatorial optimization problems.” Information and Com- putation 167.1 (2001): 10-26.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem ”On weighted vs un- weighted versions of combinatorial optimization problems.” Information and Com- putation 167.1 (2001): 10-26
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:46:03.947730Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 461dd268-c81c-4e84-b8ae-41e4a9bde65e · outbound
This paper cites an unresolved cited work.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem Unresolved cited work
Reference 666
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:46:04.062303Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 83c2c1ee-1e43-4957-9316-880cc6705fa2 · outbound
This paper cites an unresolved cited work.
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem Unresolved cited work
Reference 1114
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:46:03.994453Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
Observation 90533c53-453d-4d1e-853f-3499a41ffe1d · inbound
Color-avoiding connected colorings and orientations cites this paper.
Color-avoiding connected colorings and orientations The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
Reference 51
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T05:49:44.508539Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.