{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SEL3KJWZBGHGLWXI3PEQNUVYKU","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":"510c5cf4620c4abab151af30949e4e1ad8f353442d402cbe7709b884759f7df1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T09:22:43Z","title_canon_sha256":"b00b4ae5e79d22385b02309a4adc0052f8ab20c4c2db37b15632c415abc3b218"},"schema_version":"1.0","source":{"id":"1106.5885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5885","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5885v1","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5885","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"SEL3KJWZBGHG","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SEL3KJWZBGHGLWXI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SEL3KJWZ","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:0bc171bc358c83e39890902a5ed504568f57dfae19569d265b92a650eee68e5e","target":"graph","created_at":"2026-05-18T04:19:04Z","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":"The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B in D and a cycle C in the underlying undirected graph of D such such that B,C are disjoint. It is known that there is a polynomial time algorithm for this problem when restricted to strongly connected graphs, which actually finds B,C if they exist. We generalize this to any class of digraphs D with either t(D) not equal to 1 or t(D)=1 and a bounded number o","authors_text":"Alessandro Maddaloni, J{\\o}rgen Bang-Jensen, Matthias Kriesell, Sven Simonsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T09:22:43Z","title":"Vertex-disjoint directed and undirected cycles in general digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5885","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:fd67bc6aeec9d34367d542f557978a75ca9bd86b4d4112d45d32e92d4ad8deec","target":"record","created_at":"2026-05-18T04:19:04Z","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":"510c5cf4620c4abab151af30949e4e1ad8f353442d402cbe7709b884759f7df1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T09:22:43Z","title_canon_sha256":"b00b4ae5e79d22385b02309a4adc0052f8ab20c4c2db37b15632c415abc3b218"},"schema_version":"1.0","source":{"id":"1106.5885","kind":"arxiv","version":1}},"canonical_sha256":"9117b526d9098e65dae8dbc906d2b855067fa37cd5e4a1355d3d64926c4d1062","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9117b526d9098e65dae8dbc906d2b855067fa37cd5e4a1355d3d64926c4d1062","first_computed_at":"2026-05-18T04:19:04.985812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:04.985812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wKsTgzM8leCr+aAwlNWnLuk8kdjwutEwhj4/XZb8r5C7L+mcRPOzwjWqpQM+TFpdzAWovYC8sNdZiut5OS5SBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:04.986373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd67bc6aeec9d34367d542f557978a75ca9bd86b4d4112d45d32e92d4ad8deec","sha256:0bc171bc358c83e39890902a5ed504568f57dfae19569d265b92a650eee68e5e"],"state_sha256":"b0de161ec62b5e2346edd31dca2989c971c2ffe97deb7e333d8e7d5d2175c228"}