{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S256E3BGAQJV32MAVZ473NGMZR","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":"0235447e6d35624a528eda9e5263e87bcbc797a8ab7fb7e8b053fdc67118c06b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T15:18:40Z","title_canon_sha256":"801535e9773f2023b93c0e58097d97ae96c09c0a8ca0bb43786cef2463c01514"},"schema_version":"1.0","source":{"id":"1704.07279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07279","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07279v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07279","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"S256E3BGAQJV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S256E3BGAQJV32MA","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S256E3BG","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:bc047249bf71647493beb410f2557cd002a44efcb2f6f5e6b5fe0ef773eecd45","target":"graph","created_at":"2026-05-18T00:45:53Z","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"},"paper":{"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","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Saket Saurabh","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T15:18:40Z","title":"Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07279","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:256e558783c18c7480245147bc687266ba1531ad5dd074da4911c66fe07fbcf7","target":"record","created_at":"2026-05-18T00:45:53Z","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":"0235447e6d35624a528eda9e5263e87bcbc797a8ab7fb7e8b053fdc67118c06b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T15:18:40Z","title_canon_sha256":"801535e9773f2023b93c0e58097d97ae96c09c0a8ca0bb43786cef2463c01514"},"schema_version":"1.0","source":{"id":"1704.07279","kind":"arxiv","version":1}},"canonical_sha256":"96bbe26c2604135de980ae79fdb4cccc6f97b8a44a3987239f3c48aae9c791a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96bbe26c2604135de980ae79fdb4cccc6f97b8a44a3987239f3c48aae9c791a7","first_computed_at":"2026-05-18T00:45:53.013343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:53.013343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ouQS07I/o99XGdhEJc+PTFVm2j0/BFMgN85V4capoEvT47hcPrZaVusmZq8YF53JU8Du4b/+79k5nwVo5jIBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:53.013926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:256e558783c18c7480245147bc687266ba1531ad5dd074da4911c66fe07fbcf7","sha256:bc047249bf71647493beb410f2557cd002a44efcb2f6f5e6b5fe0ef773eecd45"],"state_sha256":"64e792e4be546370295d071c314fde78402c6f58aca8043df5ecc7896be5e964"}