Pith. sign in

Paper Citation Record · LEDGER

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

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

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

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

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

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

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

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

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

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:19e15f45c98dfaca34c3d7f90661a0b6435a289a9f6c1c153b792ebe1da5b313

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:47d237163f072bc4743443264da13f7f87c8b3cf09e58f5257c333b1028ca9f0

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:88960648bf2ad79201f1a00554aae4a5442d91c99976ca07cfd5fa5d4067554b

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:14542f579bd739af8ac0428e09a8cbc53ae59ddb31ed6f1a229d311398a2dff0

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

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

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:4778bab0205dd54f3ab0add76b40111705c8dc31e81213475e849c2201748553

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

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

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

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:078173a258ad05830942ec31152888549cd7d798c58de33f781292a0ba4fc785

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

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

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

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

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

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

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

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:570db0694019af60d31110ca16a67ea38db05239f0242eda10cd3d8acd5eab7e

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

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

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

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:62746781f4ca1878ee258c7903727627ee346ba2e1ae36ab2ac10deec5d129c9

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

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

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:4cd4bd0cdd9380f1210f68f83bb5e950decd02633191148b28d91f4242d119dc

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

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:92d4b644ca8b42d0d6260c354ac4097fd453b45eeeec8c8975d26063ab4cc98c

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

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:72b374296f2937fce80421cc17f7136b21ea6419da57b470e5f0812e71d0a40f

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

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

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

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

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:54a06debaaa89be766dd16e387398c6ca4795c013c29cb2201389c95637fc6fd

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:0859d419a53163e584bd34efe319b844c8b3b93d231410546309739d938c9ad4

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

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:44e541f7580ba2e4926a6014b0b4b0e6099af8997a497ba70733e9dcdf57056f

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

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:88d7f5f7abf749b5546767d709f3895bf9f7d3bbc940d2e5f5f464d33efb1d92

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:69aaf6968f5ac0e3ecb66b684cc199f2369e7e49a58b20992ec1f9a946663faa

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

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

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:08d1927b34aabc09fd07756e123577ccebdb2fdcad8bcc0f49f71f2f6a55e6a7

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:4e1ff1fba37120656028220a82efe2580cc2bad701ecfb415f2aa2486a0c30fe

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:329ee175a059e6533238f6dfef1cda86f71fccdf873c48dd4f4e70d3b0695ab8

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:721cc5133211a541600344de7987c2ee608990ba81cd34a2096fa217946f2b51

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

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

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

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

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:184d55e84a8cd8d7803efb81efa400108fe0bdbf5cfbea7f0f66ae932a5ad1cc

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

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

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

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:596c30d0575671c33be30c5461ee1c737b7e7f184045a058a75c731e1b97a6e6

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

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:2426046998350513753c4e9893783190e79f07920120b628c7c7be4a8efa8b99

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.761643Z digest=sha256:184a3c4d136d8a51e07c2da2e9fd3f944a2cb4f2d89f91313fbc7acffb12fd32

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

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

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

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

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

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

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

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.799753Z digest=sha256:2f9b89c3b474638a1ff99f37f94259ebaee681542f7b6446c01d53ff0d4da8d2

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

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

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

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

source=arxiv_source observed=2026-08-05T12:26:55.810039Z digest=sha256:037de087f6d90409e4d571ee737773d5b9231babbf7e82020b4026b8ccb9ca16

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

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

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

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

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

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

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

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

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

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:01bf6a21fa68336b7297dbfd87e154ebc12e73d459452aeab262e32eb06eac71

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:7136907a30477a2213bd91614b84e1ff8e760b61601956d70f5a85e9499437d1

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

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

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

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

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

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

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

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

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

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

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:6706ed478aedf55ab4304f8177ed820696720ab0276a668340d01b858582b23d

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

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

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

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

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

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

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

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

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

Pith citing papers

No inbound Pith citation observations are available.