Pith. sign in

Paper Citation Record · LEDGER

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

As of 10 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-10T06:31:04.303077+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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:30.788622Z digest=sha256:8791a0b8dbb99240c288d09b1e937e12bc2c3a46a37465bd6f72b3c785291809

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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:672cc72a9c753add3f953d915280204415aafce458f8db2f3e4c3a7f23e0fd4b

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-10T06:31:04.303077+00:00.

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

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:00fccb0018f54d0f24a02a13afdbb010743d738b956eec986cd6bca2477697c8

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:30.856534Z digest=sha256:82d663a42bbd8a3111f0bfff4ceb049be4875a6175bf663d98dfb68ee79e056d

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:30.922638Z digest=sha256:7eefaa9c49b293d69cf0df2b31cfac7105f8ae0f0fd23dd6396c1e3b1fc9b765

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:30.954741Z digest=sha256:8ab7797b860a5c52e38b5afd1558992dae79231d95c08e6074a56f1be9160279

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:30.972839Z digest=sha256:50a0007c4a852c59901092174cc64f762296eaee1cc4c88708aad6e50a1245d9

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:31.022306Z digest=sha256:0bc5a0bd8b2cb9eb04ca2bbaffd77f53ac2204a566f9750f453016fd34fc3e57

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-06T18:02:31.056349Z digest=sha256:032bacc5f39a0042bc87fa8224a50ebdbc94769d83f201786f71921cbd7ad835

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-10T06:31:04.303077+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.