{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:22ZOEIGBECU33PFM6FRHQ2NORG","short_pith_number":"pith:22ZOEIGB","canonical_record":{"source":{"id":"2202.03322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T16:14:55Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"14796d6c4277dd69831a819d93d3bfd1acd4f875de7677f325b9731a507d007d","abstract_canon_sha256":"3e4887903b66379922378ed99cc120c92203a6c935e3529e4c2adec8995f6454"},"schema_version":"1.0"},"canonical_sha256":"d6b2e220c120a9bdbcacf1627869ae89a00edd44e49aa687c7cf352fd0e8ccde","source":{"kind":"arxiv","id":"2202.03322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03322","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03322v1","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03322","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"22ZOEIGBECU3","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"22ZOEIGBECU33PFM","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"22ZOEIGB","created_at":"2026-07-05T03:54:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:22ZOEIGBECU33PFM6FRHQ2NORG","target":"record","payload":{"canonical_record":{"source":{"id":"2202.03322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T16:14:55Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"14796d6c4277dd69831a819d93d3bfd1acd4f875de7677f325b9731a507d007d","abstract_canon_sha256":"3e4887903b66379922378ed99cc120c92203a6c935e3529e4c2adec8995f6454"},"schema_version":"1.0"},"canonical_sha256":"d6b2e220c120a9bdbcacf1627869ae89a00edd44e49aa687c7cf352fd0e8ccde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:37.877164Z","signature_b64":"pDhnOsWws0efR2hI8tNO9yaBcx/Spi2k9wBRiOsXYEK0hcxdLWP2qPRWQWtZ9/9t/CH0NR+/RrqtYtnY8/5iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6b2e220c120a9bdbcacf1627869ae89a00edd44e49aa687c7cf352fd0e8ccde","last_reissued_at":"2026-07-05T03:54:37.876760Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:37.876760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.03322","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-07-05T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5p59EbDsFHPOsYrB4dwrtPd9MJrpGZTM8Z4DQhmwA0XGuYhFhB0/nky7LhgFeaet4bPOplfZ6OYQ8hhzI7WBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:09:40.380499Z"},"content_sha256":"7023e6ac5d96ab90daea361c071d00371752a74fb9c48c56f73710e28a1910b3","schema_version":"1.0","event_id":"sha256:7023e6ac5d96ab90daea361c071d00371752a74fb9c48c56f73710e28a1910b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:22ZOEIGBECU33PFM6FRHQ2NORG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing the Vertex Cover Number via Edge Contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Paloma T. Lima, Prafullkumar Tale, U\\'everton S. Souza, Vinicius F. dos Santos","submitted_at":"2022-02-07T16:14:55Z","abstract_excerpt":"The CONTRACTION(vc) problem takes as input a graph $G$ on $n$ vertices and two integers $k$ and $d$, and asks whether one can contract at most $k$ edges to reduce the size of a minimum vertex cover of $G$ by at least $d$. Recently, Lima et al. [JCSS 2021] proved, among other results, that unlike most of the so-called blocker problems, CONTRACTION(vc) admits an XP algorithm running in time $f(d) \\cdot n^{O(d)}$. They left open the question of whether this problem is FPT under this parameterization. In this article, we continue this line of research and prove the following results:\n  1. CONTRACT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03322","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/2202.03322/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-07-05T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBMDYC9P27HA2RTnwVwYfHzNtBjXJ+UzhvFZ6Ry1Ys1nGUADShZZVuJ1k9ps9+PsVO4egPlt7MrO5XGlB8YwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:09:40.381142Z"},"content_sha256":"580704aead18def5b1c4722ea85b80c812137154c8af906cbaeb2c3f5227ebc8","schema_version":"1.0","event_id":"sha256:580704aead18def5b1c4722ea85b80c812137154c8af906cbaeb2c3f5227ebc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22ZOEIGBECU33PFM6FRHQ2NORG/bundle.json","state_url":"https://pith.science/pith/22ZOEIGBECU33PFM6FRHQ2NORG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22ZOEIGBECU33PFM6FRHQ2NORG/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-07-05T13:09:40Z","links":{"resolver":"https://pith.science/pith/22ZOEIGBECU33PFM6FRHQ2NORG","bundle":"https://pith.science/pith/22ZOEIGBECU33PFM6FRHQ2NORG/bundle.json","state":"https://pith.science/pith/22ZOEIGBECU33PFM6FRHQ2NORG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22ZOEIGBECU33PFM6FRHQ2NORG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:22ZOEIGBECU33PFM6FRHQ2NORG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3e4887903b66379922378ed99cc120c92203a6c935e3529e4c2adec8995f6454","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T16:14:55Z","title_canon_sha256":"14796d6c4277dd69831a819d93d3bfd1acd4f875de7677f325b9731a507d007d"},"schema_version":"1.0","source":{"id":"2202.03322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03322","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03322v1","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03322","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"22ZOEIGBECU3","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"22ZOEIGBECU33PFM","created_at":"2026-07-05T03:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"22ZOEIGB","created_at":"2026-07-05T03:54:37Z"}],"graph_snapshots":[{"event_id":"sha256:580704aead18def5b1c4722ea85b80c812137154c8af906cbaeb2c3f5227ebc8","target":"graph","created_at":"2026-07-05T03:54:37Z","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/2202.03322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The CONTRACTION(vc) problem takes as input a graph $G$ on $n$ vertices and two integers $k$ and $d$, and asks whether one can contract at most $k$ edges to reduce the size of a minimum vertex cover of $G$ by at least $d$. Recently, Lima et al. [JCSS 2021] proved, among other results, that unlike most of the so-called blocker problems, CONTRACTION(vc) admits an XP algorithm running in time $f(d) \\cdot n^{O(d)}$. They left open the question of whether this problem is FPT under this parameterization. In this article, we continue this line of research and prove the following results:\n  1. CONTRACT","authors_text":"Ignasi Sau, Paloma T. Lima, Prafullkumar Tale, U\\'everton S. Souza, Vinicius F. dos Santos","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T16:14:55Z","title":"Reducing the Vertex Cover Number via Edge Contractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03322","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:7023e6ac5d96ab90daea361c071d00371752a74fb9c48c56f73710e28a1910b3","target":"record","created_at":"2026-07-05T03:54:37Z","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":"3e4887903b66379922378ed99cc120c92203a6c935e3529e4c2adec8995f6454","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T16:14:55Z","title_canon_sha256":"14796d6c4277dd69831a819d93d3bfd1acd4f875de7677f325b9731a507d007d"},"schema_version":"1.0","source":{"id":"2202.03322","kind":"arxiv","version":1}},"canonical_sha256":"d6b2e220c120a9bdbcacf1627869ae89a00edd44e49aa687c7cf352fd0e8ccde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6b2e220c120a9bdbcacf1627869ae89a00edd44e49aa687c7cf352fd0e8ccde","first_computed_at":"2026-07-05T03:54:37.876760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:37.876760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pDhnOsWws0efR2hI8tNO9yaBcx/Spi2k9wBRiOsXYEK0hcxdLWP2qPRWQWtZ9/9t/CH0NR+/RrqtYtnY8/5iBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:37.877164Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.03322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7023e6ac5d96ab90daea361c071d00371752a74fb9c48c56f73710e28a1910b3","sha256:580704aead18def5b1c4722ea85b80c812137154c8af906cbaeb2c3f5227ebc8"],"state_sha256":"8eed5d3e8d2197664c38ec22a63dd79f5a332a0bb44af87f0d65651f8c9d2784"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdH1m7jRl48sJKFV1+UWuP1yGJM9d6xVF7Q8cen+Oq36JpwFqyziWOKIKpCtT56SJIbs5DnCWWxA4m7+IZj0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:09:40.383981Z","bundle_sha256":"89326840a9ccd435088284e4a938e442595c95fcc5075f20bc07c6b2a397f79e"}}