Pith. sign in

Paper Citation Record · LEDGER

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

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

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

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:42c642404b8b8e3ee5c31bf50aa0b64a86e2134936d9e34bdb310e4d47228ff6

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:e8590a2a6601e32e83547e5b70813d5e1bd5ccf7f64014712f0b1501e05319a0

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:d760182a3008ddb847c1ee5849a37f2ea50eb378a1adddbbac7fe27dee5ebe83

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:8c30640fb16436cb7afc69b0846ad700a914c52d2bf1b0cda5e441df2f2644c8

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:2cbfee8f4bbbfb285dbe2842736fbc49f07f8fcfd2c16a7bcf3c5c26c5091627

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:7655796d70cbe6b4fde7ec99ad022c55ecf7d71ffc8953c065179655c8b4318f

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:80cc95e9fb63dcaeecae77487d2f7b66de91d42a726b977a7eda1dd9fcc4f2f4

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:96b932d2fcf96babf149e9146f49816758ecc832840cde9cf42ab8f8a065afa2

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:99327cd18d9c60c0373de463722db5cfcbae0ff5edbc97e95071eb658fc0053f

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:7879400c4c624f3d64c25eb16d8f76a682ffdd9d46a0304fbca56d6c0e47a256

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:cc181736a453948ce89d12b561306ae4d6de4437da3f19bbf658e65172fc9c74

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:89a28cf2ec892191c1a8ffe7b1490729e7d84a834c22ea061980b8d177e63a04

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:28d856acd9a3bf9a32299679f570008ffe96ee34f8c6812f45a3a3e19c3ab9f9

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:afb6f3b02e0b4c8f17a861a900e56784527adc1ea6afd28df97ecaaf627d9258

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:0c252161e0b70b26eabcea3afb2465c9aba80f9128c5605ce2c656933c8d8c9e

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:78a8264833322aa925359fb4b254d1f78beb2c7c345e3bed366bd41055a90c14

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:af440b439e4d569c57068535b3bb8f9431a67d78f4178ed9ba65f761ca646c83

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:ef8b5b51a41d620e75b7287351bd67056b5026130e521feda45f8b7b5a1825c6

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:8eae8534d5d201ee8ddfafe9300601d76a183c23c0120d6ebe71921884795e83

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:b14963e3f4b575623de7c8308b8c32b631e2a572a973a6dd6da8a2ea61514706

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:799b65df186f14c8e709e06005b0099c9cab66e57c5899729c669bcf2aa20351

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:07cc82a9860cbaaf2abae2d1fcc659d968d1a574b9744d91b530c5e6e4737870

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:d7a1fcba8614d0a07c0cd9a6f29ac91988e585c2c9ef1e75db06216957792f57

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:81e8b4d390010e0072b0cedd887e582fd58ebac5512a2d16a167fd67b1015124

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:ec89b0cacc575f512903083ccd152e846a358ec9a21625c253912ac4e9edfc15

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:c2ba9a2a0240cda21abcc8ed61737a1295f622c4b8dc80e31b5d504ff302e89a

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:7027710adfe0d82b32af8490ff64cdfa6438eb8658de9d2088d235d5f9a49916

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:c4ff7a4672729d39e1d81a480779c4848e6d904b42732901f3beb17a321e807d

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:3f339ffc0f71d1c2a60a253457d55b997a9da1e6d496c40d7d18aea8c360ef11

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:30451af64ecadee60d03c698f876f5357886bc65126178bc2a69df6bf64d4d38

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:ffa274b5b72e3d65010ea96fd061ea0e872d0cc439a5534d328892ca85608929

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:f35769ad59e92258aba13c8c47d16d04cfc56889bf037ff19ccb883adeb6e244

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:0207ad81850a1bde38e5efbb3ce1d2904e49f27c78296248f65ebd7c0feec3f9

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:b15ad36d1c03a15ef83c5753c3ac9a73f681b69b33506e3b397e53aa6716ac88

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:f99a733a3c48cc956cc217781fc49c33dded76d50cffcf21f0a1f2438c144d87

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:2e4f930d625aba6f2ce8ca1494f6c1474f5bbab4be1d0d1d01da285a4ad8625c

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:5d5873ee8fc16c5f008ad3daa77a228aecb3ff5e028b67e50a070737f7546b72

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:911d9f6be898910e6404cc473a407313a364a7cb2df0e5e77cfd4239bc5b536c

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:a31e55b9c612ccee1bda05dccab857773eb3c3651f294f32cdc13ab436f5d28c

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:33bec43c946f41c67fa5caefcbea7f82c1bf11c975a169c45c98bb81e846d194

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:53cd528a12646ba8211476ed9f2b8b6381ba5b5ee5858ff722f389d2cd84ca89

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:09ab4b10d0b6a2a6d2beaec154cbfb211224b9cfecc773910552bb0f90d3c3ec

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:3b25650ef7e6f84ae4a180045370d46c9a241d7207bd8fa815c895e0de5ea9e0

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:551cbcfc308dd6638a654e92112dd3a9e8521141f399cdc9e5d663d69e74dff1

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:b96a2a628a40adad101ab565e2b8e4480ea6b6e87c0536032d688e6e1b3aa2ef

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:cb73ba523b33b124cd46144ffc388c36a23c82461d18364b6872d2a7c428253e

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:b4ef7796415b87d4a256b210c0b7411c7facbe4283cca215ed9ff269f4b6a4cc

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:1fb23eacf7ae4a8d793b9f7260596fcaa3d9c83bb7fbc091f54ab9915d3440e6

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:d2318b13cde9fc8eccfa5f9e821879448c1cb7fbf132febc5c714e0b1b00147d

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:ca502c515b45007dd0eada9216e4dd4f46981476971aa514df8a087f2ea0a316

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:5f043490e068b466f0a085fcd67c7542e8d00f777717f2157334cc8930d1d861

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:f24c9cab376f1eababe8c1158a995ddf2a5b2628aa7f0ce48f4520ec92663a44

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:0d823282adf7fdff65fe978dc5d50d56e7df47e87ac838c8d72a3749c3ea5586

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:5eca41639122204ca9605e267788e0731a784c8db26f3fb6b2fe42569e4bfd8e

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:87ee0a22f94fd8d249c49e5f379cac5fb5c4104d17f14c2631dcd8d3d639d579

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:6fb1ae5e16cb47036972d463481f496888286b2d8397f4110d8570f22f04bfe1

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:91a145accce8e4854e904a4fc4e8b8fc486bee70ecc38a19d3e7d46ac0e74ab2

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:6b5d6158b594f5108a710ee73febbf42a017e86adf72db7f65e0698a3f80149e

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:a05942498e41dc4ac5f2c98817653d146a83cc441213eda716ccbad9dd59c8f9

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:ee509bb1c374f90cee2de467b038d588f8b645c9d182425e3e75a83f52784211

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:fced8a38b8b0d984642bcdd6d095727d57022cd1c72fbd2b8057db784d8ce22b

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:9fd2f97bd505ca25d0c115188da658133d69b640bb072dd523ea788d155a444f

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:5095a87938b6c89eef3f1768e3c29eaa698f934bf6c93bf30437fe8e7a197968

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:2cb857abfa3b5cd0aabd4cd6bd38603b40f21e24f92f8d10a2a2ccaae3981214

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:28008dbeab40da691f3055d28604457f09d412c32fd521d73f2786164cf8313f

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

source=arxiv_source observed=2026-08-05T12:26:55.752525Z digest=sha256:4813c2b4990930c1821259071c36522004dd1842dada18a338e3d499a5304453

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:1f34f33e8421c8e079ca132a2f40c4232e2bf58abdb8bf7a80860d21b6b43a71

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.761643Z digest=sha256:177c5b97269a1b19865081520887513992f1cc6750482c729b8384e2bc7d79ca

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:a63c4ef37489cc5d0c55277c1e7fe284d9f18c052e1a87ddb95bcce56aa52341

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:4643e975c62d2062aa2db6470a03db55d3a2fb834cdb5cc00ce7245098fafaa4

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:633bd1066bd72f61901920d6d303426328e4dd0d1d0e55b344d7696e535e9a2c

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

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

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:c030ef5cfdbf5535e50ef3dfeafb6c15f3e33ba01bb03bb318ceb1356be1f157

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:2859ca7048503e6c388d704e6505fa2a35caf18678e96e046cdcb38598da7422

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

source=arxiv_source observed=2026-08-05T12:26:55.789234Z digest=sha256:84e47e9c11f45890bb1a903db30bf9d3814ee630762a38197fdf169f672403bf

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.796305Z digest=sha256:1325d7ff58821936d141ebfafaefdad435164922b69eebe9c1adf8979681aaad

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

source=arxiv_source observed=2026-08-05T12:26:55.799753Z digest=sha256:70d49b92395f3654158089c9970197f564106d7e78880f6c24e2ef5c5d97ac73

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:31d7cd80c8eeb405b651cbcd2c2bda9edcbbf2f16859c80cb14ca355b77e77ee

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.810039Z digest=sha256:62733126694352f28ee64232cd922bf05dfde7112a7b903f5f397728b5981526

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

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

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:f4fd5d8b8192b1ee65c1ea5225dea7459c4e3de595b7b04242b0006a73d98918

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.822924Z digest=sha256:439fde541750c828b3cbd1c9039cf0055dcebce8fc2328d9bf8e0cc0ecc74a77

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

source=arxiv_source observed=2026-08-05T12:26:55.826373Z digest=sha256:8a46d063e53b7eb88d9a192646be89b00496bca4e3f1975d249c97ba36069bc6

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:df70b5b2d29345e660ab4ee2dc7ae911441708cfb072db6b65136798f26cbdce

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:51cd88e159290417a0c52b69deecb1dfbfed3afddcfa869cd855f2d6fb1085b5

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

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

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.844794Z digest=sha256:3d21c173f51e1c717449b01e776db32cb57e58d91e8725f14da751b6f337ba4f

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.851172Z digest=sha256:240e012922a6641e1fffa08670ba5a57d54643c28c743dff037bd5476494c5ed

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:0a9a508b778e551bdea8c1e37011c49e8ac3979cce8e9830c3e7e84eb52739fa

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

source=arxiv_source observed=2026-08-05T12:26:55.858348Z digest=sha256:57e4ac8f4b1f30b109d10170830a1d811d9b0bd6236493c09eb06d611105bebc

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

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

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

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

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

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

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:a3b928327393909ec5639596f66effb398a51de86b93118845ec1853e94d39d0

Pith citing papers

No inbound Pith citation observations are available.