{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5HWRHLZZJE5WXPRCRBOOKKVPNS","short_pith_number":"pith:5HWRHLZZ","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"},"canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","source":{"kind":"arxiv","id":"1908.09065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09065","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09065v2","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09065","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5HWRHLZZJE5W","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_16","alias_value":"5HWRHLZZJE5WXPRC","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_8","alias_value":"5HWRHLZZ","created_at":"2026-07-05T00:39:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5HWRHLZZJE5WXPRCRBOOKKVPNS","target":"record","payload":{"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"},"canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","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"},"source_kind":"arxiv","source_id":"1908.09065","source_version":2,"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-05T00:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gRfXIjJMdHsq+gkX/j6Ve+kFP75QDhQTyDXDulaSWMKccIaZzC3b6XTB6u694O+b2sKUyA5oGV3BuiNxGRICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:08:22.898124Z"},"content_sha256":"022d72bc2b712ce552a74628fd52ed24a6a2d83b74f18d34a5eae54959893679","schema_version":"1.0","event_id":"sha256:022d72bc2b712ce552a74628fd52ed24a6a2d83b74f18d34a5eae54959893679"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5HWRHLZZJE5WXPRCRBOOKKVPNS","target":"graph","payload":{"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"},"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-05T00:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StvqBU64VzyDdxMaHkBBBhRvRCduWnnXePAKK9vkFyyRSFUg2b9/9ftI6TWP/2QpSesA+KgCzUDAcAH3VcQ3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:08:22.899216Z"},"content_sha256":"6542ae7b80e0d96d7aa11f2caca4ccd8310fc04e2eef3539c84cbc6adb16bbea","schema_version":"1.0","event_id":"sha256:6542ae7b80e0d96d7aa11f2caca4ccd8310fc04e2eef3539c84cbc6adb16bbea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/bundle.json","state_url":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/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-16T20:08:22Z","links":{"resolver":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS","bundle":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/bundle.json","state":"https://pith.science/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HWRHLZZJE5WXPRCRBOOKKVPNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5HWRHLZZJE5WXPRCRBOOKKVPNS","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":"642b02a260ffb83c07c61feb26293a1ea38ba0746c6679d08bfece47db797571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-24T01:22:50Z","title_canon_sha256":"e25c980309671c8bda665cafed0f6c5713503660275f7ee58392e54f63c04f9f"},"schema_version":"1.0","source":{"id":"1908.09065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09065","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09065v2","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09065","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5HWRHLZZJE5W","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_16","alias_value":"5HWRHLZZJE5WXPRC","created_at":"2026-07-05T00:39:32Z"},{"alias_kind":"pith_short_8","alias_value":"5HWRHLZZ","created_at":"2026-07-05T00:39:32Z"}],"graph_snapshots":[{"event_id":"sha256:6542ae7b80e0d96d7aa11f2caca4ccd8310fc04e2eef3539c84cbc6adb16bbea","target":"graph","created_at":"2026-07-05T00:39:32Z","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/1908.09065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Minjeong Kang, Myounghwan Lee, O-joung Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09065","kind":"arxiv","version":2},"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:022d72bc2b712ce552a74628fd52ed24a6a2d83b74f18d34a5eae54959893679","target":"record","created_at":"2026-07-05T00:39:32Z","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":"642b02a260ffb83c07c61feb26293a1ea38ba0746c6679d08bfece47db797571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-24T01:22:50Z","title_canon_sha256":"e25c980309671c8bda665cafed0f6c5713503660275f7ee58392e54f63c04f9f"},"schema_version":"1.0","source":{"id":"1908.09065","kind":"arxiv","version":2}},"canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9ed13af39493b6bbe22885ce52aaf6ca3697786794f2fa60c4b394689e7a7c4","first_computed_at":"2026-07-05T00:39:32.327243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:32.327243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9krjDW2MB/0HsMLeyLpMPH0Rc639+uaIFylTstIwzsiMSejA4Xm8cEuVT6iezTHYmzABNRtdPSz/9FIQBrKgBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:32.327690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:022d72bc2b712ce552a74628fd52ed24a6a2d83b74f18d34a5eae54959893679","sha256:6542ae7b80e0d96d7aa11f2caca4ccd8310fc04e2eef3539c84cbc6adb16bbea"],"state_sha256":"9e6b77b2a46a6df73db6c198497b83054ac79c113e7eb965292550f697fa91b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sj5HoHxiirta4amyZl0013SHwZcEb92Rjw8x5iFgGyf7qSX/YbLtyBhXfDT1nU7qRXd5/Tr546OH7qEXZwIfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:08:22.905773Z","bundle_sha256":"7d70571215ca91d9ef1785c9fa281088654eccb5bcfef6c2277d0f61f32f7259"}}