{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IA6ZL5DEZTNOSA2UNYI7E73WWO","short_pith_number":"pith:IA6ZL5DE","canonical_record":{"source":{"id":"1510.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"74e2f04a8fb85eaf30956660dc783022cd7ea7af8bbfc6ec896be05baf2bf45a","abstract_canon_sha256":"e959bdc01e15f474568312d4e78fc5b2a6b06f6c802a10dc96413a71608887e5"},"schema_version":"1.0"},"canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","source":{"kind":"arxiv","id":"1510.06667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06667","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06667v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06667","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"IA6ZL5DEZTNO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IA6ZL5DEZTNOSA2U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IA6ZL5DE","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IA6ZL5DEZTNOSA2UNYI7E73WWO","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"74e2f04a8fb85eaf30956660dc783022cd7ea7af8bbfc6ec896be05baf2bf45a","abstract_canon_sha256":"e959bdc01e15f474568312d4e78fc5b2a6b06f6c802a10dc96413a71608887e5"},"schema_version":"1.0"},"canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:11.886381Z","signature_b64":"yyDreiRuKiDjMm5DLSntJRuDPd66spC07eNBSElSLu3BgDhS/mhJrukTmaSyBEyhGGqzevXYwxGQen2TewvvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","last_reissued_at":"2026-05-18T01:23:11.885809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:11.885809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06667","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-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVCD5pgMM1y+dgawptd4k3C2BQR26FG5urjvFleg9DqTXWiuYa33Z5XMkysTCIZ2BTJNnTG5QJIP+2Voniv1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:48.499862Z"},"content_sha256":"b287212f6c877e96d16822b8903f435927651fb0bec748e942f5cd095cd79cb5","schema_version":"1.0","event_id":"sha256:b287212f6c877e96d16822b8903f435927651fb0bec748e942f5cd095cd79cb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IA6ZL5DEZTNOSA2UNYI7E73WWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disjoint cycles of different lengths in graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Binlong Li, Julien Bensmail, Ngoc Khang Le, Nicolas Lichiardopol","submitted_at":"2015-10-22T15:58:51Z","abstract_excerpt":"Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every $k \\geq 1$, every graph with minimum degree at least $\\frac{k^2+5k-2}{2}$ has $k$ vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider stronger situations, and exhibit degree bounds (some of which are best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06667","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"},"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-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hynHuea96Kjt7mmufrshRvL5ZtfeBZTam93u0pe1C64SNcieqonA/EyMxAWgu+WXonCA4t5ndEkE0bzwXI+UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:48.500299Z"},"content_sha256":"2c8ab14293f83974101d3414e6b996d5933ad77cd4a8824a667e0ace90d78474","schema_version":"1.0","event_id":"sha256:2c8ab14293f83974101d3414e6b996d5933ad77cd4a8824a667e0ace90d78474"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/bundle.json","state_url":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/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-05-27T11:53:48Z","links":{"resolver":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO","bundle":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/bundle.json","state":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IA6ZL5DEZTNOSA2UNYI7E73WWO","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":"e959bdc01e15f474568312d4e78fc5b2a6b06f6c802a10dc96413a71608887e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","title_canon_sha256":"74e2f04a8fb85eaf30956660dc783022cd7ea7af8bbfc6ec896be05baf2bf45a"},"schema_version":"1.0","source":{"id":"1510.06667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06667","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06667v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06667","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"IA6ZL5DEZTNO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IA6ZL5DEZTNOSA2U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IA6ZL5DE","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:2c8ab14293f83974101d3414e6b996d5933ad77cd4a8824a667e0ace90d78474","target":"graph","created_at":"2026-05-18T01:23:11Z","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":"Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every $k \\geq 1$, every graph with minimum degree at least $\\frac{k^2+5k-2}{2}$ has $k$ vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider stronger situations, and exhibit degree bounds (some of which are best","authors_text":"Ararat Harutyunyan, Binlong Li, Julien Bensmail, Ngoc Khang Le, Nicolas Lichiardopol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","title":"Disjoint cycles of different lengths in graphs and digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06667","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:b287212f6c877e96d16822b8903f435927651fb0bec748e942f5cd095cd79cb5","target":"record","created_at":"2026-05-18T01:23:11Z","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":"e959bdc01e15f474568312d4e78fc5b2a6b06f6c802a10dc96413a71608887e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","title_canon_sha256":"74e2f04a8fb85eaf30956660dc783022cd7ea7af8bbfc6ec896be05baf2bf45a"},"schema_version":"1.0","source":{"id":"1510.06667","kind":"arxiv","version":2}},"canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","first_computed_at":"2026-05-18T01:23:11.885809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:11.885809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yyDreiRuKiDjMm5DLSntJRuDPd66spC07eNBSElSLu3BgDhS/mhJrukTmaSyBEyhGGqzevXYwxGQen2TewvvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:11.886381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b287212f6c877e96d16822b8903f435927651fb0bec748e942f5cd095cd79cb5","sha256:2c8ab14293f83974101d3414e6b996d5933ad77cd4a8824a667e0ace90d78474"],"state_sha256":"4bed2dd956ab01387e344fd8f577d43cac4ee8b839a997ac320e8c0d5c45502f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mC05RFwEsJoFOowoTHLN2aJeWWxn+VmTpoMCLcwKASPk8l1l0UE0i2/qBIHhVFF43ZjC5NHvTNvTsx3CX258Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:53:48.502633Z","bundle_sha256":"5f965f3b7cac20089736a752c89318f605e3cf167754f4b4e3b0991ee40d1f91"}}