{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S256E3BGAQJV32MAVZ473NGMZR","short_pith_number":"pith:S256E3BG","schema_version":"1.0","canonical_sha256":"96bbe26c2604135de980ae79fdb4cccc6f97b8a44a3987239f3c48aae9c791a7","source":{"kind":"arxiv","id":"1704.07279","version":1},"attestation_state":"computed","paper":{"title":"Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Saket Saurabh","submitted_at":"2017-04-24T15:18:40Z","abstract_excerpt":"We give algorithms with running time $2^{O({\\sqrt{k}\\log{k}})} \\cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices, (2) a cycle on exactly $k$ vertices, (3) a cycle on at least $k$ vertices, (4) a feedback vertex set of size at most $k$, and (5) a set of $k$ pairwise vertex-disjoint cycles. For the first three problems, no subexponential time parameterized algorithms were previously known. For the remaining two problems, our algorithms significantly outperform the previou"},"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":"1704.07279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T15:18:40Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"801535e9773f2023b93c0e58097d97ae96c09c0a8ca0bb43786cef2463c01514","abstract_canon_sha256":"0235447e6d35624a528eda9e5263e87bcbc797a8ab7fb7e8b053fdc67118c06b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.013926Z","signature_b64":"ouQS07I/o99XGdhEJc+PTFVm2j0/BFMgN85V4capoEvT47hcPrZaVusmZq8YF53JU8Du4b/+79k5nwVo5jIBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96bbe26c2604135de980ae79fdb4cccc6f97b8a44a3987239f3c48aae9c791a7","last_reissued_at":"2026-05-18T00:45:53.013343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.013343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Saket Saurabh","submitted_at":"2017-04-24T15:18:40Z","abstract_excerpt":"We give algorithms with running time $2^{O({\\sqrt{k}\\log{k}})} \\cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices, (2) a cycle on exactly $k$ vertices, (3) a cycle on at least $k$ vertices, (4) a feedback vertex set of size at most $k$, and (5) a set of $k$ pairwise vertex-disjoint cycles. For the first three problems, no subexponential time parameterized algorithms were previously known. For the remaining two problems, our algorithms significantly outperform the previou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07279","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":""},"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":"1704.07279","created_at":"2026-05-18T00:45:53.013429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07279v1","created_at":"2026-05-18T00:45:53.013429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07279","created_at":"2026-05-18T00:45:53.013429+00:00"},{"alias_kind":"pith_short_12","alias_value":"S256E3BGAQJV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S256E3BGAQJV32MA","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S256E3BG","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR","json":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR.json","graph_json":"https://pith.science/api/pith-number/S256E3BGAQJV32MAVZ473NGMZR/graph.json","events_json":"https://pith.science/api/pith-number/S256E3BGAQJV32MAVZ473NGMZR/events.json","paper":"https://pith.science/paper/S256E3BG"},"agent_actions":{"view_html":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR","download_json":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR.json","view_paper":"https://pith.science/paper/S256E3BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07279&json=true","fetch_graph":"https://pith.science/api/pith-number/S256E3BGAQJV32MAVZ473NGMZR/graph.json","fetch_events":"https://pith.science/api/pith-number/S256E3BGAQJV32MAVZ473NGMZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR/action/storage_attestation","attest_author":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR/action/author_attestation","sign_citation":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR/action/citation_signature","submit_replication":"https://pith.science/pith/S256E3BGAQJV32MAVZ473NGMZR/action/replication_record"}},"created_at":"2026-05-18T00:45:53.013429+00:00","updated_at":"2026-05-18T00:45:53.013429+00:00"}