{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WYB4PIZV56J24FLFMV4XKYQJ57","short_pith_number":"pith:WYB4PIZV","schema_version":"1.0","canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","source":{"kind":"arxiv","id":"2311.03665","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Cycle Hitting Problems on Disk Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Kyungjin Cho, Shinwoo An","submitted_at":"2023-11-07T02:21:35Z","abstract_excerpt":"In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection graph $G$, our goal is to compute a set of vertices hitting all triangles, all cycles, or all odd cycles, respectively. Our algorithms run in time $2^{\\tilde O(k^{4/5})}n^{O(1)}$, $2^{\\tilde O(k^{9/10})}n^{O(1)}$, and $2^{\\tilde O(k^{19/20})}n^{O(1)}$, respectively, where $n$ denotes the number of vertices of $G$. These do not require a geometric representation of a disk graph. If a geometric representation of a disk gra"},"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":"2311.03665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-11-07T02:21:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3b5a4b8295e3eb74d1d7ea0fb1e682b0ec5f2d149e2de6be61279e7bc455c955","abstract_canon_sha256":"b89103e4306cb5438eab6372f0beb9f87811a652e0a76df5ccb25854fbf47e64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:02.297323Z","signature_b64":"ReWg2bVTeIZIxmAw6iskVCcN6HBlZ9LPPNksXScjNST23Lo8Yvd59A0QWxzF2vdgTRNDwXiYUF8ztUUK7S/2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","last_reissued_at":"2026-07-05T07:10:02.296826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:02.296826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Cycle Hitting Problems on Disk Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Kyungjin Cho, Shinwoo An","submitted_at":"2023-11-07T02:21:35Z","abstract_excerpt":"In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection graph $G$, our goal is to compute a set of vertices hitting all triangles, all cycles, or all odd cycles, respectively. Our algorithms run in time $2^{\\tilde O(k^{4/5})}n^{O(1)}$, $2^{\\tilde O(k^{9/10})}n^{O(1)}$, and $2^{\\tilde O(k^{19/20})}n^{O(1)}$, respectively, where $n$ denotes the number of vertices of $G$. These do not require a geometric representation of a disk graph. If a geometric representation of a disk gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03665","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/2311.03665/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":"2311.03665","created_at":"2026-07-05T07:10:02.296899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03665v1","created_at":"2026-07-05T07:10:02.296899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03665","created_at":"2026-07-05T07:10:02.296899+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYB4PIZV56J2","created_at":"2026-07-05T07:10:02.296899+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYB4PIZV56J24FLF","created_at":"2026-07-05T07:10:02.296899+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYB4PIZV","created_at":"2026-07-05T07:10:02.296899+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12424","citing_title":"Layered tree-independence number and clique-based separators","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57","json":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57.json","graph_json":"https://pith.science/api/pith-number/WYB4PIZV56J24FLFMV4XKYQJ57/graph.json","events_json":"https://pith.science/api/pith-number/WYB4PIZV56J24FLFMV4XKYQJ57/events.json","paper":"https://pith.science/paper/WYB4PIZV"},"agent_actions":{"view_html":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57","download_json":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57.json","view_paper":"https://pith.science/paper/WYB4PIZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03665&json=true","fetch_graph":"https://pith.science/api/pith-number/WYB4PIZV56J24FLFMV4XKYQJ57/graph.json","fetch_events":"https://pith.science/api/pith-number/WYB4PIZV56J24FLFMV4XKYQJ57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/action/storage_attestation","attest_author":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/action/author_attestation","sign_citation":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/action/citation_signature","submit_replication":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/action/replication_record"}},"created_at":"2026-07-05T07:10:02.296899+00:00","updated_at":"2026-07-05T07:10:02.296899+00:00"}