Pith. sign in

Paper Citation Record · LEDGER

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

As of 8 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-08T06:32:00.761636+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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:30.856534Z digest=sha256:46a248d68d4d1a14380096fee40b2ef123b1a93febebb87c3990f1fe82ec2829

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:30.922638Z digest=sha256:1308d2639c592a827a2098a6c1f0bdc77057b1cbc16cb8359965e524cb1fcb87

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:30.954741Z digest=sha256:6bac2cab7efc8682c95c26bb3582e8b6cef178bd23267986c07eb788640ff654

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:30.972839Z digest=sha256:1d502274a30813e66919503f67b5189aa09a9710a0b71d111ed0844c9028b528

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:31.022306Z digest=sha256:3363c2556e3cba7a768d31120082eaa6e7397823c29fb844d9a1a6c30dc99163

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T18:02:31.056349Z digest=sha256:2d74241981022e2f032c93ee4852e2649b7d366a3370f8485c7eb6347ef44764

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-08T06:32:00.761636+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.