{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5HWRHLZZJE5WXPRCRBOOKKVPNS","short_pith_number":"pith:5HWRHLZZ","schema_version":"1.0","canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","source":{"kind":"arxiv","id":"1908.09065","version":2},"attestation_state":"computed","paper":{"title":"Graphs without two vertex-disjoint $S$-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Minjeong Kang, Myounghwan Lee, O-joung Kwon","submitted_at":"2019-08-24T01:22:50Z","abstract_excerpt":"Lov\\'asz (1965) characterized graphs without two vertex-disjoint cycles, which implies that such graphs have at most three vertices hitting all cycles. In this paper, we ask whether such a small hitting set exists for $S$-cycles, when a graph has no two vertex-disjoint $S$-cycles. For a graph $G$ and a vertex set $S$ of $G$, an $S$-cycle is a cycle containing a vertex of $S$.\n  We provide an example $G$ on $21$ vertices where $G$ has no two vertex-disjoint $S$-cycles, but three vertices are not sufficient to hit all $S$-cycles. On the other hand, we show that four vertices are enough to hit al"},"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":"1908.09065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-24T01:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"e25c980309671c8bda665cafed0f6c5713503660275f7ee58392e54f63c04f9f","abstract_canon_sha256":"642b02a260ffb83c07c61feb26293a1ea38ba0746c6679d08bfece47db797571"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:32.327690Z","signature_b64":"9krjDW2MB/0HsMLeyLpMPH0Rc639+uaIFylTstIwzsiMSejA4Xm8cEuVT6iezTHYmzABNRtdPSz/9FIQBrKgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","last_reissued_at":"2026-07-05T00:39:32.327243Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:32.327243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs without two vertex-disjoint $S$-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Minjeong Kang, Myounghwan Lee, O-joung Kwon","submitted_at":"2019-08-24T01:22:50Z","abstract_excerpt":"Lov\\'asz (1965) characterized graphs without two vertex-disjoint cycles, which implies that such graphs have at most three vertices hitting all cycles. In this paper, we ask whether such a small hitting set exists for $S$-cycles, when a graph has no two vertex-disjoint $S$-cycles. For a graph $G$ and a vertex set $S$ of $G$, an $S$-cycle is a cycle containing a vertex of $S$.\n  We provide an example $G$ on $21$ vertices where $G$ has no two vertex-disjoint $S$-cycles, but three vertices are not sufficient to hit all $S$-cycles. On the other hand, we show that four vertices are enough to hit al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09065","kind":"arxiv","version":2},"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/1908.09065/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":"1908.09065","created_at":"2026-07-05T00:39:32.327307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09065v2","created_at":"2026-07-05T00:39:32.327307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09065","created_at":"2026-07-05T00:39:32.327307+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HWRHLZZJE5W","created_at":"2026-07-05T00:39:32.327307+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HWRHLZZJE5WXPRC","created_at":"2026-07-05T00:39:32.327307+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HWRHLZZ","created_at":"2026-07-05T00:39:32.327307+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/5HWRHLZZJE5WXPRCRBOOKKVPNS","json":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS.json","graph_json":"https://pith.science/api/pith-number/5HWRHLZZJE5WXPRCRBOOKKVPNS/graph.json","events_json":"https://pith.science/api/pith-number/5HWRHLZZJE5WXPRCRBOOKKVPNS/events.json","paper":"https://pith.science/paper/5HWRHLZZ"},"agent_actions":{"view_html":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS","download_json":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS.json","view_paper":"https://pith.science/paper/5HWRHLZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09065&json=true","fetch_graph":"https://pith.science/api/pith-number/5HWRHLZZJE5WXPRCRBOOKKVPNS/graph.json","fetch_events":"https://pith.science/api/pith-number/5HWRHLZZJE5WXPRCRBOOKKVPNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/action/storage_attestation","attest_author":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/action/author_attestation","sign_citation":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/action/citation_signature","submit_replication":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/action/replication_record"}},"created_at":"2026-07-05T00:39:32.327307+00:00","updated_at":"2026-07-05T00:39:32.327307+00:00"}