Pith. sign in

Paper Citation Record · LEDGER

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

As of 10 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-09T06:31:02.800959+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:662a8ec988a42e538a9ee3a0f9babc70390a2f16ccdee7ebb466ba4e289087de

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

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

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:5654f5ed5e8ca8d1b7ba35ddd1a95721a2a922b893423c3abaab067540c1260c

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

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

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:083a6cf822886bf5e7496535959196cd530703768515413286ed04ba072c1d3d

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

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:177c0a2b3c35854526db733a47d378c77df676aa3c636bec0f5c922d9817a8d1

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:26eb6d2d807c59a4d29d0aa61b2afd0d817297357ebde71659417a0ec30f57b3

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

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:05fe2c30f41b6a5d6ce9f6ccc9a2866e82f572ee0c0fe699df5914245a91c207

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

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:35b1eb0ff56e8c55adab70b5882e61e68ac85e37faab19b2e0a7997420627fe8

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

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

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

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

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:1202216bee93c1977bdda4acfb4be95517bd02c045da005c5490fe75976c2b14

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:76afd3af893e68945ad18c913ea713a77058fb200bf605224d320b07766be598

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

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

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

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

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

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

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

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

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:54634fbee64d80276d6534f58f16ff11bce5703639f154d8abd6e80f064762e8

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

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:175e06be0b582f8ead3267c0b2b1c320e4909f438fd055f97a0f2d72a31f35d4

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

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:23b3951c15b80c71efdcc0307eb244cc0c6857b6dbfdddaf4fb7e3f49de39484

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

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:198b48a0eae7d941d59a538425cb8b4d956a6864ef33ba5f75cc79a8b4000ea1

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:993c30ac1c43835efce9f248c4db0a8138029f2b99006a7e83b49b119ac90d81

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

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

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

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

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

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:91252b354a6834f4bcd5d2135fba7b55a79856375b560023945a667552e26425

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:90013d50c438dd84bfd0db6da2e491b4fedc61a9ce96d2853adaf742c5fc703f

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:863b9de47b0cd41e39401a45b832ae5a2ca0555a64b326424bd1c642d1327623

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

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

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

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

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

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

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

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:10114f2124fa1beffc3097290b91be6ef3f1c2677469ce720c2bbaffd81d2bb1

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:8403a0209f84e00f0690bdd193b93c15bd58e0bd8e46b3e16b31ae632e99aaab

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

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

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

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:1270d5f354d3c83ec423c12f04606777e46b81783021124661f4bfcafad42dd6

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:865f245456f9ba3d6a3430a43a36646c8e354179791dcf33a71aee7a7552708e

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

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

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

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:703de14cc8f8e0a3f6dd9e60ed98a9cd32a73641332b451865b67bafaa7af061

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:99ee22785d8736bd86bef622692fe89fe5700514513d5c3f66faddf67253817c

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

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:77028f9985e462b6da809fef96e094a085204d07b562a4b842ef48d91bb348ab

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-09T06:31:02.800959+00:00.

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

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:557043dd89db9e1b457cf06fb13685ec3d06f9cd1bac492976e3cacf5f60b0d7

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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

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:60e0d8f35f2d1dbdbcf3395736a7903c1ba54aa08d985cd1b6e2801180cde5db

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

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-09T06:31:02.800959+00:00.

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

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

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:37153234516a8e8fa449c1c03f6e1cca4b1f4c74fb27b1121593f34e0cbace50

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.799753Z digest=sha256:6d441202b42cc92c1eb68e9cf89cbb45f94040e9235f973a2be672ec71a6f1b6

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:46ac5d03de3ae608c31e997d2928d0dce829c2cc58858af9dc341caeb9e7f40c

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-05T12:26:55.810039Z digest=sha256:5c3c2d394647bfcef27a1759a2526fc4e760d9a3a1f49fc7853fc002d1316c30

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-09T06:31:02.800959+00:00.

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

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:99f29a0ad9995a78f2b11ecb386cb1528f6a59559e18a6038fc42e6694430bc7

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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:89882f41be8c6c2601424509b9ee48dd69090c74a1a4139454d1fc5d2fc4f967

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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

Pith citing papers

No inbound Pith citation observations are available.