{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EXUQSZIDAZOKSXWW4XEIXAXJHZ","short_pith_number":"pith:EXUQSZID","canonical_record":{"source":{"id":"2608.03801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T15:15:02Z","cross_cats_sorted":[],"title_canon_sha256":"75aed513d457984037fb8d9b6dee8583d478c6172d4feb59084b2bd18f157448","abstract_canon_sha256":"95c675de5721609aebba7b50c7bc9df56a8396ee50d177ec8d91e90dbe96a897"},"schema_version":"1.0"},"canonical_sha256":"25e9096503065ca95ed6e5c88b82e93e4c3079955bf0cd5f37b44d613f4cd82b","source":{"kind":"arxiv","id":"2608.03801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03801","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03801v1","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03801","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"EXUQSZIDAZOK","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"EXUQSZIDAZOKSXWW","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"EXUQSZID","created_at":"2026-08-05T01:37:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EXUQSZIDAZOKSXWW4XEIXAXJHZ","target":"record","payload":{"canonical_record":{"source":{"id":"2608.03801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T15:15:02Z","cross_cats_sorted":[],"title_canon_sha256":"75aed513d457984037fb8d9b6dee8583d478c6172d4feb59084b2bd18f157448","abstract_canon_sha256":"95c675de5721609aebba7b50c7bc9df56a8396ee50d177ec8d91e90dbe96a897"},"schema_version":"1.0"},"canonical_sha256":"25e9096503065ca95ed6e5c88b82e93e4c3079955bf0cd5f37b44d613f4cd82b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:37:08.983777Z","signature_b64":"tSsnvJUh0KY4s2vtchY8Nbqb/smXqHvWwtuA3atT53UEqZzX1wUjkaAUjyx8qHWH1yRVd6sisxYIQ1Qk80DCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e9096503065ca95ed6e5c88b82e93e4c3079955bf0cd5f37b44d613f4cd82b","last_reissued_at":"2026-08-05T01:37:08.982153Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:37:08.982153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.03801","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T01:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxlJ0lcwu9QMBWboaaWFwdyTv4BRdRgMVTJaizWO0Fgy7d6FLBe29dKtO4VV2yms5BD1E+LvlgQ6+RUROTxhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:01:18.293247Z"},"content_sha256":"4ce33fca438e3746b6a2f66f716991a417ad6349d91121b1e503137eedde8387","schema_version":"1.0","event_id":"sha256:4ce33fca438e3746b6a2f66f716991a417ad6349d91121b1e503137eedde8387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EXUQSZIDAZOKSXWW4XEIXAXJHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anannya Upasana, Madhumita Kundu, Saket Saurabh, Souvik Saha","submitted_at":"2026-08-04T15:15:02Z","abstract_excerpt":"Maximum Coverage and Partial Set Cover are fundamental parameterized covering problems. The former fixes a budget $k$ and maximizes coverage; the latter meets a target with as few sets as possible. Badanidiyuru, Kleinberg, and Lee (SoCG 2012) give an EPAS for the former on bounded-VC set systems, while Jain et al. (SODA 2023) show that on $K_{d,d}$-free incidence graphs, $k+1$ sets suffice whenever $k$ sets meet the target. We ask whether this guarantee extends to all bounded-VC set systems.\n  Our first result is negative. Unless FPT = W[1], Partial Set Cover admits no parameterized $(2-\\delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03801","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.03801/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T01:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42aXt+kR8D1Vu11/P5vY1sscH5gF3W6E7J4yfGJz9iGanrUQcaIqEtrz3MitU4I2iGOfg1CSEB4EPWMd7PVKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:01:18.294050Z"},"content_sha256":"99eb433750bd100759173460450ec778be3069475188000988db36a8836acd71","schema_version":"1.0","event_id":"sha256:99eb433750bd100759173460450ec778be3069475188000988db36a8836acd71"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EXUQSZIDAZOKSXWW4XEIXAXJHZ","target":"integrity","payload":{"note":"Identifier '10.1007/978-3-540-39658-1' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Thomas Hofmeister , editor =. An Approximation Algorithm for. Algorithms -. 2003 , url =. doi:10.1007/978-3-540-39658-1\\_29 , timestamp =","arxiv_id":"2608.03801","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-540-39658-1","arxiv_id":null,"ref_index":111,"raw_excerpt":"Thomas Hofmeister , editor =. An Approximation Algorithm for. Algorithms -. 2003 , url =. doi:10.1007/978-3-540-39658-1\\_29 , timestamp =","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":111,"audited_at":"2026-08-05T12:28:07.288156Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-39658-1","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"628134eedcd62b35fe034900193d82c79132641e67b95021a238809a66521636","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18072,"payload_sha256":"3c24c2e388aafd0f34b652e47a7b6f6e867b62da062824ab89204fdb838f0f87","signature_b64":"u0NaMbXveH5KrLRWbkN/OoDISBWC+rU46O13j1sR1TP1MHhD2/B4LoN/+IlSc1ZLypuD6lUYHumkhYImnT+4CA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T12:28:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"242XISLtAy6IOHq5UUqQj3xS3CmZHHnjzvNzgjgzfq0XgTtU0AnDRTyVFFOByDA7BgxxddHCSvXYBxYm8DiWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:01:18.299076Z"},"content_sha256":"1b815d704865007c7a881c485aa8ad70b1a60a5871c6a937c58385b021dd22a7","schema_version":"1.0","event_id":"sha256:1b815d704865007c7a881c485aa8ad70b1a60a5871c6a937c58385b021dd22a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/bundle.json","state_url":"https://pith.science/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T01:01:18Z","links":{"resolver":"https://pith.science/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ","bundle":"https://pith.science/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/bundle.json","state":"https://pith.science/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXUQSZIDAZOKSXWW4XEIXAXJHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EXUQSZIDAZOKSXWW4XEIXAXJHZ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"95c675de5721609aebba7b50c7bc9df56a8396ee50d177ec8d91e90dbe96a897","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T15:15:02Z","title_canon_sha256":"75aed513d457984037fb8d9b6dee8583d478c6172d4feb59084b2bd18f157448"},"schema_version":"1.0","source":{"id":"2608.03801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03801","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03801v1","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03801","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"EXUQSZIDAZOK","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"EXUQSZIDAZOKSXWW","created_at":"2026-08-05T01:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"EXUQSZID","created_at":"2026-08-05T01:37:08Z"}],"graph_snapshots":[{"event_id":"sha256:99eb433750bd100759173460450ec778be3069475188000988db36a8836acd71","target":"graph","created_at":"2026-08-05T01:37:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.03801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maximum Coverage and Partial Set Cover are fundamental parameterized covering problems. The former fixes a budget $k$ and maximizes coverage; the latter meets a target with as few sets as possible. Badanidiyuru, Kleinberg, and Lee (SoCG 2012) give an EPAS for the former on bounded-VC set systems, while Jain et al. (SODA 2023) show that on $K_{d,d}$-free incidence graphs, $k+1$ sets suffice whenever $k$ sets meet the target. We ask whether this guarantee extends to all bounded-VC set systems.\n  Our first result is negative. Unless FPT = W[1], Partial Set Cover admits no parameterized $(2-\\delta","authors_text":"Anannya Upasana, Madhumita Kundu, Saket Saurabh, Souvik Saha","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T15:15:02Z","title":"Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03801","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ce33fca438e3746b6a2f66f716991a417ad6349d91121b1e503137eedde8387","target":"record","created_at":"2026-08-05T01:37:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"95c675de5721609aebba7b50c7bc9df56a8396ee50d177ec8d91e90dbe96a897","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T15:15:02Z","title_canon_sha256":"75aed513d457984037fb8d9b6dee8583d478c6172d4feb59084b2bd18f157448"},"schema_version":"1.0","source":{"id":"2608.03801","kind":"arxiv","version":1}},"canonical_sha256":"25e9096503065ca95ed6e5c88b82e93e4c3079955bf0cd5f37b44d613f4cd82b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25e9096503065ca95ed6e5c88b82e93e4c3079955bf0cd5f37b44d613f4cd82b","first_computed_at":"2026-08-05T01:37:08.982153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T01:37:08.982153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tSsnvJUh0KY4s2vtchY8Nbqb/smXqHvWwtuA3atT53UEqZzX1wUjkaAUjyx8qHWH1yRVd6sisxYIQ1Qk80DCAQ==","signature_status":"signed_v1","signed_at":"2026-08-05T01:37:08.983777Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.03801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ce33fca438e3746b6a2f66f716991a417ad6349d91121b1e503137eedde8387","sha256:99eb433750bd100759173460450ec778be3069475188000988db36a8836acd71","sha256:1b815d704865007c7a881c485aa8ad70b1a60a5871c6a937c58385b021dd22a7"],"state_sha256":"628dbb5599daea03b4e5c59716b7a3613b54ff729c29607dcea6f6879ecd4631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FhnyzYa71rBtZaL9RB1zayvb5juTeymLvzxMc0px7335x+2d0Z9BC1F+J/Kihqg8wa4Oh3QRthitQ8m7/eYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:01:18.302994Z","bundle_sha256":"5f84f62eaa619dc317d2a14e2dd0ae489d7606d17e7cf14a6e19af6e0314b220"}}