{"as_of":"2026-08-09T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:483f148ed57c46951e790e43391e07d9d1f224aeb04a40d58482bd6b22e8e745","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:02:31.068733Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.09377/citation-record","integrity":"/paper/2507.09377/integrity","json":"/paper/2507.09377/citation-record.json","paper":"/paper/2507.09377"},"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:02:34.750297Z","title":"An optimization approach for resource allo- cation in surveillance systems,","venue":null,"work_id":"36333ac7-c3a5-4d37-868b-97dae4d826ac","year":2007},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.788622Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:9c0522dac3a5ed9185b2e221e142352aca9016c7d94880bf38a7b673e3b32c9f","observation_id":"cc3d9629-6e57-45a8-b05a-ec7f2ac84da8","resolution":{"observed_at":"2026-08-06T18:02:34.839231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:34.615029Z","title":"Scalable attack graph generation using an agent-based model,","venue":null,"work_id":"b0b02428-e2d7-4795-905b-e27c8d660b9e","year":2006},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.796949Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:e76160c1b42c89537fb45821d3c90ce11806f5e1ccfa2b50ef59baa7b5771a95","observation_id":"b2018d73-6beb-45cc-a5e4-de63f53be483","resolution":{"observed_at":"2026-08-06T18:02:34.684015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:34.483958Z","title":"Approximation algorithms for k-coverage in wireless sen- sor networks,","venue":null,"work_id":"3ad82b22-344b-4082-a04a-8caf457be1cf","year":2009},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.808974Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:eb021c653229ddea05cc35bf58069a085238a4526054f1af318c33e8efd73b29","observation_id":"972ed243-b0e6-4a56-87e3-51ca6bd6407f","resolution":{"observed_at":"2026-08-06T18:02:34.534132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17395","last_updated":"2025-05-17T13:16:54Z","snapshot_observed_at":"2026-08-07T16:55:23.968596Z","submitted_at":"2025-03-18T10:01:06Z","title":"CP-NCBF: A Conformal Prediction-based Approach to Synthesize Verified Neural Control Barrier Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17395","snapshot_observed_at":"2026-08-06T18:02:30.820193Z","title":"Cp-ncbf: A conformal prediction- based approach to synthesize verified neural control barrier functions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.820193Z"},"links":{"cited_paper":"/paper/2503.17395","citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:ca1557e8247d524401f5d19d88ddada920873ce228cc3ff57d98e9ce42a01c05","observation_id":"1a915bad-b880-4df3-ab32-9d4fbbfaf13c","resolution":{"observed_at":"2026-08-06T18:02:30.820193Z","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:02:34.295243Z","title":"A physics-informed machine learning framework for safe and optimal control of autonomous systems,","venue":null,"work_id":"455bfcd5-9099-49d0-baa8-d40ea7aa2e03","year":2025},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.827333Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:36928db3835a791e333e3839dce010e55c1fa9371d882cba497613b120755cf7","observation_id":"4f329446-2c41-4588-bb3f-d92029d2b3f4","resolution":{"observed_at":"2026-08-06T18:02:34.370002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:30.841273Z","title":"Genosil: Generalized optimal and safe robot control using parameter-conditioned imitation learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.841273Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:9761f3bbdbdec29ac7be85b1d1fc138ef3337d6a408cd924423e045085345a28","observation_id":"7bec81ac-ba1a-4530-a98d-2b10acec3d51","resolution":{"observed_at":"2026-08-06T18:02:30.841273Z","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:02:34.083444Z","title":"Control barrier functions in dy- namic uavs for kinematic obstacle avoidance: A collision cone approach,","venue":null,"work_id":"24790e68-1b76-4e11-9160-44acafba6ec7","year":2024},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.856534Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:9d31d8bdbe7d941176fc731fa0efd83002dec0e62d2500be7c6a39e8025ad01c","observation_id":"3510fbe1-a315-497f-b477-73564d532d76","resolution":{"observed_at":"2026-08-06T18:02:34.196961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:33.853412Z","title":"Learning a formally verified control barrier function in stochastic environment,","venue":null,"work_id":"d91f8c07-0688-46a2-980d-2be8da348caf","year":2024},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.863653Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:ec778071833e8b86346dcb989d7b4eb28834eeb2787dfefc3c8bae7cff44a51c","observation_id":"dc909a2b-8062-41de-b9f9-8125e525ecd2","resolution":{"observed_at":"2026-08-06T18:02:33.918372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:33.645314Z","title":"Polygonal cone control barrier functions (polyc2bf) for safe navigation in cluttered environments,","venue":null,"work_id":"2c81e3e8-7069-4f68-a8b2-bbeb5a09e4de","year":2024},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.879267Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:3b3c6c58652a2d2c79a12421e9c15627f0c7b3e66c69efc0af9c48725f0507b3","observation_id":"c7e5e960-1e40-483f-a3d0-e7349d7679ba","resolution":{"observed_at":"2026-08-06T18:02:33.714447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:33.437542Z","title":"Semi-supervised safe visuomotor policy synthesis using barrier certificates,","venue":null,"work_id":"d1bd9b03-0372-4469-9822-c8d4d594ce5b","year":2024},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.896083Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:7e524e96282370c2b25d709b18f0d6257280e65a79c2f32245bca2abb4661c9d","observation_id":"9e44a91a-e914-4498-99ca-49714021cd80","resolution":{"observed_at":"2026-08-06T18:02:33.515602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:33.213550Z","title":"Protein–protein interaction prediction: the contribution of structural biology,","venue":null,"work_id":"ea671ebd-ab09-4e7d-9730-91b69ae1d592","year":2004},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.907026Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:ba24692d9b0b46b46108bda3b7648b9ce4ab014535d785836c905843c3547d79","observation_id":"faf1abfd-b526-487b-9842-88d96347229f","resolution":{"observed_at":"2026-08-06T18:02:33.343424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:33.059580Z","title":"Topological network alignment uncovers biological function and phylogeny,","venue":null,"work_id":"64de0d4f-17fd-4aea-8efb-261d182ea6e4","year":2010},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.922638Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:78248e6518d3a21983b778dc41f136dfb4fc6d1ab306483f1bf40d5ce6a6aed2","observation_id":"fedd6aea-c904-466b-a8fe-12cc466d304b","resolution":{"observed_at":"2026-08-06T18:02:33.122566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.891415Z","title":"Identification of disease genes by integrating gene expression and protein–protein interaction data,","venue":null,"work_id":"33555bc5-4a6e-4a0c-bed5-5332d52aec84","year":2009},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.937902Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:fd265bbb75e0f0519216509e2cb5c0a9538b99195206d2a511617d388c2eb800","observation_id":"804b91a3-ae74-4bfa-90fa-75f22a302487","resolution":{"observed_at":"2026-08-06T18:02:32.988977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.704996Z","title":"Vlsi circuit partitioning by cluster-removal using vertex- cover approximation,","venue":null,"work_id":"557548b3-8022-4053-8a42-8d2f861fe7b6","year":1998},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.954741Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:5c0554f5cacde9d6261a0788bd15a198e206a9384315b1829d43fc37e6f51ec0","observation_id":"20c55627-e3df-4c1e-be85-d70fa972c279","resolution":{"observed_at":"2026-08-06T18:02:32.800573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.550002Z","title":"Efficient floorplanning based on a modified vertex cover algorithm,","venue":null,"work_id":"354456be-7d8c-461a-af0d-4bd3d09cab57","year":1999},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.965402Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:dbde8f67071a70925e0142d2fc1dad42f7e4324d0583edc21f9358f8dcdabd53","observation_id":"c06d3fcc-bf45-4dc5-8522-73ceb6a0958e","resolution":{"observed_at":"2026-08-06T18:02:32.642865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.390472Z","title":"An efficient heuristic procedure for test generation based on computing maximum independent sets,","venue":null,"work_id":"dc11f73a-5a66-4b27-a60f-0b15aecd7c7d","year":1995},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.972839Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:2c2b20fa17ee5939ffa7028b2ae14e3ae0d223160dd187bcef2f8f0819ed6968","observation_id":"8d346426-9f95-44d4-a05e-fd2d58e17400","resolution":{"observed_at":"2026-08-06T18:02:32.475570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.243740Z","title":null,"venue":null,"work_id":"e0a3225c-4f14-4f18-9ac2-6ac6ee5005bc","year":1979},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:30.987765Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:c3321f7c5167443a8d4ef8f83ea070bf27e1e7cc266357371c616ebcd1569723","observation_id":"aa8d0dd8-eaeb-48ec-9dac-0256b526f3b8","resolution":{"observed_at":"2026-08-06T18:02:32.311916Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:32.120044Z","title":"Sagemath, the Sage Mathematics Software System (Version [insert version used]),","venue":null,"work_id":"a43e1c5a-007f-4f03-8859-fed1967571f8","year":null},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.009488Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:4749f9f1d641eae10894bc7833a280fab9f38a6e072b49211ded63c7b07547a5","observation_id":"6d484278-e3e2-42e8-8fe1-f0f4c0360fe1","resolution":{"observed_at":"2026-08-06T18:02:32.171650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:31.950365Z","title":"Diestel, Graph theory","venue":null,"work_id":"0b290592-4143-4349-a161-8e0e2099c2d9","year":2017},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.022306Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:8a60b556555d1ad5352ddb428810fe47f6762e8690777e7ec3b54bf9dec464c9","observation_id":"41ea5249-b497-4115-96fc-9da9ae4f3383","resolution":{"observed_at":"2026-08-06T18:02:32.047712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:31.704165Z","title":"Fixed-parameter tractability and completeness,","venue":null,"work_id":"b84e8279-431c-4fc4-8faf-43ca75edeef0","year":1999},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.039005Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:7d1d19f1d925d53a6d394d980fb85d9bbe1f7461886b9e5f90c7252923a4379f","observation_id":"fafd6e92-3451-47f1-8d3c-2a2c2a868532","resolution":{"observed_at":"2026-08-06T18:02:31.827304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:31.528763Z","title":"A new branching strategy for vertex cover,","venue":null,"work_id":"b15f8846-db48-47eb-810b-3e234f2c323c","year":2010},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.046875Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:c92c5efb80ad1888c2aa148bc77b4161c0b6825be42c84521d25bebbdb20ba37","observation_id":"5f354302-50c5-4633-aaad-0d6a081795dd","resolution":{"observed_at":"2026-08-06T18:02:31.572225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:31.475208Z","title":"Cygan, F","venue":null,"work_id":"73d1f6a2-4c7f-4fe9-a651-ffbb567adbd8","year":2015},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.056349Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:772c44c76fee64eedb556eabe011666511abc8cc9d5ff5fbe400cebbf5b5b433","observation_id":"86361376-eb0e-4c12-ae70-ecc971f5d37a","resolution":{"observed_at":"2026-08-06T18:02:31.494540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:02:31.415872Z","title":"Niedermeier, Invitation to Fixed-Parameter Algorithms","venue":null,"work_id":"69a03e98-e1b9-44b9-9375-0c4f774e1c87","year":2006},"citing_paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:02:31.068733Z"},"links":{"citing_paper":"/paper/2507.09377"},"observation_digest":"sha256:484a202cebb439b9f8ae103f2d255cf47bd97784b472a6fd3796aed82d0b2a11","observation_id":"65172f44-0b3a-4066-bbca-b0070117d74d","resolution":{"observed_at":"2026-08-06T18:02:31.435996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09377","last_updated":"2025-07-12T18:49:32Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T17:55:03.127426Z","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":23},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}