{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SEL3KJWZBGHGLWXI3PEQNUVYKU","short_pith_number":"pith:SEL3KJWZ","schema_version":"1.0","canonical_sha256":"9117b526d9098e65dae8dbc906d2b855067fa37cd5e4a1355d3d64926c4d1062","source":{"kind":"arxiv","id":"1106.5885","version":1},"attestation_state":"computed","paper":{"title":"Vertex-disjoint directed and undirected cycles in general digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandro Maddaloni, J{\\o}rgen Bang-Jensen, Matthias Kriesell, Sven Simonsen","submitted_at":"2011-06-29T09:22:43Z","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"},"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":"1106.5885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T09:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"b00b4ae5e79d22385b02309a4adc0052f8ab20c4c2db37b15632c415abc3b218","abstract_canon_sha256":"510c5cf4620c4abab151af30949e4e1ad8f353442d402cbe7709b884759f7df1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:04.986373Z","signature_b64":"wKsTgzM8leCr+aAwlNWnLuk8kdjwutEwhj4/XZb8r5C7L+mcRPOzwjWqpQM+TFpdzAWovYC8sNdZiut5OS5SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9117b526d9098e65dae8dbc906d2b855067fa37cd5e4a1355d3d64926c4d1062","last_reissued_at":"2026-05-18T04:19:04.985812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:04.985812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-disjoint directed and undirected cycles in general digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandro Maddaloni, J{\\o}rgen Bang-Jensen, Matthias Kriesell, Sven Simonsen","submitted_at":"2011-06-29T09:22:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5885","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":""},"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":"1106.5885","created_at":"2026-05-18T04:19:04.985900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5885v1","created_at":"2026-05-18T04:19:04.985900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5885","created_at":"2026-05-18T04:19:04.985900+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEL3KJWZBGHG","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEL3KJWZBGHGLWXI","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEL3KJWZ","created_at":"2026-05-18T12:26:41.206345+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/SEL3KJWZBGHGLWXI3PEQNUVYKU","json":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU.json","graph_json":"https://pith.science/api/pith-number/SEL3KJWZBGHGLWXI3PEQNUVYKU/graph.json","events_json":"https://pith.science/api/pith-number/SEL3KJWZBGHGLWXI3PEQNUVYKU/events.json","paper":"https://pith.science/paper/SEL3KJWZ"},"agent_actions":{"view_html":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU","download_json":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU.json","view_paper":"https://pith.science/paper/SEL3KJWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5885&json=true","fetch_graph":"https://pith.science/api/pith-number/SEL3KJWZBGHGLWXI3PEQNUVYKU/graph.json","fetch_events":"https://pith.science/api/pith-number/SEL3KJWZBGHGLWXI3PEQNUVYKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU/action/storage_attestation","attest_author":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU/action/author_attestation","sign_citation":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU/action/citation_signature","submit_replication":"https://pith.science/pith/SEL3KJWZBGHGLWXI3PEQNUVYKU/action/replication_record"}},"created_at":"2026-05-18T04:19:04.985900+00:00","updated_at":"2026-05-18T04:19:04.985900+00:00"}