{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WYB4PIZV56J24FLFMV4XKYQJ57","short_pith_number":"pith:WYB4PIZV","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"},"canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","source":{"kind":"arxiv","id":"2311.03665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.03665","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.03665v1","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03665","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"WYB4PIZV56J2","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_16","alias_value":"WYB4PIZV56J24FLF","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_8","alias_value":"WYB4PIZV","created_at":"2026-07-05T07:10:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WYB4PIZV56J24FLFMV4XKYQJ57","target":"record","payload":{"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"},"canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","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"},"source_kind":"arxiv","source_id":"2311.03665","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-05T07:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf18F6J/dWlhjSdwyzyjBhCyxct8XgwFIikpV9FUyGGJCuTnnlf5l5prVhxul0DxyqFRu0I6z0NFVYk40afmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:37:14.582652Z"},"content_sha256":"f8c14a0319feeaf08ac4bf803a34555c7847dd294229ad5ac89ed457c3f77e9d","schema_version":"1.0","event_id":"sha256:f8c14a0319feeaf08ac4bf803a34555c7847dd294229ad5ac89ed457c3f77e9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WYB4PIZV56J24FLFMV4XKYQJ57","target":"graph","payload":{"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"},"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-05T07:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvZvFdkeo5AdixPwkQyQHAhLcW04oepf4SfQTgumoZBP4XgNXB94PVLheNZ/wq62FmFEgeWsbJKuVr/6gjPzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:37:14.583243Z"},"content_sha256":"e66f1551e8ba5a2169c193e66d72b17ff35f74145279e2a0c9e255f2ecbc9257","schema_version":"1.0","event_id":"sha256:e66f1551e8ba5a2169c193e66d72b17ff35f74145279e2a0c9e255f2ecbc9257"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/bundle.json","state_url":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYB4PIZV56J24FLFMV4XKYQJ57/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-08-15T12:37:14Z","links":{"resolver":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57","bundle":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/bundle.json","state":"https://pith.science/pith/WYB4PIZV56J24FLFMV4XKYQJ57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYB4PIZV56J24FLFMV4XKYQJ57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WYB4PIZV56J24FLFMV4XKYQJ57","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":"b89103e4306cb5438eab6372f0beb9f87811a652e0a76df5ccb25854fbf47e64","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-11-07T02:21:35Z","title_canon_sha256":"3b5a4b8295e3eb74d1d7ea0fb1e682b0ec5f2d149e2de6be61279e7bc455c955"},"schema_version":"1.0","source":{"id":"2311.03665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.03665","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.03665v1","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03665","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"WYB4PIZV56J2","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_16","alias_value":"WYB4PIZV56J24FLF","created_at":"2026-07-05T07:10:02Z"},{"alias_kind":"pith_short_8","alias_value":"WYB4PIZV","created_at":"2026-07-05T07:10:02Z"}],"graph_snapshots":[{"event_id":"sha256:e66f1551e8ba5a2169c193e66d72b17ff35f74145279e2a0c9e255f2ecbc9257","target":"graph","created_at":"2026-07-05T07:10:02Z","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/2311.03665/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eunjin Oh, Kyungjin Cho, Shinwoo An","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-11-07T02:21:35Z","title":"Faster Algorithms for Cycle Hitting Problems on Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03665","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:f8c14a0319feeaf08ac4bf803a34555c7847dd294229ad5ac89ed457c3f77e9d","target":"record","created_at":"2026-07-05T07:10:02Z","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":"b89103e4306cb5438eab6372f0beb9f87811a652e0a76df5ccb25854fbf47e64","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-11-07T02:21:35Z","title_canon_sha256":"3b5a4b8295e3eb74d1d7ea0fb1e682b0ec5f2d149e2de6be61279e7bc455c955"},"schema_version":"1.0","source":{"id":"2311.03665","kind":"arxiv","version":1}},"canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b603c7a335ef93ae15656579756209efcdfb088be7834462fe47ab5500744fe3","first_computed_at":"2026-07-05T07:10:02.296826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:10:02.296826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ReWg2bVTeIZIxmAw6iskVCcN6HBlZ9LPPNksXScjNST23Lo8Yvd59A0QWxzF2vdgTRNDwXiYUF8ztUUK7S/2CA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:10:02.297323Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.03665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8c14a0319feeaf08ac4bf803a34555c7847dd294229ad5ac89ed457c3f77e9d","sha256:e66f1551e8ba5a2169c193e66d72b17ff35f74145279e2a0c9e255f2ecbc9257"],"state_sha256":"854414514569153c5a4568b66486ade5ba63ce57bfc1dcd652792cdfa189c57d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxsEF9u3y92OLw4AO/D/5NFT9jHCueThOtNVUrnvR5rPePUdFj+Y3HpVRrOuYL+nXpLWmS8Oh0dayQ20KSPEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T12:37:14.586708Z","bundle_sha256":"51528c4228aaf5ba7050f7407ffc75ed50753ad9c614759536226132e23bd520"}}