{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R5MA4EOECZ4FOK3XCJLAHIIGWL","short_pith_number":"pith:R5MA4EOE","schema_version":"1.0","canonical_sha256":"8f580e11c41678572b77125603a106b2f7af722bcd7754654bc0ebf0fe79cd1a","source":{"kind":"arxiv","id":"1911.02653","version":3},"attestation_state":"computed","paper":{"title":"Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Hadas Shachnai","submitted_at":"2019-11-06T22:19:24Z","abstract_excerpt":"In this paper we introduce randomized branching as a tool for parameterized approximation and develop the mathematical machinery for its analysis. Our algorithms improve the best known running times of parameterized approximation algorithms for Vertex Cover and $3$-Hitting Set for a wide range of approximation ratios. One notable example is a simple parameterized random $1.5$-approximation algorithm for Vertex Cover, whose running time of $\\tilde{O}(1.01657^k)$ substantially improves the best known runnning time of $\\tilde{O}(1.0883^k)$ [Brankovic and Fernau, 2013]. For $3$-Hitting Set we pres"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1911.02653","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-06T22:19:24Z","cross_cats_sorted":[],"title_canon_sha256":"72dc8f14ead275051eb4e6e0edd74d8021e67462a53dee4fab55ed93898c838a","abstract_canon_sha256":"26650d0d082466a801d3be28f237f160ff79eb536eaecf75830e178eae2ced30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:29.069098Z","signature_b64":"wjaQ3DN2tO/dDxWGOWbGZ5kqEVCx5tof1doyyG+hc5hqCPEWPlXgX4ne65B9DABkNn3zX4J0anzeXel3QWsPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f580e11c41678572b77125603a106b2f7af722bcd7754654bc0ebf0fe79cd1a","last_reissued_at":"2026-07-05T11:17:29.068613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:29.068613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Hadas Shachnai","submitted_at":"2019-11-06T22:19:24Z","abstract_excerpt":"In this paper we introduce randomized branching as a tool for parameterized approximation and develop the mathematical machinery for its analysis. Our algorithms improve the best known running times of parameterized approximation algorithms for Vertex Cover and $3$-Hitting Set for a wide range of approximation ratios. One notable example is a simple parameterized random $1.5$-approximation algorithm for Vertex Cover, whose running time of $\\tilde{O}(1.01657^k)$ substantially improves the best known runnning time of $\\tilde{O}(1.0883^k)$ [Brankovic and Fernau, 2013]. For $3$-Hitting Set we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02653","kind":"arxiv","version":3},"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/1911.02653/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.02653","created_at":"2026-07-05T11:17:29.068671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.02653v3","created_at":"2026-07-05T11:17:29.068671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02653","created_at":"2026-07-05T11:17:29.068671+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5MA4EOECZ4F","created_at":"2026-07-05T11:17:29.068671+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5MA4EOECZ4FOK3X","created_at":"2026-07-05T11:17:29.068671+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5MA4EOE","created_at":"2026-07-05T11:17:29.068671+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13171","citing_title":"Parameterized Geometric Graph Modification with Disk Scaling","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL","json":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL.json","graph_json":"https://pith.science/api/pith-number/R5MA4EOECZ4FOK3XCJLAHIIGWL/graph.json","events_json":"https://pith.science/api/pith-number/R5MA4EOECZ4FOK3XCJLAHIIGWL/events.json","paper":"https://pith.science/paper/R5MA4EOE"},"agent_actions":{"view_html":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL","download_json":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL.json","view_paper":"https://pith.science/paper/R5MA4EOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.02653&json=true","fetch_graph":"https://pith.science/api/pith-number/R5MA4EOECZ4FOK3XCJLAHIIGWL/graph.json","fetch_events":"https://pith.science/api/pith-number/R5MA4EOECZ4FOK3XCJLAHIIGWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL/action/storage_attestation","attest_author":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL/action/author_attestation","sign_citation":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL/action/citation_signature","submit_replication":"https://pith.science/pith/R5MA4EOECZ4FOK3XCJLAHIIGWL/action/replication_record"}},"created_at":"2026-07-05T11:17:29.068671+00:00","updated_at":"2026-07-05T11:17:29.068671+00:00"}