{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EDJVHJJ2AIFAKRTL5372G7SJV7","short_pith_number":"pith:EDJVHJJ2","schema_version":"1.0","canonical_sha256":"20d353a53a020a05466beeffa37e49afca94360e550c5821c0318a70741a56e7","source":{"kind":"arxiv","id":"1805.02999","version":2},"attestation_state":"computed","paper":{"title":"On the number of vertex-disjoint cycles in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yandong Bai, Yannis Manoussakis","submitted_at":"2018-05-08T13:24:29Z","abstract_excerpt":"Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles. It is famous as one of the one hundred unsolved problems selected in [Bondy, Murty, Graph Theory, Springer-Verlag London, 2008]. Lichiardopol, Por and Sereni proved in [SIAM J. Discrete Math. 23 (2) (2009) 979-992] that the above conjecture holds for $k=3$.\n  Let $g$ be the girth, i.e., the length of the shortest cycle, of a given digraph. Bang-Jensen, Bessy and Thomass\\'{e} conjectured in [J. Graph Theory 75 (3) (2014) 284-302]"},"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":"1805.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-08T13:24:29Z","cross_cats_sorted":[],"title_canon_sha256":"1b72cfca47f945c432fe85af2c5c2d129f05d1ecc7f5e83bc70ee70a8867cb4a","abstract_canon_sha256":"009d86c3ff05e0cd4694eedccfdd08e49542e7e7a4d2878af823c71899bec9d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:39.963576Z","signature_b64":"oOQLg5bUzDXT1DU1iWnUO3KSi+VcWu7mQsu0XIk6AG2NsY3T5mimF/ObLcXgG+u3Gm0iDZu2EaoMJDcOAN9MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d353a53a020a05466beeffa37e49afca94360e550c5821c0318a70741a56e7","last_reissued_at":"2026-05-18T00:14:39.962911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:39.962911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of vertex-disjoint cycles in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yandong Bai, Yannis Manoussakis","submitted_at":"2018-05-08T13:24:29Z","abstract_excerpt":"Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles. It is famous as one of the one hundred unsolved problems selected in [Bondy, Murty, Graph Theory, Springer-Verlag London, 2008]. Lichiardopol, Por and Sereni proved in [SIAM J. Discrete Math. 23 (2) (2009) 979-992] that the above conjecture holds for $k=3$.\n  Let $g$ be the girth, i.e., the length of the shortest cycle, of a given digraph. Bang-Jensen, Bessy and Thomass\\'{e} conjectured in [J. Graph Theory 75 (3) (2014) 284-302]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02999","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":""},"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":"1805.02999","created_at":"2026-05-18T00:14:39.963009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02999v2","created_at":"2026-05-18T00:14:39.963009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02999","created_at":"2026-05-18T00:14:39.963009+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDJVHJJ2AIFA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDJVHJJ2AIFAKRTL","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDJVHJJ2","created_at":"2026-05-18T12:32:22.470017+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/EDJVHJJ2AIFAKRTL5372G7SJV7","json":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7.json","graph_json":"https://pith.science/api/pith-number/EDJVHJJ2AIFAKRTL5372G7SJV7/graph.json","events_json":"https://pith.science/api/pith-number/EDJVHJJ2AIFAKRTL5372G7SJV7/events.json","paper":"https://pith.science/paper/EDJVHJJ2"},"agent_actions":{"view_html":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7","download_json":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7.json","view_paper":"https://pith.science/paper/EDJVHJJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02999&json=true","fetch_graph":"https://pith.science/api/pith-number/EDJVHJJ2AIFAKRTL5372G7SJV7/graph.json","fetch_events":"https://pith.science/api/pith-number/EDJVHJJ2AIFAKRTL5372G7SJV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7/action/storage_attestation","attest_author":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7/action/author_attestation","sign_citation":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7/action/citation_signature","submit_replication":"https://pith.science/pith/EDJVHJJ2AIFAKRTL5372G7SJV7/action/replication_record"}},"created_at":"2026-05-18T00:14:39.963009+00:00","updated_at":"2026-05-18T00:14:39.963009+00:00"}