Pith. sign in

Paper Citation Record · LEDGER

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension

As of 17 August 2026, this Paper Citation Record lists 100 of 147 outbound references and 0 inbound Pith citation observations for arXiv:2608.03801.

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

pith.paper-citation-record.v1
2608.03801 v1

Coverage vector

measured 100 of 147 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T12:26:55.873722Z

measured 100 of 100 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

100 of 147 outbound references displayed

  • verified exact13
  • verified fuzzy7
  • unresolved77
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bfeade74-a595-4f59-a8b0-31ae0858b33b · outbound

This paper cites Parameterized approximation schemes for clustering with general norm objectives.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized approximation schemes for clustering with general norm objectives

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.514246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.514246Z digest=sha256:02e859a4a8fa732fff00509f3098da220ebf12beaf36962280e0ac947dc3b963

Observation 76aa0e28-1ffc-406b-a43e-93f9d2799465 · outbound

This paper cites Fomin, and Saket Saurabh.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Fomin, and Saket Saurabh

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.519667Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.519667Z digest=sha256:eb3bf1566b792be78f01dca8501c0054741e0c05661b282ead8b3f7b53749f83

Observation a93241f4-5687-4389-bfbf-dd04acd27fff · outbound

This paper cites Global cardinality constraints make approximating some max-2-csps harder.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Global cardinality constraints make approximating some max-2-csps harder

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.523043Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.523043Z digest=sha256:8f1e63aa6ae6edca3743ab7e3c64ce8ada53e5dc8ed73fcfb3f6d6b40a88b648

Observation 3fd059be-b83d-4785-9bee-510c907ad1e4 · outbound

This paper cites Using homogeneous weights for approximating the partial cover problem.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Using homogeneous weights for approximating the partial cover problem

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.527280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.527280Z digest=sha256:3cb1734b012fa9c1cc6df21647980d2203c5104514ea22fcc6a5bcaf62d5eafe

Observation 9d671525-af59-4706-93fc-03212ac7ca30 · outbound

This paper cites Bshouty and Lynn Burroughs.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Bshouty and Lynn Burroughs

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.531309Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.531309Z digest=sha256:0aeeedc793b833436f395468b7480db4940aaace8843863853b038f0f13bfcb7

Observation e4b67e69-9d32-4eaa-a718-029de4bc2e05 · outbound

This paper cites Product range spaces, sensitive sampling, and derandomization.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Product range spaces, sensitive sampling, and derandomization

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.534544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.534544Z digest=sha256:f34685c4e06b8d78b3c6f91b1a9133f5d3ab5cc0328cc7b58476f8440e6b81c6

Observation 891a629e-32d0-46c6-a017-9856fe081219 · outbound

This paper cites u rgen Perl, editors, Proceedings of the WG '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabr \.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension u rgen Perl, editors, Proceedings of the WG '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabr \

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.538285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.538285Z digest=sha256:ff62a530563f079b75c361714018154a797dcfc28396b78d2a6238d15c8dd835

Observation 54b88745-11b8-4e9c-8b5b-e2add8b151d9 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.541633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.541633Z digest=sha256:669265f54a3601f4ea6b1b68d815cc5841fc933e7157dea3a3e154fa23bb0d6a

Observation f902d13c-9cd4-4fca-96d2-9a97ad863a36 · outbound

This paper cites Goodrich.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Goodrich

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.545681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.545681Z digest=sha256:1ff15b7da3df5fa5eef65f557e5e5d0ea46fcbe4df984166c2c8131c435eaef8

Observation 1f4f036b-d81a-4cb5-874e-e33347e4d615 · outbound

This paper cites Optimal long code test with one free bit.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Optimal long code test with one free bit

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.549127Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.549127Z digest=sha256:2b0f591b39f8e1bfbb3867e7535daab47d56cfee9b65b4b8c70bda31f3d2af8c

Observation dc3856f2-ae57-4cd7-9df8-48df81e89d6f · outbound

This paper cites Approximating low-dimensional coverage problems.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Approximating low-dimensional coverage problems

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.552229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.552229Z digest=sha256:b4e38d9befe3c86d999640e35661eba57e8a79c4fbc471f2b069c45cf9b3cb7a

Observation d83acc63-ba30-493d-9f7f-7e73a978e9f6 · outbound

This paper cites Improved approximation algorithms for max-2sat with cardinality constraint.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Improved approximation algorithms for max-2sat with cardinality constraint

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.555821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.555821Z digest=sha256:fb36d40b039fc31b7d75d4ea9e0b779aa2271e3e6c95b9aa2e57d5ee160308fc

Observation 43a77dea-ccc9-4a24-b88a-de788fee91f2 · outbound

This paper cites Bounding -scatter dimension via metric sparsity.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Bounding -scatter dimension via metric sparsity

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.559676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.559676Z digest=sha256:f562a999df666a17e0d181803b32a82552adf1660f2944eef7c5f4ec48e51bb2

Observation 7c77b7ba-0664-4bc3-9b10-da014b074206 · outbound

This paper cites S., and Dor Minzer.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension S., and Dor Minzer

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.562694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.562694Z digest=sha256:469be9e1499b99a0d4c520770de9c3340e173fafacf76ef7aeaf9353694f67d1

Observation 19e0d6a8-bfd9-4406-ba1f-ed98d87673c9 · outbound

This paper cites Tight FPT approximations for k-median and k-means.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Tight FPT approximations for k-median and k-means

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.565825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.565825Z digest=sha256:e6a661b4ddf548137a8eb7fc51e740b3491e13ae822215523471bcecdd3e1b4b

Observation f5ec12d6-456c-4852-967d-d7485a8e0ba5 · outbound

This paper cites van Kreveld, and Mark H.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension van Kreveld, and Mark H

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.570639Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.570639Z digest=sha256:73cae09a35ccbdb419ae2eca8f95d77d993321d131911499c82a685739d8b8f3

Observation b9405486-7b1e-4d30-a243-15d9c04a06bd · outbound

This paper cites A threshold of ln n for approximating set cover.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension A threshold of ln n for approximating set cover

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.578193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.578193Z digest=sha256:2f25f6218cf8d80cb39b60d42538d3e80204f169ee200e64d366d5774020d1fa

Observation 38da5491-0515-49d6-9553-820f0b64ec6d · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.581450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.581450Z digest=sha256:543cc1c7fecd46e95137b1cc7cab3556ed62e1042ac7fd691ab67f71a35d919e

Observation 208b7225-2633-4dd9-ad4b-b75cbcf4ca69 · outbound

This paper cites Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.584917Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.584917Z digest=sha256:2f69232a6596ea6142f696c0d9ce2244f4492c97d4cc09c9580e32c404a2d783

Observation 2aaa3dae-9b0d-4ccb-b3cc-feed8e7e5eed · outbound

This paper cites Progressive algorithms for domination and independence.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Progressive algorithms for domination and independence

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.592356Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.592356Z digest=sha256:3e56cae5748971173d6a4c1c565fbaa579bd6353bfaa2b808f3e2bbe4e64a79d

Observation 722ea43a-41ef-4360-8111-9812a2c9e587 · outbound

This paper cites An extremal problem for two families of sets.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension An extremal problem for two families of sets

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.595391Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.595391Z digest=sha256:d4628a36f8d3a27496551120b73be5e45f52870f28644268caf1a4984bfde627

Observation b8d562f9-5c7c-4fa0-823a-67e1c03a8b5e · outbound

This paper cites More efforts towards fixed-parameter approximability of multiwinner rules.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension More efforts towards fixed-parameter approximability of multiwinner rules

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.598950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.598950Z digest=sha256:997e31237e3acf792a3e3fe5933427c907d335dc47d6a248bce2c275b6b5e798

Observation 8a8f5895-e359-4f99-8666-c494e867beb9 · outbound

This paper cites Approximation algorithms for partial covering problems.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Approximation algorithms for partial covering problems

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.602199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.602199Z digest=sha256:6646254dd5dc1cec63b4489d485291af9cc24dcd1a8a0b97042a2c3e98b5db2c

Observation 8ae9668b-bd6b-4199-a9ce-a89dab9c7da7 · outbound

This paper cites Parameterized complexity of vertex cover variants.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized complexity of vertex cover variants

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.605629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.605629Z digest=sha256:67994e9c8cddb459c9b17f2b994dc8f40965804675b83a46de2e9ab6ef045161

Observation 3373c75b-35ec-46d9-babd-c83856ad06b5 · outbound

This paper cites Parameterized covering in semi-ladder-free hypergraphs.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized covering in semi-ladder-free hypergraphs

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.609621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.609621Z digest=sha256:be585d2d3e49f8a0a3d6ce35cedd699a05c12961455508dc037e4be106fa6853

Observation 071de1e7-b392-45d5-8e1c-52c207ceef41 · outbound

This paper cites Golovach and Yngve Villanger.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Golovach and Yngve Villanger

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.612880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.612880Z digest=sha256:ec848e620b7ff202ffada3838ce42588ea99fa6f9a0ab474b9b2b8dfc614eaa0

Observation eed45ee4-d627-4ce9-b22c-da243187534b · outbound

This paper cites Hochbaum.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Hochbaum

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.617068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.617068Z digest=sha256:12012e93859e41f3c2147eebae6996655a54ff0d1d12be1b7d98495d7d1b05db

Observation 5ae99821-5e41-4545-a074-e749fb803991 · outbound

This paper cites Hochbaum.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Hochbaum

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.620541Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.620541Z digest=sha256:716303ec950c175a13dd511078966a4cdc1894236842112d45d4fa8126a08a6c

Observation a4ed2a6a-1569-435b-b838-0a2a4404e098 · outbound

This paper cites An approximation algorithm for MAX-2-SAT with cardinality constraint.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension An approximation algorithm for MAX-2-SAT with cardinality constraint

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.624041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.624041Z digest=sha256:d7214c54792ad7962ac4f99d426fc54a9d790322f97958476b48c43d70a95e87

Observation 7866b6a3-ec8c-4d73-a320-37db41aa559c · outbound

This paper cites Geometric Approximation Algorithms.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Geometric Approximation Algorithms

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.627584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.627584Z digest=sha256:36421a5bc431c2246b74a3f889af207e1488ef84d70395306100bb208c8d2467

Observation d4213e00-021a-4cef-9666-0a5443d7a50c · outbound

This paper cites Epsilon-nets and simplex range queries.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Epsilon-nets and simplex range queries

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.631347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.631347Z digest=sha256:885278d2de799f52cf13e46192faa312199294ef8211898a14ce93bce8f71846

Observation 38f09e05-b633-4162-a2f7-16417b46cfc8 · outbound

This paper cites Satisfiability to coverage in presence of fairness, matroid, and global constraints.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Satisfiability to coverage in presence of fairness, matroid, and global constraints

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.634475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.634475Z digest=sha256:fd43fff8aeabc6d912f1067d8f9716566997c93ac81aada00714e21d84a818c9

Observation 2069e966-fde7-4e80-ab24-4c8631eddf47 · outbound

This paper cites Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.637842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.637842Z digest=sha256:f8eb6ecac22c0f731ec674a6127b705920c3c6132be9da9c6f75f05046730774

Observation 9317dd74-71e5-423a-afe2-609873c368e8 · outbound

This paper cites Extremal Combinatorics - With Applications in Computer Science.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Extremal Combinatorics - With Applications in Computer Science

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.641924Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.641924Z digest=sha256:2da072c63db60247f07053e79ab09dda0dd3949d5cf11309cc7501bb405f1635

Observation 561e89e0-3042-49df-b44f-7801f5c9bf0e · outbound

This paper cites Intersection patterns of convex sets.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Intersection patterns of convex sets

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.645163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.645163Z digest=sha256:cbf5a914504a082e22bc169e27b19cda6bfcb677d6b70bb84f0d5fdad0afc6e1

Observation 94861325-77af-46fe-8fb7-aeca82c968a9 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.648666Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.648666Z digest=sha256:82eff2c006c5b0dba5b84251e5ae277d8d9175aa517891a2c424bda9be026fb1

Observation 4da0706d-3d41-4070-8ef6-9a49d46f4ed3 · outbound

This paper cites On the power of unique 2-prover 1-round games.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension On the power of unique 2-prover 1-round games

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.652095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.652095Z digest=sha256:b74177ddb84b407533f0548928fb446b26f99225ea2cf2d1151121833625389a

Observation a6461eda-9522-4f46-902e-701a1bab9346 · outbound

This paper cites Covering many (or few) edges with k vertices in sparse graphs.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Covering many (or few) edges with k vertices in sparse graphs

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.655211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.655211Z digest=sha256:581bdc13a910073059ff961b445698e2797e3d9a658ed334b3d80bc348f83cca

Observation 003a05e7-f78e-40e7-8ae3-0c9f41406060 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.659393Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.659393Z digest=sha256:592f832b9db5f53903630523bd44a7f3a46a05e168b9a86d93d436d56614ddc8

Observation a90b9813-3d49-4323-91b8-c6d324a8c296 · outbound

This paper cites Almost tight bounds for -nets.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Almost tight bounds for -nets

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.662491Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.662491Z digest=sha256:b48c9bb10691474af5c5f9c2486273f86379e2aa4076032c3b075ea17fc5482b

Observation 8e76fdef-0956-44f9-a519-caabf7548182 · outbound

This paper cites Vertex cover might be hard to approximate to within 2-epsilon.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Vertex cover might be hard to approximate to within 2-epsilon

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.666699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.666699Z digest=sha256:37e386c5f3f2e8ff1670c2e3ce04d72ab902e33053384572204504e3e836a0df

Observation e520c912-890a-4e0b-9d64-3c0f02f7cdfa · outbound

This paper cites Constant approximating k-clique is w[1]-hard.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Constant approximating k-clique is w[1]-hard

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.670102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.670102Z digest=sha256:a65037d53b20a724a2cb4284d9d0a4082d13776a286bc42582b11c10fd68dc6d

Observation 716b1a68-07dd-4247-a6a3-f2f903806c93 · outbound

This paper cites Covering things with things.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Covering things with things

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.673554Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.673554Z digest=sha256:e840c6be4ba9ac84d4cf21a915ebdf38792cb1ad0e0a0de9f290459badb0e835

Observation db4f199a-dad9-43bf-b3fb-60f012ba40bf · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.676550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.676550Z digest=sha256:b699f123fdb1b9c52e6fa66b2c35d6a38cde28d09f892ab8e062c1c777aee085

Observation 9dffe8e4-6bac-4f7c-84fc-c552b8ae1a8c · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.680118Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.680118Z digest=sha256:ffbadb89e1a718c6777df51962e52a324b7a36b093ae6b0b14c0585fa3102c7a

Observation 9f1e54b3-d6cb-4e6e-a076-e70907bd3b27 · outbound

This paper cites A note on max k-vertex cover: Faster fpt-as, smaller approximate kernel and improved approximation.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension A note on max k-vertex cover: Faster fpt-as, smaller approximate kernel and improved approximation

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.683172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.683172Z digest=sha256:541cd0fb55605061805452d7703f49891639c3f2487243022dde0fc7109a1660

Observation 44863e5b-fa18-4d8a-9cf0-c2c4b5d9d3ae · outbound

This paper cites Tight running time lower bounds for strong inapproximability of maximum k -coverage, unique set cover and related problems (via t -wise agreement testing theorem).

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Tight running time lower bounds for strong inapproximability of maximum k -coverage, unique set cover and related problems (via t -wise agreement testing theorem)

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.686761Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.686761Z digest=sha256:9918a6c97b249158c71127bdb8bea7f602532842b6431b0a78d65f264a006bcc

Observation ff1c9669-ad1d-40ad-97b9-dea6595a8719 · outbound

This paper cites Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.689701Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.689701Z digest=sha256:86d27e16f4b51d39da4a20303b8e12c131014ceded93fb317673283bbd5b9b8b

Observation dbd34cd5-fb5d-4b3d-8b65-b80209c8ca0f · outbound

This paper cites Parameterized complexity and approximation algorithms.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized complexity and approximation algorithms

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.692787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.692787Z digest=sha256:baf5450d5c1441b0a037dfbfa8815880edd7064ba71e8eb88dae5d7318179ce5

Observation fb75817b-9c2f-4352-ba44-fe041ce18ea1 · outbound

This paper cites Cutting hyperplane arrangements.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Cutting hyperplane arrangements

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.696458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.696458Z digest=sha256:d05507e12a9515349a1febcd8bcbd4326d46c814de12e91f8c980c1dda810dca

Observation cd4bfe4e-811e-43bb-a17a-8f5d7d7d0810 · outbound

This paper cites Nemhauser, Laurence A.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Nemhauser, Laurence A

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.699669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.699669Z digest=sha256:462c410660b3f917800c702176d0a2c7ef2e40d7559a3f7d144c08d16c8a4437

Observation bbfcac21-ed25-48d4-93f1-d6d03face73c · outbound

This paper cites Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.704046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.704046Z digest=sha256:686debc7b1443bfa73e5581fe5171269e098448df962d87ea44dfa45b75fb826

Observation 44b350ea-f31e-41db-9e6f-e61a2d2d613a · outbound

This paper cites On MAX-SAT with cardinality constraint.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension On MAX-SAT with cardinality constraint

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.708116Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.708116Z digest=sha256:27f77e584fd155d00110308492d377fd8edcb9b28cf8821370b3f4262f8c1dc5

Observation 4b211dbe-dc17-4199-b307-f321d8ecf058 · outbound

This paper cites Approximating csps with global cardinality constraints using SDP hierarchies.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Approximating csps with global cardinality constraints using SDP hierarchies

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.711611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.711611Z digest=sha256:18a86f0e6e18c1ffca6d407485029d3e5f74a01e7e7ce97b164e3d66552d25fa

Observation 2bd6f2c0-27bf-4fdd-8338-d134cefcbdf2 · outbound

This paper cites On the density of families of sets.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension On the density of families of sets

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.715375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.715375Z digest=sha256:2f97157980c1d0bf1cf7020552ef913e6510f224576d9fcea5c99cb6f1c69b9a

Observation 43e2c22e-59bd-4a37-9756-dfba1ae973a4 · outbound

This paper cites Combinatorial optimization: polyhedra and efficiency , volume 24.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Combinatorial optimization: polyhedra and efficiency , volume 24

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.719208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.719208Z digest=sha256:23a5ad664b8b488add7388edc3029e9002d5a38539a9207a0e12b438af8aad54

Observation 201b057a-2dd9-4475-88da-860009abaa64 · outbound

This paper cites Parameterized matroid-constrained maximum coverage.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized matroid-constrained maximum coverage

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.722342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.722342Z digest=sha256:fa39655f43c24eb556056811d44064cbe747c2dd12a91bc46331308e08187e2c

Observation 3f327c3a-4df3-4359-9b2a-3a28e479d54f · outbound

This paper cites Chamberlin-courant rule with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT time.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Chamberlin-courant rule with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT time

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.725500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.725500Z digest=sha256:421e036cb5b1016117460dce2cacc3dfc1e65717b9c67399a2fccb2eee441b2e

Observation 7c7f0d94-f986-499c-82ef-e03ec6ce41e1 · outbound

This paper cites A combinatorial problem; stability and order for models and theories in infinitary languages.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension A combinatorial problem; stability and order for models and theories in infinitary languages

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.729740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.729740Z digest=sha256:669ac63fcfab506b69e27a1b23954d153f1dd4b7f84baa12af5bf4f6da30396e

Observation 8cbeb51a-3c81-43a5-a7a0-40f3c6b4d4bd · outbound

This paper cites Improved performance of the greedy algorithm for partial cover.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Improved performance of the greedy algorithm for partial cover

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.732917Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.732917Z digest=sha256:97e328f47a7de21ca0a54cdd0b0767ccfadc4759d62cf480e3de3aa607e9203d

Observation e5d4d139-3f06-47f4-a068-0da18c4e0f8c · outbound

This paper cites Best possible approximation algorithm for MAX SAT with cardinality constraint.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Best possible approximation algorithm for MAX SAT with cardinality constraint

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.735865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.735865Z digest=sha256:e5ef15ce1fac86dc66afdcdd944b18ca9f2d6a76db6caa5b85287955f451b306

Observation 83c4f73a-59e0-44f2-b111-bbb198bb7eef · outbound

This paper cites FPT algorithms for domination in sparse graphs and beyond.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension FPT algorithms for domination in sparse graphs and beyond

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.739224Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.739224Z digest=sha256:d0c2e8d2c677e1157ac54436fc17484f6a118e982685d058f520fca489231b57

Observation bc094673-e166-4d3a-80eb-180ff185392e · outbound

This paper cites Vazirani.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Vazirani

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.742505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.742505Z digest=sha256:3a2084b08068a3d80e4e7cc4f1ce6eec68ca21073ac30263dc841f37ff2fec1e

Observation 918a0840-ff62-4149-b70b-e498f2dddf57 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.745624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.745624Z digest=sha256:a93047b6f76ad2b78e325a4d8bbe46a27212cbd1c2b2ca463fee674049123e20

Observation 8e74199a-3989-46e0-a069-05d53bf1d1a9 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.749120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.749120Z digest=sha256:98b298a59df385f725ab38ba6f15bfb42a909733d8d047e30b6c4313a124fabf

Observation 82deead9-9cdb-460d-af7a-35f0ca3d8767 · outbound

This paper cites Hochbaum , title =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Hochbaum , title =

Reference 68

Resolution
metadata mismatch
raw_fallback, observed 2026-08-05T12:26:57.600197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.752525Z digest=sha256:8d84588580818019db32ea88835609b1a03670f977bddad3fd798c67f2d7c8b6

Observation 49bbcab8-5ef2-4e74-9a3a-9d10e47bf68d · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.755575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.755575Z digest=sha256:6bae394d1b7aa3692c68cf58fdbf1901399c3c1065aad84fdccd543bda6d2658

Observation b4062259-272d-4cb3-96b1-864331e782b4 · outbound

This paper cites Wolsey , title =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Wolsey , title =

Reference 70

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.483330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.758655Z digest=sha256:62c9a02e205ff547e039e9330f4e8b3b2c2d8d2e60c987f9b8ae39ad139c6d8c

Observation ed3175b6-f1bd-49b3-8f0b-f11bb273a67f · outbound

This paper cites Improved Performance of the Greedy Algorithm for Partial Cover , journal =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Improved Performance of the Greedy Algorithm for Partial Cover , journal =

Reference 71

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.473068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.761643Z digest=sha256:3ad49a91f5004f1c6e585429913025c4280f2053a2d1ab10b6a5e192d77c4532

Observation c3066ee7-3c8b-4859-a758-ce611c177b74 · outbound

This paper cites 2018 , url =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension 2018 , url =

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.765392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.765392Z digest=sha256:415e192767dde8a960cc3b13d3e65bddb890bd768caa2dfed6103a294cd92ca3

Observation 244832e7-3618-483e-acfa-7c37b7d5703b · outbound

This paper cites Analytical Approach to Parallel Repetition.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Analytical Approach to Parallel Repetition

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.770095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.770095Z digest=sha256:b5fdd50d24e1fce70344d0d14e749855fce263a95047d397ab26c53826e69380

Observation 73a53735-2ded-464f-a4b4-b7965f567c86 · outbound

This paper cites 50th Annual.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension 50th Annual

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.773123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.773123Z digest=sha256:e3e8df4e94b1136de8f2876addc0df234dbac01083396141c639712da852b5aa

Observation bbe98c2d-5bc2-45c6-bcc1-7d3f25a1924c · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 75

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.450573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.777625Z digest=sha256:c7265cf234035d49edfdd550103702557695249c973e2249b6b717ee894bf66e

Observation 18b7c5f0-47fa-4a34-8778-83cc30f7c4e2 · outbound

This paper cites A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , booktitle =

Reference 76

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.781854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.781854Z digest=sha256:0bbe78ba3083c753ac85e5db26167260a6f5914512ad6e373af237b0547f9de9

Observation 3fb2e430-3416-4c80-913c-836ce372dca0 · outbound

This paper cites Hochbaum , title =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Hochbaum , title =

Reference 77

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.785429Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.785429Z digest=sha256:4ea3aae9798a55d514180e12c294014d78952377643773b03438d6887259042a

Observation eaebcdae-6514-4620-bcab-f6415829c0b5 · outbound

This paper cites A parameterized view on matroid optimization problems , journal =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension A parameterized view on matroid optimization problems , journal =

Reference 78

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.432025Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.789234Z digest=sha256:2e3e512ba6a565c914785ad3c77865c71952aa93174bb2e4f1d88a3c72e91c27

Observation 6677254e-423d-4d7d-8783-99eec3633442 · outbound

This paper cites Hitting Set for Hypergraphs of Low VC-dimension , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Hitting Set for Hypergraphs of Low VC-dimension , booktitle =

Reference 79

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.421806Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.792969Z digest=sha256:3991da2c0ddc863b8c69f34d0bfa8c618d30e5d257e0c14ea922dd805b3eed9f

Observation d04a49b7-2673-46e0-b8c4-40e5f5e4f96f · outbound

This paper cites Approximating low-dimensional coverage problems , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Approximating low-dimensional coverage problems , booktitle =

Reference 80

Resolution
metadata mismatch
raw_fallback, observed 2026-08-05T12:26:57.527733Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.796305Z digest=sha256:9ecf0e668ecb58a4bd01b184283da8b0d3a0de25a5df7467ff8999b0117a7341

Observation 2de002ca-949d-428d-918b-7b5198728321 · outbound

This paper cites Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence,.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence,

Reference 81

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.411397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.799753Z digest=sha256:8aded48034b739e23d9455883ae44edb1dcf07597e88258f3dd59fad13493faf

Observation 749b17db-6179-4771-8148-c3385bcfaabc · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 82

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.802930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.802930Z digest=sha256:2d26a200dcd794133fc0ccf89c1bd50a8b9e70c276b0d475ac861f6816b144e0

Observation 37711b1e-f333-4ca5-a311-39fd852741f4 · outbound

This paper cites Parameterized Matroid-Constrained Maximum Coverage , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Parameterized Matroid-Constrained Maximum Coverage , booktitle =

Reference 83

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.400200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.806359Z digest=sha256:2eb684bf6cc6129675acbdf8ccb38ac8a425fdbfdf1fc97de3f96221d5bc4c2e

Observation 6359e191-e7ec-4e1a-a7a2-db59ae595118 · outbound

This paper cites Progressive Algorithms for Domination and Independence.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Progressive Algorithms for Domination and Independence

Reference 84

Resolution
verified exact
local_arxiv, observed 2026-08-05T12:26:57.614648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.810039Z digest=sha256:9b876817e9d369c5f3d20d7e031dbdcf0646e50ad3f28d04b4a4ca68297dffc4

Observation 2dcb6be6-5e7d-4fe6-bbea-999c9aa5466f · outbound

This paper cites 2011 , isbn =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension 2011 , isbn =

Reference 85

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.749068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.812901Z digest=sha256:6e3b3439726158b24eae1ff15d176655fe5308a01fe1bd97a20a2f77e00b2fff

Observation 44c76a29-d2db-4f62-a80e-aa61b166ef40 · outbound

This paper cites Product Range Spaces, Sensitive Sampling, and Derandomization , journal =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Product Range Spaces, Sensitive Sampling, and Derandomization , journal =

Reference 86

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.816500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.816500Z digest=sha256:829aa72542709e58f4189680f5ff95cf83760bbb61486e04338020f1b4c9e388

Observation 13e0b092-93b6-4e11-b576-57e1e4f4397a · outbound

This paper cites Discrete & Computational Geometry , volume=.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Discrete & Computational Geometry , volume=

Reference 87

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.738602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.820014Z digest=sha256:ff43d293e6e1e410b5a9f41253ff56f6d2a22f7b1b2447d65a921e8e92a0273a

Observation e03b6acc-6e75-4d45-bbba-3589e8f8ea14 · outbound

This paper cites Warmuth , editor =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Warmuth , editor =

Reference 88

Resolution
verified exact
raw_fallback, observed 2026-08-05T12:26:57.447273Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.822924Z digest=sha256:2576e9af31b122a9bac5f8138eb4c22409fb3ae4d4f6c9cfeaacde707169b34d

Observation 20123256-288d-4147-905c-b5df94952482 · outbound

This paper cites Cutting Hyperplane Arrangements , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Cutting Hyperplane Arrangements , booktitle =

Reference 89

Resolution
verified exact
raw_fallback, observed 2026-08-05T12:26:57.369964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.826373Z digest=sha256:34382421e4463c6c4bf92bc3a74abab4feb734714a40fbece5d351b261c7d431

Observation 12680723-e16e-4350-9a4a-15019e1db357 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 90

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.830246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.830246Z digest=sha256:485dd39720ffe9c0492b22352b2554e4c3537c17492a08c205381788037fe980

Observation 69e7dcff-eb27-49b1-955c-4b8f34c5c5f9 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 91

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.834260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.834260Z digest=sha256:1c1782147a51be4d9ae3c53d0ed98c27cf86f5b5c6b1e2877ae1b9026a5bcc59

Observation 52945c4b-f33a-41f8-80df-0852a56c06cd · outbound

This paper cites Pacific Journal of Mathematics , volume =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Pacific Journal of Mathematics , volume =

Reference 92

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.719829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.838031Z digest=sha256:dd0a226c2b8f01775b76e4e383046d282fa5f0d22a1eeca51fd0bbc713af73e5

Observation 0a897190-3cb8-4c67-8e80-2b4569b2a594 · outbound

This paper cites Almost Optimal Set Covers in Finite VC-Dimension , journal =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Almost Optimal Set Covers in Finite VC-Dimension , journal =

Reference 93

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.378948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.841521Z digest=sha256:ac5ca20345df9f4e68bc91fd12a93b706e50438745754de65f1400eb3074314d

Observation b8bf6d54-f9b5-4d0b-9a4b-43e2a6475def · outbound

This paper cites Epsilon-Nets and Simplex Range Queries , booktitle =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Epsilon-Nets and Simplex Range Queries , booktitle =

Reference 94

Resolution
verified exact
raw_fallback, observed 2026-08-05T12:26:57.299191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.844794Z digest=sha256:1764098bcaad0bfa94172c8c5d1b609d81115f24b9b4255315e3302eebbf2481

Observation 76c9e8ca-d5a6-4324-931c-52cd5017880d · outbound

This paper cites , volume =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension , volume =

Reference 95

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.708826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.847990Z digest=sha256:ef084fa569925a313eb8c5a9bb55846d3a54ab317c3d12cd525c193cfe6413ee

Observation a9334447-225e-4df0-a08a-90da484a1c54 · outbound

This paper cites , volume =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension , volume =

Reference 96

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.696772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.851172Z digest=sha256:74a82735790eeeb4edac708e683be3897a849a00a2c8a00ed6c6cf62b1d610ee

Observation b0507814-77a4-4fb8-9823-d175c561d593 · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 97

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.854678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.854678Z digest=sha256:7c501b7ebc92efcbd70360abc7e7c9d70a8fbbec4ed951970df244f91614fff1

Observation 705a4923-484a-4910-a08b-f67d24166fc8 · outbound

This paper cites 2025 , url =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension 2025 , url =

Reference 98

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.685923Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.858348Z digest=sha256:195ac8c37b18d164da0bdc746248292bb6a96a66a927a0d771de3ecfff68e1e4

Observation b0ac528f-c33f-4502-ae39-37f40a2e82ee · outbound

This paper cites Colloquium Mathematicum , volume=.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Colloquium Mathematicum , volume=

Reference 99

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T12:26:57.676122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.861714Z digest=sha256:fff6ef9c231f00ed69bd205ce2cdc36dde7171469aa9877c6854e332cc3cf66f

Observation 9271e6f3-8dfb-4b6c-9898-9264aad40b26 · outbound

This paper cites 2019 , url =.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension 2019 , url =

Reference 100

Resolution
verified exact
doi, observed 2026-08-05T12:26:56.368669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.865345Z digest=sha256:591d9a128e62067dd36403ab9fcdc2a601e9255ef2773dc3ea2ee2a2c0f9d670

Observation 3af14cb3-30b9-4287-b78d-eacfe96b11af · outbound

This paper cites Complete Dictionary Learning via $\ell_p$-norm Maximization.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Complete Dictionary Learning via $\ell_p$-norm Maximization

Reference 101

Resolution
metadata mismatch
local_arxiv, observed 2026-08-05T12:26:57.158199Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.870057Z digest=sha256:127f8f469ffd40c636aa743d60cf14413759e56f78d4aed4c1c9357fd66b1a6e

Observation 09fc0a47-7271-4d8b-b6e2-ff52a73adb8a · outbound

This paper cites an unresolved cited work.

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Unresolved cited work

Reference 102

Resolution
unresolved
no resolver link, observed 2026-08-05T12:26:55.873722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T12:26:55.873722Z digest=sha256:66281dcdb2f8968092e576386a14e983a00f5153fe39b4ba7ff28a06c3d90bc0

Pith citing papers

No inbound Pith citation observations are available.