Pith. sign in

Paper Citation Record · LEDGER

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity

As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2507.09377.

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

pith.paper-citation-record.v1
2507.09377 v1

Coverage vector

measured 23 of 23 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T18:02:31.068733Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+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

23 of 23 outbound references displayed

  • verified exact0
  • verified fuzzy20
  • unresolved3
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation cc3d9629-6e57-45a8-b05a-ec7f2ac84da8 · outbound

This paper cites An optimization approach for resource allo- cation in surveillance systems,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity An optimization approach for resource allo- cation in surveillance systems,

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:34.839231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.788622Z digest=sha256:9c0522dac3a5ed9185b2e221e142352aca9016c7d94880bf38a7b673e3b32c9f

Observation b2018d73-6beb-45cc-a5e4-de63f53be483 · outbound

This paper cites Scalable attack graph generation using an agent-based model,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Scalable attack graph generation using an agent-based model,

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:34.684015Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.796949Z digest=sha256:e76160c1b42c89537fb45821d3c90ce11806f5e1ccfa2b50ef59baa7b5771a95

Observation 972ed243-b0e6-4a56-87e3-51ca6bd6407f · outbound

This paper cites Approximation algorithms for k-coverage in wireless sen- sor networks,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Approximation algorithms for k-coverage in wireless sen- sor networks,

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:34.534132Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.808974Z digest=sha256:eb021c653229ddea05cc35bf58069a085238a4526054f1af318c33e8efd73b29

Observation 1a915bad-b880-4df3-ab32-9d4fbbfaf13c · outbound

This paper cites CP-NCBF: A Conformal Prediction-based Approach to Synthesize Verified Neural Control Barrier Functions.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity CP-NCBF: A Conformal Prediction-based Approach to Synthesize Verified Neural Control Barrier Functions

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-06T18:02:30.820193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T18:02:30.820193Z digest=sha256:ca1557e8247d524401f5d19d88ddada920873ce228cc3ff57d98e9ce42a01c05

Observation 4f329446-2c41-4588-bb3f-d92029d2b3f4 · outbound

This paper cites A physics-informed machine learning framework for safe and optimal control of autonomous systems,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity A physics-informed machine learning framework for safe and optimal control of autonomous systems,

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:34.370002Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.827333Z digest=sha256:36928db3835a791e333e3839dce010e55c1fa9371d882cba497613b120755cf7

Observation 7bec81ac-ba1a-4530-a98d-2b10acec3d51 · outbound

This paper cites Genosil: Generalized optimal and safe robot control using parameter-conditioned imitation learning,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Genosil: Generalized optimal and safe robot control using parameter-conditioned imitation learning,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-06T18:02:30.841273Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T18:02:30.841273Z digest=sha256:9761f3bbdbdec29ac7be85b1d1fc138ef3337d6a408cd924423e045085345a28

Observation 3510fbe1-a315-497f-b477-73564d532d76 · outbound

This paper cites Control barrier functions in dy- namic uavs for kinematic obstacle avoidance: A collision cone approach,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Control barrier functions in dy- namic uavs for kinematic obstacle avoidance: A collision cone approach,

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:34.196961Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.856534Z digest=sha256:9d31d8bdbe7d941176fc731fa0efd83002dec0e62d2500be7c6a39e8025ad01c

Observation dc909a2b-8062-41de-b9f9-8125e525ecd2 · outbound

This paper cites Learning a formally verified control barrier function in stochastic environment,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Learning a formally verified control barrier function in stochastic environment,

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:33.918372Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.863653Z digest=sha256:ec778071833e8b86346dcb989d7b4eb28834eeb2787dfefc3c8bae7cff44a51c

Observation c7e5e960-1e40-483f-a3d0-e7349d7679ba · outbound

This paper cites Polygonal cone control barrier functions (polyc2bf) for safe navigation in cluttered environments,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Polygonal cone control barrier functions (polyc2bf) for safe navigation in cluttered environments,

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:33.714447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.879267Z digest=sha256:3b3c6c58652a2d2c79a12421e9c15627f0c7b3e66c69efc0af9c48725f0507b3

Observation 9e44a91a-e914-4498-99ca-49714021cd80 · outbound

This paper cites Semi-supervised safe visuomotor policy synthesis using barrier certificates,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Semi-supervised safe visuomotor policy synthesis using barrier certificates,

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:33.515602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.896083Z digest=sha256:7e524e96282370c2b25d709b18f0d6257280e65a79c2f32245bca2abb4661c9d

Observation faf1abfd-b526-487b-9842-88d96347229f · outbound

This paper cites Protein–protein interaction prediction: the contribution of structural biology,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Protein–protein interaction prediction: the contribution of structural biology,

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:33.343424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.907026Z digest=sha256:ba24692d9b0b46b46108bda3b7648b9ce4ab014535d785836c905843c3547d79

Observation fedd6aea-c904-466b-a8fe-12cc466d304b · outbound

This paper cites Topological network alignment uncovers biological function and phylogeny,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Topological network alignment uncovers biological function and phylogeny,

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:33.122566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.922638Z digest=sha256:78248e6518d3a21983b778dc41f136dfb4fc6d1ab306483f1bf40d5ce6a6aed2

Observation 804b91a3-ae74-4bfa-90fa-75f22a302487 · outbound

This paper cites Identification of disease genes by integrating gene expression and protein–protein interaction data,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Identification of disease genes by integrating gene expression and protein–protein interaction data,

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.988977Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.937902Z digest=sha256:fd265bbb75e0f0519216509e2cb5c0a9538b99195206d2a511617d388c2eb800

Observation 20c55627-e3df-4c1e-be85-d70fa972c279 · outbound

This paper cites Vlsi circuit partitioning by cluster-removal using vertex- cover approximation,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Vlsi circuit partitioning by cluster-removal using vertex- cover approximation,

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.800573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.954741Z digest=sha256:5c0554f5cacde9d6261a0788bd15a198e206a9384315b1829d43fc37e6f51ec0

Observation c06d3fcc-bf45-4dc5-8522-73ceb6a0958e · outbound

This paper cites Efficient floorplanning based on a modified vertex cover algorithm,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Efficient floorplanning based on a modified vertex cover algorithm,

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.642865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.965402Z digest=sha256:dbde8f67071a70925e0142d2fc1dad42f7e4324d0583edc21f9358f8dcdabd53

Observation 8d346426-9f95-44d4-a05e-fd2d58e17400 · outbound

This paper cites An efficient heuristic procedure for test generation based on computing maximum independent sets,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity An efficient heuristic procedure for test generation based on computing maximum independent sets,

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.475570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.972839Z digest=sha256:2c2b20fa17ee5939ffa7028b2ae14e3ae0d223160dd187bcef2f8f0819ed6968

Observation aa8d0dd8-eaeb-48ec-9dac-0256b526f3b8 · outbound

This paper cites an unresolved cited work.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-06T18:02:32.311916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:30.987765Z digest=sha256:c3321f7c5167443a8d4ef8f83ea070bf27e1e7cc266357371c616ebcd1569723

Observation 6d484278-e3e2-42e8-8fe1-f0f4c0360fe1 · outbound

This paper cites Sagemath, the Sage Mathematics Software System (Version [insert version used]),.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Sagemath, the Sage Mathematics Software System (Version [insert version used]),

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.171650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.009488Z digest=sha256:4749f9f1d641eae10894bc7833a280fab9f38a6e072b49211ded63c7b07547a5

Observation 41ea5249-b497-4115-96fc-9da9ae4f3383 · outbound

This paper cites Diestel, Graph theory.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Diestel, Graph theory

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:32.047712Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.022306Z digest=sha256:8a60b556555d1ad5352ddb428810fe47f6762e8690777e7ec3b54bf9dec464c9

Observation fafd6e92-3451-47f1-8d3c-2a2c2a868532 · outbound

This paper cites Fixed-parameter tractability and completeness,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Fixed-parameter tractability and completeness,

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:31.827304Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.039005Z digest=sha256:7d1d19f1d925d53a6d394d980fb85d9bbe1f7461886b9e5f90c7252923a4379f

Observation 5f354302-50c5-4633-aaad-0d6a081795dd · outbound

This paper cites A new branching strategy for vertex cover,.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity A new branching strategy for vertex cover,

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:31.572225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.046875Z digest=sha256:c92c5efb80ad1888c2aa148bc77b4161c0b6825be42c84521d25bebbdb20ba37

Observation 86361376-eb0e-4c12-ae70-ecc971f5d37a · outbound

This paper cites Cygan, F.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Cygan, F

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:31.494540Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.056349Z digest=sha256:772c44c76fee64eedb556eabe011666511abc8cc9d5ff5fbe400cebbf5b5b433

Observation 65172f44-0b3a-4066-bbca-b0070117d74d · outbound

This paper cites Niedermeier, Invitation to Fixed-Parameter Algorithms.

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity Niedermeier, Invitation to Fixed-Parameter Algorithms

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T18:02:31.435996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T18:02:31.068733Z digest=sha256:484a202cebb439b9f8ae103f2d255cf47bd97784b472a6fd3796aed82d0b2a11

Pith citing papers

No inbound Pith citation observations are available.